%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : SYN986+1.000 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 : Mon Jun 24 19:07:30 EDT 2024
% Result : Theorem 0.18s 0.59s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN986+1.000 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun Jun 23 23:55:54 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.55 start to proof:theBenchmark
% 0.18/0.58 %-------------------------------------------
% 0.18/0.58 % File :CSE---1.7
% 0.18/0.58 % Problem :theBenchmark
% 0.18/0.58 % Transform :cnf
% 0.18/0.58 % Format :tptp:raw
% 0.18/0.58 % Command :java -jar mcs_scs.jar %d %s
% 0.18/0.58
% 0.18/0.58 % Result :Theorem 0.000000s
% 0.18/0.58 % Output :CNFRefutation 0.000000s
% 0.18/0.58 %-------------------------------------------
% 0.18/0.59 %------------------------------------------------------------------------------
% 0.18/0.59 % File : SYN986+1.000 : TPTP v8.2.0. Released v4.0.0.
% 0.18/0.59 % Domain : Syntactic
% 0.18/0.59 % Problem : Orevkov formula - size 0
% 0.18/0.59 % Version : [TS00] axioms : Especial.
% 0.18/0.59 % English : hyp(2,k,1) is defined. Each Ck has a non-normal natural deduction
% 0.18/0.59 % of size linear in k, and each normal deduction of Ck has at least
% 0.18/0.59 % hyp(2,k,1)=2_k nodes.
% 0.18/0.59
% 0.18/0.59 % Refs : [TS00] Troelstra & Schwichtenberg (2000), Basic Proof Theory
% 0.18/0.59 % : [Rat08] Raths (2008), Email to G. Sutcliffe
% 0.18/0.59 % Source : [Rat08]
% 0.18/0.59 % Names :
% 0.18/0.59
% 0.18/0.59 % Status : Theorem
% 0.18/0.59 % Rating : 0.00 v5.3.0, 0.04 v5.2.0, 0.07 v5.1.0, 0.14 v5.0.0, 0.10 v4.1.0, 0.11 v4.0.1, 0.47 v4.0.0
% 0.18/0.59 % Syntax : Number of formulae : 3 ( 2 unt; 0 def)
% 0.18/0.59 % Number of atoms : 5 ( 0 equ)
% 0.18/0.59 % Maximal formula atoms : 3 ( 1 avg)
% 0.18/0.59 % Number of connectives : 2 ( 0 ~; 0 |; 0 &)
% 0.18/0.59 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.18/0.59 % Maximal formula depth : 7 ( 4 avg)
% 0.18/0.59 % Maximal term depth : 2 ( 1 avg)
% 0.18/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.18/0.59 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% 0.18/0.59 % Number of variables : 6 ( 5 !; 1 ?)
% 0.18/0.59 % SPC : FOF_THM_RFO_NEQ
% 0.18/0.59
% 0.18/0.59 % Comments : Inspiration by Wolfgang Bibel, Helmut Schwichtenberg.
% 0.18/0.59 % : The complexity of proof seach is hyper-exponential with the size
% 0.18/0.59 % of the formulae: 2^0=1, 2^1=2, 2^2=4, 2^4=16, 2^16=65536,
% 0.18/0.59 % 2^65536 = mmmh... ?
% 0.18/0.59 %------------------------------------------------------------------------------
% 0.18/0.59 %----Include Orevkov formula
% 0.18/0.59 include('Axioms/SYN002+0.ax').
% 0.18/0.59 %------------------------------------------------------------------------------
% 0.18/0.59 fof(ck,conjecture,
% 0.18/0.59 ? [Z0] : r(zero,zero,Z0) ).
% 0.18/0.59
% 0.18/0.59 %------------------------------------------------------------------------------
% 0.18/0.59 %-------------------------------------------
% 0.18/0.59 % Proof found
% 0.18/0.59 % SZS status Theorem for theBenchmark
% 0.18/0.59 % SZS output start Proof
% 0.18/0.59 %ClaNum:3(EqnAxiom:0)
% 0.18/0.59 %VarNum:12(SingletonVarNum:6)
% 0.18/0.59 %MaxLitNum:3
% 0.18/0.59 %MaxfuncDepth:1
% 0.18/0.59 %SharedTerms:1
% 0.18/0.59 %goalClause: 2
% 0.18/0.59 %singleGoalClaCount:1
% 0.18/0.59 [2]~P1(a1,a1,x21)
% 0.18/0.59 [1]P1(x11,a1,f2(x11))
% 0.18/0.59 [3]~P1(x31,x32,x34)+~P1(x34,x32,x33)+P1(x31,f2(x32),x33)
% 0.18/0.59 %EqnAxiom
% 0.18/0.59
% 0.18/0.59 %-------------------------------------------
% 0.18/0.59 cnf(4,plain,
% 0.18/0.59 ($false),
% 0.18/0.59 inference(scs_inference,[],[2,1]),
% 0.18/0.59 ['proof']).
% 0.18/0.59 % SZS output end Proof
% 0.18/0.59 % Total time :0.000000s
%------------------------------------------------------------------------------