%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN319-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 : 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:08 EDT 2024 % Result : Unsatisfiable 0.59s 0.68s % Output : CNFRefutation 0.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SYN319-1 : TPTP v8.2.0. Released v1.2.0. % 0.04/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.14/0.35 % Computer : n024.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 19:26:24 EDT 2024 % 0.14/0.36 % CPUTime : % 0.58/0.64 start to proof:theBenchmark % 0.58/0.67 %------------------------------------------- % 0.58/0.67 % File :CSE---1.7 % 0.58/0.67 % Problem :theBenchmark % 0.58/0.67 % Transform :cnf % 0.58/0.67 % Format :tptp:raw % 0.58/0.67 % Command :java -jar mcs_scs.jar %d %s % 0.58/0.67 % 0.58/0.67 % Result :Theorem 0.000000s % 0.58/0.67 % Output :CNFRefutation 0.000000s % 0.58/0.67 %------------------------------------------- % 0.59/0.67 %-------------------------------------------------------------------------- % 0.59/0.68 % File : SYN319-1 : TPTP v8.2.0. Released v1.2.0. % 0.59/0.68 % Domain : Syntactic % 0.59/0.68 % Problem : Church problem 46.2 (5) % 0.59/0.68 % Version : Especial. % 0.59/0.68 % English : % 0.59/0.68 % 0.59/0.68 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.59/0.68 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.59/0.68 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.59/0.68 % Source : [Tam94] % 0.59/0.68 % Names : Ch2N5 [Tam94] % 0.59/0.68 % 0.59/0.68 % Status : Unsatisfiable % 0.59/0.68 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v2.0.0 % 0.59/0.68 % Syntax : Number of clauses : 7 ( 1 unt; 1 nHn; 6 RR) % 0.59/0.68 % Number of literals : 13 ( 0 equ; 7 neg) % 0.59/0.68 % Maximal clause size : 2 ( 1 avg) % 0.59/0.68 % Maximal term depth : 2 ( 1 avg) % 0.59/0.68 % Number of predicates : 3 ( 3 usr; 0 prp; 1-1 aty) % 0.59/0.68 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty) % 0.59/0.68 % Number of variables : 11 ( 6 sgn) % 0.59/0.68 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.59/0.68 % 0.59/0.68 % Comments : All the problems here can be decided by using a certain % 0.59/0.68 % completeness-preserving term ordering strategies. See [FL+93]. % 0.59/0.68 % : The conversion from the full 1st order form in [Chu56] % 0.59/0.68 % to clause form was done by hand by Tanel Tammet. % 0.59/0.68 %-------------------------------------------------------------------------- % 0.59/0.68 cnf(clause1,negated_conjecture, % 0.59/0.68 ( f(Y) % 0.59/0.68 | g(X) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause2,negated_conjecture, % 0.59/0.68 ( f(Y) % 0.59/0.68 | ~ f(z1(X,Y)) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause3,negated_conjecture, % 0.59/0.68 ( ~ g(z1(X,y)) % 0.59/0.68 | g(X) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause4,negated_conjecture, % 0.59/0.68 ( ~ g(z1(X,y)) % 0.59/0.68 | ~ f(z1(X,Y)) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause5,negated_conjecture, % 0.59/0.68 ( ~ f(X) % 0.59/0.68 | h(X) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause6,negated_conjecture, % 0.59/0.68 ( ~ g(X) % 0.59/0.68 | h(X) ) ). % 0.59/0.68 % 0.59/0.68 cnf(clause7,negated_conjecture, % 0.59/0.68 ~ h(z2(X,Y)) ). % 0.59/0.68 % 0.59/0.68 %-------------------------------------------------------------------------- % 0.59/0.68 %------------------------------------------- % 0.59/0.68 % Proof found % 0.59/0.68 % SZS status Theorem for theBenchmark % 0.59/0.68 % SZS output start Proof % 0.59/0.68 %ClaNum:7(EqnAxiom:0) % 0.59/0.68 %VarNum:16(SingletonVarNum:11) % 0.59/0.68 %MaxLitNum:2 % 0.59/0.68 %MaxfuncDepth:1 % 0.59/0.68 %SharedTerms:1 % 0.59/0.68 %goalClause: 1 2 3 4 5 6 7 % 0.59/0.68 %singleGoalClaCount:1 % 0.59/0.68 [1]~P1(f1(x11,x12)) % 0.59/0.68 [3]~P2(x31)+P1(x31) % 0.59/0.68 [4]~P3(x41)+P1(x41) % 0.59/0.68 [5]P3(x51)+~P3(f3(x51,a2)) % 0.59/0.68 [2]P2(x21)+P3(x22) % 0.59/0.68 [6]P2(x61)+~P2(f3(x62,x61)) % 0.59/0.68 [7]~P2(f3(x71,x72))+~P3(f3(x71,a2)) % 0.59/0.68 %EqnAxiom % 0.59/0.68 % 0.59/0.68 %------------------------------------------- % 0.59/0.68 cnf(12,plain, % 0.59/0.68 ($false), % 0.59/0.68 inference(scs_inference,[],[1,3,4,2]), % 0.59/0.68 ['proof']). % 0.59/0.68 % SZS output end Proof % 0.59/0.68 % Total time :0.000000s %------------------------------------------------------------------------------