%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL023-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n004.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:44:49 EDT 2024 % Result : Unsatisfiable 58.50s 58.64s % Output : CNFRefutation 58.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.10 % Problem : COL023-1 : TPTP v8.2.0. Released v1.0.0. % 0.05/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.09/0.29 % Computer : n004.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 300 % 0.09/0.29 % DateTime : Tue Jun 18 16:28:23 EDT 2024 % 0.09/0.30 % CPUTime : % 0.14/0.53 start to proof:theBenchmark % 58.47/58.62 %------------------------------------------- % 58.47/58.62 % File :CSE---1.7 % 58.47/58.62 % Problem :theBenchmark % 58.47/58.62 % Transform :cnf % 58.47/58.62 % Format :tptp:raw % 58.47/58.62 % Command :java -jar mcs_scs.jar %d %s % 58.47/58.62 % 58.47/58.62 % Result :Theorem 57.990000s % 58.47/58.62 % Output :CNFRefutation 57.990000s % 58.47/58.62 %------------------------------------------- % 58.50/58.64 %-------------------------------------------------------------------------- % 58.50/58.64 % File : COL023-1 : TPTP v8.2.0. Released v1.0.0. % 58.50/58.64 % Domain : Combinatory Logic % 58.50/58.64 % Problem : Weak fixed point for B and N % 58.50/58.64 % Version : [WM88] (equality) axioms. % 58.50/58.64 % English : The weak fixed point property holds for the set P consisting % 58.50/58.64 % of the combinators B and N, where ((Bx)y)z = x(yz), ((Nx)y)z % 58.50/58.64 % = ((xz)y)z. % 58.50/58.64 % 58.50/58.64 % Refs : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi % 58.50/58.64 % : [MW87] McCune & Wos (1987), A Case Study in Automated Theorem % 58.50/58.64 % : [WM88] Wos & McCune (1988), Challenge Problems Focusing on Eq % 58.50/58.64 % : [MW88] McCune & Wos (1988), Some Fixed Point Problems in Comb % 58.50/58.64 % Source : [MW88] % 58.50/58.64 % Names : - [MW88] % 58.50/58.64 % 58.50/58.64 % Status : Unsatisfiable % 58.50/58.64 % Rating : 0.23 v8.2.0, 0.25 v7.5.0, 0.29 v7.4.0, 0.35 v7.3.0, 0.32 v7.1.0, 0.22 v7.0.0, 0.21 v6.4.0, 0.26 v6.3.0, 0.24 v6.2.0, 0.21 v6.1.0, 0.06 v6.0.0, 0.14 v5.5.0, 0.11 v5.4.0, 0.07 v5.3.0, 0.08 v5.2.0, 0.07 v5.1.0, 0.13 v5.0.0, 0.14 v4.1.0, 0.09 v4.0.1, 0.14 v4.0.0, 0.15 v3.7.0, 0.11 v3.4.0, 0.12 v3.3.0, 0.00 v2.0.0 % 58.50/58.64 % Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 1 RR) % 58.50/58.64 % Number of literals : 3 ( 3 equ; 1 neg) % 58.50/58.64 % Maximal clause size : 1 ( 1 avg) % 58.50/58.64 % Maximal term depth : 4 ( 2 avg) % 58.50/58.64 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty) % 58.50/58.64 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 58.50/58.64 % Number of variables : 7 ( 0 sgn) % 58.50/58.64 % SPC : CNF_UNS_RFO_PEQ_UEQ % 58.50/58.64 % 58.50/58.64 % Comments : % 58.50/58.64 %-------------------------------------------------------------------------- % 58.50/58.64 cnf(b_definition,axiom, % 58.50/58.64 apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ). % 58.50/58.64 % 58.50/58.64 cnf(n_definition,axiom, % 58.50/58.64 apply(apply(apply(n,X),Y),Z) = apply(apply(apply(X,Z),Y),Z) ). % 58.50/58.64 % 58.50/58.64 cnf(prove_fixed_point,negated_conjecture, % 58.50/58.64 Y != apply(combinator,Y) ). % 58.50/58.64 % 58.50/58.64 %-------------------------------------------------------------------------- % 58.50/58.64 %------------------------------------------- % 58.50/58.64 % Proof found % 58.50/58.64 % SZS status Theorem for theBenchmark % 58.50/58.64 % SZS output start Proof % 58.50/58.65 %ClaNum:8(EqnAxiom:5) % 58.50/58.65 %VarNum:15(SingletonVarNum:7) % 58.50/58.65 %MaxLitNum:1 % 58.50/58.65 %MaxfuncDepth:3 % 58.50/58.65 %SharedTerms:3 % 58.50/58.65 %goalClause: 8 % 58.50/58.65 %singleGoalClaCount:1 % 58.50/58.65 [8]~E(f2(a4,x81),x81) % 58.50/58.65 [6]E(f2(f2(f2(a1,x61),x62),x63),f2(x61,f2(x62,x63))) % 58.50/58.65 [7]E(f2(f2(f2(a3,x71),x72),x73),f2(f2(f2(x71,x73),x72),x73)) % 58.50/58.65 %EqnAxiom % 58.50/58.65 [1]E(x11,x11) % 58.50/58.65 [2]E(x22,x21)+~E(x21,x22) % 58.50/58.65 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 58.50/58.65 [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43)) % 58.50/58.65 [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52)) % 58.50/58.65 % 58.50/58.65 %------------------------------------------- % 58.50/58.66 cnf(9,plain, % 58.50/58.66 (E(f2(f2(f2(x91,x92),x93),x92),f2(f2(f2(a3,x91),x93),x92))), % 58.50/58.66 inference(scs_inference,[],[7,2])). % 58.50/58.66 cnf(12,plain, % 58.50/58.66 (E(f2(x121,f2(x122,x123)),f2(f2(f2(a1,x121),x122),x123))), % 58.50/58.66 inference(scs_inference,[],[6,2])). % 58.50/58.66 cnf(64,plain, % 58.50/58.66 (~E(f2(a4,f2(f2(f2(a3,x641),x642),x643)),f2(f2(f2(x641,x643),x642),x643))), % 58.50/58.66 inference(scs_inference,[],[9,8,3])). % 58.50/58.66 cnf(75,plain, % 58.50/58.66 (~E(f2(f2(a3,a1),x751),x751)), % 58.50/58.66 inference(scs_inference,[],[64,12,3,5,4])). % 58.50/58.66 cnf(97,plain, % 58.50/58.67 (~E(f2(f2(f2(a1,f2(a3,a1)),x971),x972),f2(x971,x972))), % 58.50/58.67 inference(scs_inference,[],[75,12,3,5])). % 58.50/58.67 cnf(141,plain, % 58.50/58.67 ($false), % 58.50/58.67 inference(scs_inference,[],[97,9,12,3,4]), % 58.50/58.67 ['proof']). % 58.50/58.67 % SZS output end Proof % 58.50/58.67 % Total time :57.990000s %------------------------------------------------------------------------------