%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN327+1 : TPTP v8.2.0. Released v2.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 : Mon Jun 24 19:05:10 EDT 2024 % Result : Theorem 0.49s 0.59s % Output : CNFRefutation 0.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN327+1 : TPTP v8.2.0. Released v2.0.0. % 0.06/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n001.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Jun 23 23:02:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.49/0.55 start to proof:theBenchmark % 0.49/0.58 %------------------------------------------- % 0.49/0.58 % File :CSE---1.7 % 0.49/0.58 % Problem :theBenchmark % 0.49/0.58 % Transform :cnf % 0.49/0.58 % Format :tptp:raw % 0.49/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.49/0.58 % 0.49/0.58 % Result :Theorem 0.000000s % 0.49/0.58 % Output :CNFRefutation 0.000000s % 0.49/0.58 %------------------------------------------- % 0.49/0.59 %-------------------------------------------------------------------------- % 0.49/0.59 % File : SYN327+1 : TPTP v8.2.0. Released v2.0.0. % 0.49/0.59 % Domain : Syntactic % 0.49/0.59 % Problem : Church problem 46.12 (2) % 0.49/0.59 % Version : Especial. % 0.49/0.59 % English : % 0.49/0.59 % 0.49/0.59 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.49/0.59 % Source : [Chu56] % 0.49/0.59 % Names : 46.12 (2) [Chu56] % 0.49/0.59 % 0.49/0.59 % Status : Theorem % 0.49/0.59 % Rating : 0.00 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.11 v3.2.0, 0.22 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0 % 0.49/0.59 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.49/0.59 % Number of atoms : 7 ( 0 equ) % 0.49/0.59 % Maximal formula atoms : 7 ( 7 avg) % 0.49/0.59 % Number of connectives : 7 ( 1 ~; 0 |; 2 &) % 0.49/0.59 % ( 0 <=>; 4 =>; 0 <=; 0 <~>) % 0.49/0.59 % Maximal formula depth : 9 ( 9 avg) % 0.49/0.59 % Maximal term depth : 1 ( 1 avg) % 0.49/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.49/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.49/0.59 % Number of variables : 3 ( 2 !; 1 ?) % 0.49/0.59 % SPC : FOF_THM_RFO_NEQ % 0.49/0.59 % 0.49/0.59 % Comments : % 0.49/0.59 %-------------------------------------------------------------------------- % 0.49/0.59 fof(church_46_12_2,conjecture, % 0.49/0.59 ! [X] : % 0.49/0.59 ? [Y] : % 0.49/0.59 ! [Z] : % 0.49/0.59 ( big_f(Y,X) % 0.49/0.59 => ( ( big_f(X,Z) % 0.49/0.59 => big_f(X,Y) ) % 0.49/0.59 & ( big_f(X,Y) % 0.49/0.59 => ( ~ big_f(X,Z) % 0.49/0.59 => ( big_f(Y,X) % 0.49/0.59 & big_f(Z,Y) ) ) ) ) ) ). % 0.49/0.59 % 0.49/0.59 %-------------------------------------------------------------------------- % 0.49/0.59 %------------------------------------------- % 0.49/0.59 % Proof found % 0.49/0.59 % SZS status Theorem for theBenchmark % 0.49/0.59 % SZS output start Proof % 0.49/0.59 %ClaNum:6(EqnAxiom:0) % 0.49/0.59 %VarNum:15(SingletonVarNum:6) % 0.49/0.59 %MaxLitNum:3 % 0.49/0.59 %MaxfuncDepth:1 % 0.49/0.59 %SharedTerms:1 % 0.49/0.59 %goalClause: 1 2 3 4 5 6 % 0.49/0.59 %singleGoalClaCount:1 % 0.49/0.59 [1]P1(x11,a1) % 0.49/0.59 [2]P1(a1,x21)+P1(a1,f2(x21)) % 0.49/0.59 [3]~P1(a1,f3(x31))+P1(a1,f2(x31)) % 0.49/0.59 [4]~P1(a1,x41)+~P1(a1,f3(x41)) % 0.49/0.59 [5]~P1(x51,a1)+~P1(f3(x51),x51)+P1(a1,f2(x51)) % 0.49/0.59 [6]~P1(a1,x61)+~P1(f3(x61),x61)+~P1(x61,a1) % 0.49/0.59 %EqnAxiom % 0.49/0.59 % 0.49/0.59 %------------------------------------------- % 0.49/0.59 cnf(7,plain, % 0.49/0.59 (~P1(a1,a1)), % 0.49/0.59 inference(scs_inference,[],[1,6])). % 0.49/0.59 cnf(10,plain, % 0.49/0.59 ($false), % 0.49/0.59 inference(scs_inference,[],[1,7]), % 0.49/0.59 ['proof']). % 0.49/0.59 % SZS output end Proof % 0.49/0.59 % Total time :0.000000s %------------------------------------------------------------------------------