%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN331-1 : TPTP v8.2.0. Released v1.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n020.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:11 EDT 2024 % Result : Unsatisfiable 116.12s 116.83s % Output : CNFRefutation 116.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN331-1 : TPTP v8.2.0. Released v1.2.0. % 0.03/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.10/0.31 % Computer : n020.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Sun Jun 23 21:28:54 EDT 2024 % 0.10/0.31 % CPUTime : % 0.17/0.54 start to proof:theBenchmark % 116.12/116.82 %------------------------------------------- % 116.12/116.82 % File :CSE---1.7 % 116.12/116.82 % Problem :theBenchmark % 116.12/116.82 % Transform :cnf % 116.12/116.82 % Format :tptp:raw % 116.12/116.82 % Command :java -jar mcs_scs.jar %d %s % 116.12/116.82 % 116.12/116.82 % Result :Theorem 115.600000s % 116.12/116.82 % Output :CNFRefutation 115.600000s % 116.12/116.82 %------------------------------------------- % 116.12/116.83 %-------------------------------------------------------------------------- % 116.12/116.83 % File : SYN331-1 : TPTP v8.2.0. Released v1.2.0. % 116.12/116.83 % Domain : Syntactic % 116.12/116.83 % Problem : Church problem 46.14 (3) % 116.12/116.83 % Version : Especial. % 116.12/116.83 % English : % 116.12/116.83 % 116.12/116.83 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 116.12/116.83 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 116.12/116.83 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 116.12/116.83 % Source : [Tam94] % 116.12/116.83 % Names : Ch14N3 [Tam94] % 116.12/116.83 % 116.12/116.83 % Status : Unsatisfiable % 116.12/116.83 % Rating : 0.00 v2.0.0 % 116.12/116.83 % Syntax : Number of clauses : 7 ( 4 unt; 1 nHn; 4 RR) % 116.12/116.83 % Number of literals : 10 ( 0 equ; 4 neg) % 116.12/116.83 % Maximal clause size : 2 ( 1 avg) % 116.12/116.83 % Maximal term depth : 2 ( 1 avg) % 116.12/116.83 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 116.12/116.83 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty) % 116.12/116.83 % Number of variables : 14 ( 4 sgn) % 116.12/116.83 % SPC : CNF_UNS_RFO_NEQ_NHN % 116.12/116.83 % 116.12/116.83 % Comments : All the problems here can be decided by using a certain % 116.12/116.83 % completeness-preserving term ordering strategies. See [FL+93]. % 116.12/116.83 % : The conversion from the full 1st order form in [Chu56] % 116.12/116.83 % to clause form was done by hand by Tanel Tammet. % 116.12/116.83 %-------------------------------------------------------------------------- % 116.12/116.83 cnf(clause1,negated_conjecture, % 116.12/116.83 f(X,z(X,Y)) ). % 116.12/116.83 % 116.12/116.83 cnf(clause2,negated_conjecture, % 116.12/116.83 f(Y,z(X,Y)) ). % 116.12/116.83 % 116.12/116.83 cnf(clause3,negated_conjecture, % 116.12/116.83 ( f(X,Y) % 116.12/116.83 | ~ f(z(X,Y),z(X,Y)) ) ). % 116.12/116.83 % 116.12/116.83 cnf(clause4,negated_conjecture, % 116.12/116.83 ( ~ f(X,Y) % 116.12/116.83 | f(z(X,Y),z(X,Y)) ) ). % 116.12/116.83 % 116.12/116.83 cnf(clause5,negated_conjecture, % 116.12/116.83 ( f(Y,X) % 116.12/116.83 | f(z(X,Y),z(X,Y)) ) ). % 116.12/116.83 % 116.12/116.83 cnf(clause6,negated_conjecture, % 116.12/116.83 ~ f(z(X,Y),X) ). % 116.12/116.83 % 116.12/116.83 cnf(clause7,negated_conjecture, % 116.12/116.83 ~ f(z(X,Y),Y) ). % 116.12/116.83 % 116.12/116.83 %-------------------------------------------------------------------------- % 116.12/116.83 %------------------------------------------- % 116.12/116.83 % Proof found % 116.12/116.83 % SZS status Theorem for theBenchmark % 116.12/116.83 % SZS output start Proof % 116.12/116.84 %ClaNum:7(EqnAxiom:0) % 116.12/116.84 %VarNum:30(SingletonVarNum:14) % 116.12/116.84 %MaxLitNum:2 % 116.12/116.84 %MaxfuncDepth:1 % 116.12/116.84 %SharedTerms:0 % 116.12/116.84 %goalClause: 1 2 3 4 5 6 7 % 116.12/116.84 %singleGoalClaCount:4 % 116.12/116.84 [1]P1(x11,f1(x12,x11)) % 116.12/116.84 [2]P1(x21,f1(x21,x22)) % 116.12/116.84 [3]~P1(f1(x31,x32),x32) % 116.12/116.84 [4]~P1(f1(x41,x42),x41) % 116.12/116.84 [5]P1(x51,x52)+P1(f1(x52,x51),f1(x52,x51)) % 116.12/116.84 [6]~P1(x61,x62)+P1(f1(x61,x62),f1(x61,x62)) % 116.12/116.84 [7]P1(x71,x72)+~P1(f1(x71,x72),f1(x71,x72)) % 116.12/116.84 %EqnAxiom % 116.12/116.84 % 116.12/116.84 %------------------------------------------- % 116.12/116.85 cnf(8,plain, % 116.12/116.85 (P1(f1(f1(f1(x81,x82),x82),f1(f1(x81,x82),x82)),f1(f1(f1(x81,x82),x82),f1(f1(x81,x82),x82)))), % 116.12/116.85 inference(scs_inference,[],[3,5,7])). % 116.12/116.85 cnf(13,plain, % 116.12/116.85 (P1(f1(f1(x131,x132),x132),f1(f1(x131,x132),x132))), % 116.12/116.85 inference(scs_inference,[],[8,7])). % 116.12/116.85 cnf(15,plain, % 116.12/116.85 ($false), % 116.12/116.85 inference(scs_inference,[],[13,3,7]), % 116.12/116.86 ['proof']). % 116.12/116.86 % SZS output end Proof % 116.12/116.86 % Total time :115.600000s %------------------------------------------------------------------------------