%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL070-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 : n017.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 04:45:02 EDT 2024 % Result : Unsatisfiable 58.37s 58.58s % Output : CNFRefutation 58.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : COL070-1 : TPTP v8.2.0. Released v1.2.0. % 0.08/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.34 % Computer : n017.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Jun 18 16:13:24 EDT 2024 % 0.12/0.35 % CPUTime : % 0.20/0.59 start to proof:theBenchmark % 58.37/58.56 %------------------------------------------- % 58.37/58.56 % File :CSE---1.7 % 58.37/58.56 % Problem :theBenchmark % 58.37/58.56 % Transform :cnf % 58.37/58.56 % Format :tptp:raw % 58.37/58.56 % Command :java -jar mcs_scs.jar %d %s % 58.37/58.56 % 58.37/58.56 % Result :Theorem 57.870000s % 58.37/58.56 % Output :CNFRefutation 57.870000s % 58.37/58.56 %------------------------------------------- % 58.37/58.58 %-------------------------------------------------------------------------- % 58.37/58.58 % File : COL070-1 : TPTP v8.2.0. Released v1.2.0. % 58.37/58.58 % Domain : Combinatory Logic % 58.37/58.58 % Problem : Weak fixed point for B and N1 % 58.37/58.58 % Version : [WM88] (equality) axioms. % 58.37/58.58 % English : The weak fixed point property holds for the set P consisting % 58.37/58.58 % of the combinators B and N1, where N1xyz = xyyz, ((Bx)y)z % 58.37/58.58 % = x(yz). % 58.37/58.58 % 58.37/58.58 % Refs : [WM88] Wos & McCune (1988), Challenge Problems Focusing on Eq % 58.37/58.58 % : [Wos93] Wos (1993), The Kernel Strategy and Its Use for the St % 58.37/58.58 % : [Zha94] Zhang (1994), Solution to Another Open Question in Com % 58.37/58.58 % Source : [Wos93] % 58.37/58.58 % Names : Question 12 [Wos93] % 58.37/58.58 % 58.37/58.58 % Status : Unsatisfiable % 58.37/58.58 % Rating : 0.18 v8.2.0, 0.21 v8.1.0, 0.25 v7.4.0, 0.30 v7.3.0, 0.26 v7.1.0, 0.17 v7.0.0, 0.16 v6.4.0, 0.26 v6.3.0, 0.24 v6.2.0, 0.21 v6.1.0, 0.06 v6.0.0, 0.19 v5.5.0, 0.11 v5.4.0, 0.07 v5.3.0, 0.08 v5.2.0, 0.07 v5.1.0, 0.20 v5.0.0, 0.21 v4.1.0, 0.18 v4.0.1, 0.29 v4.0.0, 0.31 v3.7.0, 0.11 v3.4.0, 0.12 v3.3.0, 0.07 v3.1.0, 0.11 v2.7.0, 0.00 v2.0.0 % 58.37/58.58 % Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 1 RR) % 58.37/58.58 % Number of literals : 3 ( 3 equ; 1 neg) % 58.37/58.58 % Maximal clause size : 1 ( 1 avg) % 58.37/58.58 % Maximal term depth : 4 ( 2 avg) % 58.37/58.58 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty) % 58.37/58.58 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 58.37/58.58 % Number of variables : 7 ( 0 sgn) % 58.37/58.58 % SPC : CNF_UNS_RFO_PEQ_UEQ % 58.37/58.58 % 58.37/58.58 % Comments : % 58.37/58.58 %-------------------------------------------------------------------------- % 58.37/58.58 cnf(n1_definition,axiom, % 58.37/58.58 apply(apply(apply(n1,X),Y),Z) = apply(apply(apply(X,Y),Y),Z) ). % 58.37/58.58 % 58.37/58.58 cnf(b_definition,axiom, % 58.37/58.58 apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ). % 58.37/58.58 % 58.37/58.58 cnf(prove_fixed_point,negated_conjecture, % 58.37/58.58 Y != apply(combinator,Y) ). % 58.37/58.58 % 58.37/58.58 %-------------------------------------------------------------------------- % 58.37/58.58 %------------------------------------------- % 58.37/58.58 % Proof found % 58.37/58.58 % SZS status Theorem for theBenchmark % 58.37/58.58 % SZS output start Proof % 58.47/58.59 %ClaNum:8(EqnAxiom:5) % 58.47/58.59 %VarNum:15(SingletonVarNum:7) % 58.47/58.59 %MaxLitNum:1 % 58.47/58.59 %MaxfuncDepth:3 % 58.47/58.59 %SharedTerms:3 % 58.47/58.59 %goalClause: 8 % 58.47/58.59 %singleGoalClaCount:1 % 58.47/58.59 [8]~E(f2(a4,x81),x81) % 58.47/58.59 [6]E(f2(f2(f2(a1,x61),x62),x63),f2(x61,f2(x62,x63))) % 58.47/58.59 [7]E(f2(f2(f2(a3,x71),x72),x73),f2(f2(f2(x71,x72),x72),x73)) % 58.47/58.59 %EqnAxiom % 58.47/58.59 [1]E(x11,x11) % 58.47/58.59 [2]E(x22,x21)+~E(x21,x22) % 58.47/58.59 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 58.47/58.59 [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43)) % 58.47/58.59 [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52)) % 58.47/58.59 % 58.47/58.59 %------------------------------------------- % 58.47/58.59 cnf(9,plain, % 58.47/58.60 (E(f2(f2(f2(x91,x92),x92),x93),f2(f2(f2(a3,x91),x92),x93))), % 58.47/58.60 inference(scs_inference,[],[7,2])). % 58.47/58.60 cnf(12,plain, % 58.47/58.60 (E(f2(x121,f2(x122,x123)),f2(f2(f2(a1,x121),x122),x123))), % 58.47/58.60 inference(scs_inference,[],[6,2])). % 58.47/58.60 cnf(15,plain, % 58.47/58.60 (~E(f2(f2(f2(a1,a4),x151),x152),f2(x151,x152))), % 58.47/58.60 inference(scs_inference,[],[8,6,2,3,5])). % 58.47/58.60 cnf(91,plain, % 58.47/58.60 ($false), % 58.47/58.60 inference(scs_inference,[],[15,9,12,3,4]), % 58.47/58.60 ['proof']). % 58.47/58.60 % SZS output end Proof % 58.47/58.60 % Total time :57.870000s %------------------------------------------------------------------------------