%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN323-1 : TPTP v8.2.0. Released v1.2.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:09 EDT 2024 % Result : Unsatisfiable 0.54s 0.60s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN323-1 : TPTP v8.2.0. Released v1.2.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n024.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 20:44:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.54/0.59 %------------------------------------------- % 0.54/0.59 % File :CSE---1.7 % 0.54/0.59 % Problem :theBenchmark % 0.54/0.59 % Transform :cnf % 0.54/0.59 % Format :tptp:raw % 0.54/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.59 % 0.54/0.59 % Result :Theorem 0.000000s % 0.54/0.59 % Output :CNFRefutation 0.000000s % 0.54/0.59 %------------------------------------------- % 0.54/0.60 %-------------------------------------------------------------------------- % 0.54/0.60 % File : SYN323-1 : TPTP v8.2.0. Released v1.2.0. % 0.54/0.60 % Domain : Syntactic % 0.54/0.60 % Problem : Church problem 46.4 (2) % 0.54/0.60 % Version : Especial. % 0.54/0.60 % English : % 0.54/0.60 % 0.54/0.60 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.54/0.60 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.54/0.60 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.54/0.60 % Source : [Tam94] % 0.54/0.60 % Names : Ch4N2 [Tam94] % 0.54/0.60 % 0.54/0.60 % Status : Unsatisfiable % 0.54/0.60 % Rating : 0.00 v2.0.0 % 0.54/0.60 % Syntax : Number of clauses : 4 ( 0 unt; 1 nHn; 3 RR) % 0.54/0.60 % Number of literals : 8 ( 0 equ; 4 neg) % 0.54/0.60 % Maximal clause size : 2 ( 2 avg) % 0.54/0.60 % Maximal term depth : 1 ( 1 avg) % 0.54/0.60 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.54/0.60 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.54/0.60 % Number of variables : 4 ( 0 sgn) % 0.54/0.60 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.54/0.60 % 0.54/0.60 % Comments : All the problems here can be decided by using a certain % 0.54/0.60 % completeness-preserving term ordering strategies. See [FL+93]. % 0.54/0.60 % : The conversion from the full 1st order form in [Chu56] % 0.54/0.60 % to clause form was done by hand by Tanel Tammet. % 0.54/0.60 %-------------------------------------------------------------------------- % 0.54/0.60 cnf(clause1,negated_conjecture, % 0.54/0.60 ( f(X,a) % 0.54/0.60 | g(X,a) ) ). % 0.54/0.60 % 0.54/0.60 cnf(clause2,negated_conjecture, % 0.54/0.60 ( ~ f(a,X) % 0.54/0.60 | g(X,a) ) ). % 0.54/0.60 % 0.54/0.60 cnf(clause3,negated_conjecture, % 0.54/0.60 ( f(X,a) % 0.54/0.60 | ~ g(X,a) ) ). % 0.54/0.60 % 0.54/0.60 cnf(clause4,negated_conjecture, % 0.54/0.60 ( ~ f(a,X) % 0.54/0.60 | ~ g(X,a) ) ). % 0.54/0.60 % 0.54/0.60 %-------------------------------------------------------------------------- % 0.54/0.60 %------------------------------------------- % 0.54/0.60 % Proof found % 0.54/0.60 % SZS status Theorem for theBenchmark % 0.54/0.60 % SZS output start Proof % 0.54/0.60 %ClaNum:4(EqnAxiom:0) % 0.54/0.60 %VarNum:8(SingletonVarNum:4) % 0.54/0.60 %MaxLitNum:2 % 0.54/0.60 %MaxfuncDepth:0 % 0.54/0.60 %SharedTerms:1 % 0.54/0.60 %goalClause: 1 2 3 4 % 0.54/0.60 [1]P2(x11,a1)+P1(x11,a1) % 0.54/0.60 [2]~P2(x21,a1)+P1(x21,a1) % 0.54/0.60 [3]~P1(a1,x31)+P2(x31,a1) % 0.54/0.60 [4]~P1(a1,x41)+~P2(x41,a1) % 0.54/0.60 %EqnAxiom % 0.54/0.60 % 0.54/0.60 %------------------------------------------- % 0.54/0.60 cnf(5,plain, % 0.54/0.60 (P2(a1,a1)), % 0.54/0.60 inference(scs_inference,[],[1,3])). % 0.54/0.60 cnf(8,plain, % 0.54/0.60 ($false), % 0.54/0.60 inference(scs_inference,[],[5,4,2]), % 0.54/0.60 ['proof']). % 0.54/0.60 % SZS output end Proof % 0.54/0.60 % Total time :0.000000s %------------------------------------------------------------------------------