%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN345+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 : n024.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:15 EDT 2024 % Result : Theorem 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN345+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.13/0.33 % Computer : n024.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sun Jun 23 20:17:39 EDT 2024 % 0.13/0.33 % CPUTime : % 0.50/0.55 start to proof:theBenchmark % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % File :CSE---1.7 % 0.52/0.58 % Problem :theBenchmark % 0.52/0.58 % Transform :cnf % 0.52/0.58 % Format :tptp:raw % 0.52/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.58 % 0.52/0.58 % Result :Theorem 0.000000s % 0.52/0.58 % Output :CNFRefutation 0.000000s % 0.52/0.58 %------------------------------------------- % 0.52/0.58 %-------------------------------------------------------------------------- % 0.52/0.58 % File : SYN345+1 : TPTP v8.2.0. Released v2.0.0. % 0.52/0.58 % Domain : Syntactic % 0.52/0.58 % Problem : Church problem 46.16 (4) % 0.52/0.58 % Version : Especial. % 0.52/0.58 % English : % 0.52/0.58 % 0.52/0.58 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.52/0.59 % Source : [Chu56] % 0.52/0.59 % Names : 46.16 (4) [Chu56] % 0.52/0.59 % 0.52/0.59 % Status : Theorem % 0.52/0.59 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.5.0, 0.08 v5.4.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 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.52/0.59 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.52/0.59 % Number of atoms : 12 ( 0 equ) % 0.52/0.59 % Maximal formula atoms : 12 ( 12 avg) % 0.52/0.59 % Number of connectives : 11 ( 0 ~; 0 |; 1 &) % 0.52/0.59 % ( 1 <=>; 9 =>; 0 <=; 0 <~>) % 0.52/0.59 % Maximal formula depth : 11 ( 11 avg) % 0.52/0.59 % Maximal term depth : 1 ( 1 avg) % 0.52/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.52/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.52/0.59 % Number of variables : 5 ( 3 !; 2 ?) % 0.52/0.59 % SPC : FOF_THM_RFO_NEQ % 0.52/0.59 % 0.52/0.59 % Comments : % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 fof(church_46_16_4,conjecture, % 0.52/0.59 ! [X1,X2] : % 0.52/0.59 ? [Y1,Y2] : % 0.52/0.59 ! [Z] : % 0.52/0.59 ( ( ( big_f(X1,X2,Y1) % 0.52/0.59 => big_f(Y2,Y1,Z) ) % 0.52/0.59 => ( big_f(X1,X1,X2) % 0.52/0.59 => big_f(X1,X2,X2) ) ) % 0.52/0.59 => ( ( ( big_f(X2,Y1,Y2) % 0.52/0.59 => big_f(Y1,Z,Z) ) % 0.52/0.59 => ( big_f(X1,X2,X2) % 0.52/0.59 => big_f(X1,X1,X2) ) ) % 0.52/0.59 => ( big_f(Y1,Y2,Z) % 0.52/0.59 => ( big_f(X2,X2,Y1) % 0.52/0.59 & ( big_f(X1,X1,X2) % 0.52/0.59 <=> big_f(X1,X2,X2) ) ) ) ) ) ). % 0.52/0.59 % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:7(EqnAxiom:0) % 0.52/0.59 %VarNum:14(SingletonVarNum:9) % 0.52/0.59 %MaxLitNum:3 % 0.52/0.59 %MaxfuncDepth:1 % 0.52/0.59 %SharedTerms:6 % 0.52/0.59 %goalClause: 1 2 3 4 5 7 % 0.52/0.59 %singleGoalClaCount:1 % 0.52/0.59 [1]P1(x11,x12,f1(x11,x12)) % 0.52/0.59 [2]P1(a2,a3,x21)+P1(a2,a3,a3)+~P1(a2,a2,a3) % 0.52/0.59 [3]P1(a2,a3,a3)+~P1(a3,a3,x31)+P1(a2,a2,a3) % 0.52/0.59 [5]~P1(a2,a2,a3)+~P1(a2,a3,a3)+~P1(a3,a3,x51) % 0.52/0.59 [4]P1(a3,x41,x42)+P1(a2,a2,a3)+~P1(a2,a3,a3) % 0.52/0.59 [7]P1(a2,a2,a3)+~P1(a2,a3,a3)+~P1(x71,f1(x71,x72),f1(x71,x72)) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.59 cnf(8,plain, % 0.52/0.59 (~P1(a2,a2,a3)+P1(a2,a3,a3)), % 0.52/0.59 inference(factoring_inference,[],[2])). % 0.52/0.59 cnf(9,plain, % 0.52/0.59 (P1(a2,a3,a3)+P1(a2,a2,a3)), % 0.52/0.59 inference(scs_inference,[],[1,3])). % 0.52/0.59 cnf(15,plain, % 0.52/0.59 (~P1(a2,a3,a3)+~P1(a2,a2,a3)), % 0.52/0.59 inference(scs_inference,[],[1,5])). % 0.52/0.59 cnf(16,plain, % 0.52/0.59 (~P1(a2,a2,a3)), % 0.52/0.59 inference(scs_inference,[],[8,15])). % 0.52/0.59 cnf(17,plain, % 0.52/0.59 (~P1(a2,a3,a3)+P1(a3,x171,x172)), % 0.52/0.59 inference(scs_inference,[],[16,4])). % 0.52/0.59 cnf(18,plain, % 0.52/0.59 (~P1(a2,a3,a3)+~P1(x181,f1(x181,x182),f1(x181,x182))), % 0.52/0.59 inference(scs_inference,[],[16,7])). % 0.52/0.59 cnf(19,plain, % 0.52/0.59 (P1(a2,a3,a3)), % 0.52/0.59 inference(scs_inference,[],[16,9])). % 0.52/0.59 cnf(20,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[19,17,18]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------