%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN326-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 : n025.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 : Unsatisfiable 0.44s 0.63s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SYN326-1 : TPTP v8.2.0. Released v1.2.0. % 0.08/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.14/0.35 % Computer : n025.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Jun 23 22:57:24 EDT 2024 % 0.14/0.35 % CPUTime : % 0.44/0.59 start to proof:theBenchmark % 0.44/0.63 %------------------------------------------- % 0.44/0.63 % File :CSE---1.7 % 0.44/0.63 % Problem :theBenchmark % 0.44/0.63 % Transform :cnf % 0.44/0.63 % Format :tptp:raw % 0.44/0.63 % Command :java -jar mcs_scs.jar %d %s % 0.44/0.63 % 0.44/0.63 % Result :Theorem 0.000000s % 0.44/0.63 % Output :CNFRefutation 0.000000s % 0.44/0.63 %------------------------------------------- % 0.44/0.63 %-------------------------------------------------------------------------- % 0.44/0.63 % File : SYN326-1 : TPTP v8.2.0. Released v1.2.0. % 0.44/0.63 % Domain : Syntactic % 0.44/0.63 % Problem : Church problem 46.12 (1) % 0.44/0.63 % Version : Especial. % 0.44/0.63 % English : % 0.44/0.63 % 0.44/0.63 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.44/0.63 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.44/0.63 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.44/0.63 % Source : [Tam94] % 0.44/0.63 % Names : Ch12N1 [Tam94] % 0.44/0.63 % 0.44/0.63 % Status : Unsatisfiable % 0.44/0.63 % Rating : 0.00 v2.0.0 % 0.44/0.63 % Syntax : Number of clauses : 7 ( 2 unt; 3 nHn; 3 RR) % 0.44/0.63 % Number of literals : 12 ( 0 equ; 3 neg) % 0.44/0.63 % Maximal clause size : 2 ( 1 avg) % 0.44/0.63 % Maximal term depth : 2 ( 1 avg) % 0.44/0.63 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 0.44/0.63 % Number of functors : 2 ( 2 usr; 0 con; 1-1 aty) % 0.44/0.63 % Number of variables : 7 ( 0 sgn) % 0.44/0.63 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.44/0.63 % 0.44/0.63 % Comments : All the problems here can be decided by using a certain % 0.44/0.63 % completeness-preserving term ordering strategies. See [FL+93]. % 0.44/0.63 % : The conversion from the full 1st order form in [Chu56] % 0.44/0.63 % to clause form was done by hand by Tanel Tammet. % 0.44/0.63 %-------------------------------------------------------------------------- % 0.44/0.63 cnf(clause1,negated_conjecture, % 0.44/0.63 ( f(y(X),z(X)) % 0.44/0.63 | f(X,X) ) ). % 0.44/0.63 % 0.44/0.63 cnf(clause2,negated_conjecture, % 0.44/0.63 ( g(y(X)) % 0.44/0.63 | f(X,X) ) ). % 0.44/0.63 % 0.44/0.63 cnf(clause3,negated_conjecture, % 0.44/0.63 ( ~ h(X) % 0.44/0.63 | f(X,X) ) ). % 0.44/0.63 % 0.44/0.63 cnf(clause4,negated_conjecture, % 0.44/0.63 ( f(z(X),X) % 0.44/0.63 | h(z(X)) ) ). % 0.44/0.63 % 0.44/0.63 cnf(clause5,negated_conjecture, % 0.44/0.63 ( ~ g(X) % 0.44/0.63 | h(z(X)) ) ). % 0.44/0.63 % 0.44/0.63 cnf(clause6,negated_conjecture, % 0.44/0.63 f(X,y(X)) ). % 0.44/0.63 % 0.44/0.63 cnf(clause7,negated_conjecture, % 0.44/0.63 ~ f(z(X),z(X)) ). % 0.44/0.63 % 0.44/0.63 %-------------------------------------------------------------------------- % 0.44/0.63 %------------------------------------------- % 0.44/0.63 % Proof found % 0.44/0.63 % SZS status Theorem for theBenchmark % 0.44/0.63 % SZS output start Proof % 0.44/0.64 %ClaNum:7(EqnAxiom:0) % 0.44/0.64 %VarNum:19(SingletonVarNum:7) % 0.44/0.64 %MaxLitNum:2 % 0.44/0.64 %MaxfuncDepth:1 % 0.44/0.64 %SharedTerms:0 % 0.44/0.64 %goalClause: 1 2 3 4 5 6 7 % 0.44/0.64 %singleGoalClaCount:2 % 0.44/0.64 [1]P1(x11,f1(x11)) % 0.44/0.64 [2]~P1(f2(x21),f2(x21)) % 0.44/0.64 [4]~P2(x41)+P1(x41,x41) % 0.44/0.64 [3]~P3(x31)+P2(f2(x31)) % 0.44/0.64 [5]P1(x51,x51)+P3(f1(x51)) % 0.44/0.64 [6]P1(f2(x61),x61)+P2(f2(x61)) % 0.44/0.64 [7]P1(x71,x71)+P1(f1(x71),f2(x71)) % 0.44/0.64 %EqnAxiom % 0.44/0.64 % 0.44/0.64 %------------------------------------------- % 0.57/0.64 cnf(12,plain, % 0.57/0.64 (P1(x121,x121)), % 0.57/0.64 inference(scs_inference,[],[2,4,3,5])). % 0.57/0.64 cnf(13,plain, % 0.57/0.64 ($false), % 0.57/0.64 inference(scs_inference,[],[2,12]), % 0.57/0.64 ['proof']). % 0.57/0.64 % SZS output end Proof % 0.57/0.64 % Total time :0.000000s %------------------------------------------------------------------------------