TSTP Solution File: SYN053-1 by CSE---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.5
% Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 21:03:23 EDT 2022

% Result   : Unsatisfiable 0.50s 0.63s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n001.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Sep  5 01:46:44 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.50/0.57  start to proof:theBenchmark
% 0.50/0.62  %-------------------------------------------
% 0.50/0.62  % File        :CSE---1.5
% 0.50/0.62  % Problem     :theBenchmark
% 0.50/0.62  % Transform   :cnf
% 0.50/0.62  % Format      :tptp:raw
% 0.50/0.62  % Command     :java -jar mcs_scs.jar %d %s
% 0.50/0.62  
% 0.50/0.62  % Result      :Theorem 0.000000s
% 0.50/0.62  % Output      :CNFRefutation 0.000000s
% 0.50/0.62  %-------------------------------------------
% 0.50/0.63  %--------------------------------------------------------------------------
% 0.50/0.63  % File     : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.50/0.63  % Domain   : Syntactic
% 0.50/0.63  % Problem  : Pelletier Problem 23
% 0.50/0.63  % Version  : Especial.
% 0.50/0.63  % English  :
% 0.50/0.63  
% 0.50/0.63  % Refs     : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.50/0.63  % Source   : [Pel86]
% 0.50/0.63  % Names    : Pelletier 23 [Pel86]
% 0.50/0.63  
% 0.50/0.63  % Status   : Unsatisfiable
% 0.50/0.63  % Rating   : 0.00 v2.1.0, 0.00 v2.0.0
% 0.50/0.63  % Syntax   : Number of clauses     :    5 (   1 unt;   3 nHn;   2 RR)
% 0.50/0.63  %            Number of literals    :   12 (   0 equ;   4 neg)
% 0.50/0.63  %            Maximal clause size   :    3 (   2 avg)
% 0.50/0.63  %            Maximal term depth    :    1 (   1 avg)
% 0.50/0.63  %            Number of predicates  :    2 (   2 usr;   1 prp; 0-1 aty)
% 0.50/0.63  %            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
% 0.50/0.63  %            Number of variables   :    4 (   4 sgn)
% 0.50/0.63  % SPC      : CNF_UNS_EPR_NEQ_NHN
% 0.50/0.63  
% 0.50/0.63  % Comments :
% 0.50/0.63  %--------------------------------------------------------------------------
% 0.50/0.63  cnf(clause_1,negated_conjecture,
% 0.50/0.63      ( p
% 0.50/0.63      | big_f(X)
% 0.50/0.63      | big_f(Y) ) ).
% 0.50/0.63  
% 0.50/0.63  cnf(clause_2,negated_conjecture,
% 0.50/0.63      ( p
% 0.50/0.63      | big_f(X)
% 0.50/0.63      | big_f(b) ) ).
% 0.50/0.63  
% 0.50/0.63  cnf(clause_3,negated_conjecture,
% 0.50/0.63      ~ p ).
% 0.50/0.63  
% 0.50/0.63  cnf(clause_4,negated_conjecture,
% 0.50/0.63      ( ~ big_f(a)
% 0.50/0.63      | p
% 0.50/0.63      | big_f(Y) ) ).
% 0.50/0.63  
% 0.50/0.63  cnf(clause_5,negated_conjecture,
% 0.50/0.63      ( ~ big_f(a)
% 0.50/0.63      | ~ big_f(b) ) ).
% 0.50/0.63  
% 0.50/0.63  %--------------------------------------------------------------------------
% 0.50/0.63  %-------------------------------------------
% 0.50/0.63  % Proof found
% 0.50/0.63  % SZS status Theorem for theBenchmark
% 0.50/0.63  % SZS output start Proof
% 0.50/0.63  %ClaNum:5(EqnAxiom:0)
% 0.50/0.63  %VarNum:2(SingletonVarNum:2)
% 0.50/0.63  %MaxLitNum:3
% 0.50/0.63  %MaxfuncDepth:0
% 0.50/0.63  %SharedTerms:8
% 0.50/0.63  %goalClause: 1 3 4
% 0.50/0.63  %singleGoalClaCount:1
% 0.50/0.63  [1]~P1(a500)
% 0.50/0.63  [3]~P2(a1)+~P2(a2)
% 0.50/0.63  [4]P2(x41)+P2(x42)+P1(a500)
% 0.50/0.63  %EqnAxiom
% 0.50/0.63  
% 0.50/0.63  %-------------------------------------------
% 0.50/0.63  cnf(6,plain,
% 0.50/0.63     (P2(x61)+P2(x62)),
% 0.50/0.63     inference(scs_inference,[],[1,4])).
% 0.50/0.63  cnf(7,plain,
% 0.50/0.63     (~P2(a1)),
% 0.50/0.63     inference(scs_inference,[],[3,6])).
% 0.50/0.63  cnf(9,plain,
% 0.50/0.63     ($false),
% 0.50/0.63     inference(scs_inference,[],[7,6]),
% 0.50/0.63     ['proof']).
% 0.50/0.63  % SZS output end Proof
% 0.50/0.63  % Total time :0.000000s
%------------------------------------------------------------------------------