%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN345-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 : n032.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:15 EDT 2024 % Result : Unsatisfiable 0.13s 0.52s % Output : CNFRefutation 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.09 % Problem : SYN345-1 : TPTP v8.2.0. Released v1.2.0. % 0.07/0.09 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.28 % Computer : n032.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 300 % 0.09/0.28 % DateTime : Sun Jun 23 20:30:08 EDT 2024 % 0.09/0.28 % CPUTime : % 0.13/0.47 start to proof:theBenchmark % 0.13/0.51 %------------------------------------------- % 0.13/0.51 % File :CSE---1.7 % 0.13/0.51 % Problem :theBenchmark % 0.13/0.51 % Transform :cnf % 0.13/0.51 % Format :tptp:raw % 0.13/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.13/0.51 % 0.13/0.51 % Result :Theorem 0.020000s % 0.13/0.51 % Output :CNFRefutation 0.020000s % 0.13/0.51 %------------------------------------------- % 0.13/0.52 %-------------------------------------------------------------------------- % 0.13/0.52 % File : SYN345-1 : TPTP v8.2.0. Released v1.2.0. % 0.13/0.52 % Domain : Syntactic % 0.13/0.52 % Problem : Church problem 46.16 (4) % 0.13/0.52 % Version : Especial. % 0.13/0.52 % English : % 0.13/0.52 % 0.13/0.52 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.13/0.52 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.13/0.52 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.13/0.52 % Source : [Tam94] % 0.13/0.52 % Names : Ch16N4 [Tam94] % 0.13/0.52 % 0.13/0.52 % Status : Unsatisfiable % 0.13/0.52 % Rating : 0.08 v8.2.0, 0.00 v2.0.0 % 0.13/0.52 % Syntax : Number of clauses : 8 ( 0 unt; 4 nHn; 4 RR) % 0.13/0.52 % Number of literals : 24 ( 0 equ; 12 neg) % 0.13/0.52 % Maximal clause size : 3 ( 3 avg) % 0.13/0.52 % Maximal term depth : 2 ( 1 avg) % 0.13/0.52 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.13/0.52 % Number of functors : 3 ( 3 usr; 2 con; 0-2 aty) % 0.13/0.52 % Number of variables : 13 ( 5 sgn) % 0.13/0.52 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.13/0.52 % 0.13/0.52 % Comments : All the problems here can be decided by using a certain % 0.13/0.52 % completeness-preserving term ordering strategies. See [FL+93]. % 0.13/0.52 % : The conversion from the full 1st order form in [Chu56] % 0.13/0.52 % to clause form was done by hand by Tanel Tammet. % 0.13/0.52 %-------------------------------------------------------------------------- % 0.13/0.52 cnf(clause1,negated_conjecture, % 0.13/0.52 ( f(a,b,Y1) % 0.13/0.52 | ~ f(a,a,b) % 0.13/0.52 | f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause2,negated_conjecture, % 0.13/0.52 ( ~ f(Y2,Y1,z(Y1,Y2)) % 0.13/0.52 | ~ f(a,a,b) % 0.13/0.52 | f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause3,negated_conjecture, % 0.13/0.52 ( f(b,Y1,Y2) % 0.13/0.52 | f(a,a,b) % 0.13/0.52 | ~ f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause4,negated_conjecture, % 0.13/0.52 ( ~ f(Y1,z(Y1,Y2),z(Y1,Y2)) % 0.13/0.52 | f(a,a,b) % 0.13/0.52 | ~ f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause5,negated_conjecture, % 0.13/0.52 ( f(Y1,Y2,z(Y1,Y2)) % 0.13/0.52 | f(a,a,b) % 0.13/0.52 | f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause6,negated_conjecture, % 0.13/0.52 ( f(Y1,Y2,z(Y1,Y2)) % 0.13/0.52 | ~ f(a,a,b) % 0.13/0.52 | ~ f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause7,negated_conjecture, % 0.13/0.52 ( ~ f(b,b,Y1) % 0.13/0.52 | f(a,a,b) % 0.13/0.52 | f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 cnf(clause8,negated_conjecture, % 0.13/0.52 ( ~ f(b,b,Y1) % 0.13/0.52 | ~ f(a,a,b) % 0.13/0.52 | ~ f(a,b,b) ) ). % 0.13/0.52 % 0.13/0.52 %-------------------------------------------------------------------------- % 0.13/0.52 %------------------------------------------- % 0.13/0.52 % Proof found % 0.13/0.52 % SZS status Theorem for theBenchmark % 0.13/0.52 % SZS output start Proof % 0.13/0.52 %ClaNum:8(EqnAxiom:0) % 0.13/0.52 %VarNum:18(SingletonVarNum:11) % 0.13/0.52 %MaxLitNum:3 % 0.13/0.52 %MaxfuncDepth:1 % 0.13/0.52 %SharedTerms:6 % 0.13/0.52 %goalClause: 1 2 3 4 5 6 8 % 0.13/0.52 [1]P1(a1,a2,x11)+P1(a1,a2,a2)+~P1(a1,a1,a2) % 0.13/0.52 [3]P1(a1,a2,a2)+P1(a1,a1,a2)+~P1(a2,a2,x31) % 0.13/0.52 [6]~P1(a1,a1,a2)+~P1(a1,a2,a2)+~P1(a2,a2,x61) % 0.13/0.52 [4]P1(a1,a1,a2)+P1(a2,x41,x42)+~P1(a1,a2,a2) % 0.13/0.52 [2]P1(x21,x22,f3(x21,x22))+P1(a1,a2,a2)+P1(a1,a1,a2) % 0.13/0.52 [5]P1(x51,x52,f3(x51,x52))+~P1(a1,a1,a2)+~P1(a1,a2,a2) % 0.13/0.52 [8]P1(a1,a1,a2)+~P1(a1,a2,a2)+~P1(x81,f3(x81,x82),f3(x81,x82)) % 0.13/0.52 %EqnAxiom % 0.13/0.52 % 0.13/0.52 %------------------------------------------- % 0.46/0.52 cnf(9,plain, % 0.46/0.52 (~P1(a1,a1,a2)+P1(a1,a2,a2)), % 0.46/0.52 inference(factoring_inference,[],[1])). % 0.46/0.52 cnf(11,plain, % 0.46/0.52 (P1(a1,a1,a2)+~P1(x111,f3(x111,x112),f3(x111,x112))+~P1(a2,a2,x113)), % 0.46/0.52 inference(scs_inference,[],[3,8])). % 0.46/0.52 cnf(12,plain, % 0.46/0.52 (~P1(a1,a1,a2)+~P1(a2,a2,x121)), % 0.46/0.52 inference(scs_inference,[],[6,9])). % 0.46/0.52 cnf(14,plain, % 0.46/0.52 (~P1(a1,a1,a2)+P1(x141,x142,f3(x141,x142))), % 0.46/0.52 inference(scs_inference,[],[5,9])). % 0.46/0.52 cnf(15,plain, % 0.46/0.52 (~P1(a1,a1,a2)), % 0.46/0.52 inference(scs_inference,[],[14,12])). % 0.46/0.52 cnf(16,plain, % 0.46/0.52 (P1(a1,a2,a2)+P1(x161,x162,f3(x161,x162))), % 0.46/0.52 inference(scs_inference,[],[15,2])). % 0.46/0.52 cnf(17,plain, % 0.46/0.52 (P1(a1,a2,a2)+~P1(a2,a2,x171)), % 0.46/0.52 inference(scs_inference,[],[15,3])). % 0.46/0.52 cnf(18,plain, % 0.46/0.52 (~P1(a1,a2,a2)+P1(a2,x181,x182)), % 0.46/0.52 inference(scs_inference,[],[15,4])). % 0.46/0.52 cnf(19,plain, % 0.46/0.52 (~P1(a1,a2,a2)+~P1(x191,f3(x191,x192),f3(x191,x192))), % 0.46/0.52 inference(scs_inference,[],[15,8])). % 0.46/0.52 cnf(20,plain, % 0.46/0.52 (~P1(x201,f3(x201,x202),f3(x201,x202))+~P1(a2,a2,x203)), % 0.46/0.52 inference(scs_inference,[],[15,11])). % 0.46/0.52 cnf(21,plain, % 0.46/0.52 (P1(a2,x211,x212)+~P1(a2,a2,x213)), % 0.46/0.52 inference(scs_inference,[],[17,18])). % 0.46/0.52 cnf(26,plain, % 0.46/0.52 (~P1(a2,a2,x261)+~P1(a2,a2,x262)), % 0.46/0.52 inference(scs_inference,[],[20,21])). % 0.46/0.52 cnf(27,plain, % 0.46/0.52 (P1(a1,a2,a2)), % 0.46/0.52 inference(scs_inference,[],[26,16])). % 0.46/0.52 cnf(28,plain, % 0.46/0.52 (P1(a2,x281,x282)), % 0.46/0.52 inference(scs_inference,[],[27,18])). % 0.46/0.52 cnf(29,plain, % 0.46/0.52 (~P1(x291,f3(x291,x292),f3(x291,x292))), % 0.46/0.52 inference(scs_inference,[],[27,19])). % 0.46/0.52 cnf(31,plain, % 0.46/0.52 ($false), % 0.46/0.52 inference(scs_inference,[],[28,29]), % 0.46/0.52 ['proof']). % 0.46/0.52 % SZS output end Proof % 0.46/0.52 % Total time :0.020000s %------------------------------------------------------------------------------