%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN315+1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n029.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:08 EDT 2024 % Result : Theorem 0.50s 0.62s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN315+1 : TPTP v8.2.0. Released v2.0.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n029.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 19:14:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.58 start to proof:theBenchmark % 0.50/0.61 %------------------------------------------- % 0.50/0.61 % File :CSE---1.7 % 0.50/0.61 % 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.62 %-------------------------------------------------------------------------- % 0.50/0.62 % File : SYN315+1 : TPTP v8.2.0. Released v2.0.0. % 0.50/0.62 % Domain : Syntactic % 0.50/0.62 % Problem : Church problem 46.2 (1) % 0.50/0.62 % Version : Especial. % 0.50/0.62 % English : % 0.50/0.62 % 0.50/0.62 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.50/0.62 % Source : [Chu56] % 0.50/0.62 % Names : 46.2 (1) [Chu56] % 0.50/0.62 % 0.50/0.62 % Status : Theorem % 0.50/0.62 % Rating : 0.00 v5.3.0, 0.09 v5.2.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.50/0.62 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.50/0.62 % Number of atoms : 4 ( 0 equ) % 0.50/0.62 % Maximal formula atoms : 4 ( 4 avg) % 0.50/0.62 % Number of connectives : 3 ( 0 ~; 0 |; 0 &) % 0.50/0.62 % ( 2 <=>; 1 =>; 0 <=; 0 <~>) % 0.50/0.62 % Maximal formula depth : 5 ( 5 avg) % 0.50/0.62 % Maximal term depth : 1 ( 1 avg) % 0.50/0.62 % Number of predicates : 2 ( 2 usr; 1 prp; 0-1 aty) % 0.50/0.62 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.50/0.62 % Number of variables : 2 ( 1 !; 1 ?) % 0.50/0.62 % SPC : FOF_THM_RFO_NEQ % 0.50/0.62 % 0.50/0.62 % Comments : % 0.50/0.62 %-------------------------------------------------------------------------- % 0.50/0.62 fof(church_46_2_1,conjecture, % 0.50/0.62 ? [X] : % 0.50/0.62 ! [Y] : % 0.50/0.62 ( ( big_f(X) % 0.50/0.62 <=> p ) % 0.50/0.62 => ( big_f(Y) % 0.50/0.62 <=> p ) ) ). % 0.50/0.62 % 0.50/0.62 %-------------------------------------------------------------------------- % 0.50/0.62 %------------------------------------------- % 0.50/0.62 % Proof found % 0.50/0.62 % SZS status Theorem for theBenchmark % 0.50/0.62 % SZS output start Proof % 0.50/0.62 %ClaNum:4(EqnAxiom:0) % 0.50/0.62 %VarNum:2(SingletonVarNum:2) % 0.50/0.62 %MaxLitNum:2 % 0.50/0.62 %MaxfuncDepth:0 % 0.50/0.62 %SharedTerms:6 % 0.50/0.62 %goalClause: 1 2 3 4 % 0.50/0.62 [1]P1(a5000)+P2(a1) % 0.50/0.62 [3]~P1(a5000)+~P2(a1) % 0.50/0.62 [2]P2(x21)+~P1(a5000) % 0.50/0.62 [4]~P2(x41)+P1(a5000) % 0.50/0.62 %EqnAxiom % 0.50/0.62 % 0.50/0.62 %------------------------------------------- % 0.50/0.63 cnf(5,plain, % 0.50/0.63 (P2(x51)+P2(a1)), % 0.50/0.63 inference(scs_inference,[],[1,2])). % 0.50/0.63 cnf(6,plain, % 0.50/0.63 (P2(a1)), % 0.50/0.63 inference(factoring_inference,[],[5])). % 0.50/0.63 cnf(7,plain, % 0.50/0.63 (~P1(a5000)), % 0.50/0.63 inference(scs_inference,[],[6,3])). % 0.50/0.63 cnf(8,plain, % 0.50/0.63 (P1(a5000)), % 0.50/0.63 inference(scs_inference,[],[6,4])). % 0.50/0.63 cnf(9,plain, % 0.50/0.63 ($false), % 0.50/0.63 inference(scs_inference,[],[7,8]), % 0.57/0.63 ['proof']). % 0.57/0.63 % SZS output end Proof % 0.57/0.63 % Total time :0.000000s %------------------------------------------------------------------------------