%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL434-2 : TPTP v9.3.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n003.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:19:10 AM UTC 2026 % Result : Unsatisfiable 0.24s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL434-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.08/0.34 % Computer : n003.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sun Sep 6 01:32:06 UTC 2026 % 0.08/0.34 % CPUTime : % 0.24/0.51 start to proof:theBenchmark % 0.24/0.51 %------------------------------------------- % 0.24/0.51 % File :CSE---1.7 % 0.24/0.51 % Problem :theBenchmark % 0.24/0.51 % Transform :cnf % 0.24/0.51 % Format :tptp:raw % 0.24/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.24/0.51 % 0.24/0.51 % Result :Theorem 0.006585s % 0.24/0.51 % Output :CNFRefutation 0.006585s % 0.24/0.51 %------------------------------------------- % 0.24/0.51 %------------------------------------------------------------------------------ % 0.24/0.51 % File : LCL434-2 : TPTP v9.3.1. Released v3.2.0. % 0.24/0.52 % Domain : Logic Calculi (Propositional) % 0.24/0.52 % Problem : Problem about propositional logic % 0.24/0.52 % Version : [Pau06] axioms : Reduced > Especial. % 0.24/0.52 % English : % 0.24/0.52 % 0.24/0.52 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.24/0.52 % Source : [Pau06] % 0.24/0.52 % Names : % 0.24/0.52 % 0.24/0.52 % Status : Unsatisfiable % 0.24/0.52 % Rating : 0.08 v9.3.0, 0.05 v9.0.0, 0.10 v8.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.10 v5.3.0, 0.11 v5.2.0, 0.06 v5.1.0, 0.12 v5.0.0, 0.07 v4.1.0, 0.15 v4.0.1, 0.18 v4.0.0, 0.09 v3.7.0, 0.00 v3.4.0, 0.08 v3.3.0, 0.21 v3.2.0 % 0.24/0.52 % Syntax : Number of clauses : 6 ( 3 unt; 1 nHn; 4 RR) % 0.24/0.52 % Number of literals : 10 ( 1 equ; 4 neg) % 0.24/0.52 % Maximal clause size : 3 ( 1 avg) % 0.24/0.52 % Maximal term depth : 3 ( 1 avg) % 0.24/0.52 % Number of predicates : 2 ( 1 usr; 0 prp; 2-3 aty) % 0.24/0.52 % Number of functors : 8 ( 8 usr; 4 con; 0-3 aty) % 0.24/0.52 % Number of variables : 14 ( 2 sgn) % 0.24/0.52 % SPC : CNF_UNS_RFO_SEQ_NHN % 0.24/0.52 % 0.24/0.52 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.24/0.52 % of which only a small selection are required for the refutation. % 0.24/0.52 % The mission is to find those few axioms, after which a refutation % 0.24/0.52 % can be quite easily found. This version has only the necessary % 0.24/0.52 % axioms. % 0.24/0.52 %------------------------------------------------------------------------------ % 0.24/0.52 cnf(cls_conjecture_0,negated_conjecture, % 0.24/0.52 c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_conjecture_1,negated_conjecture, % 0.24/0.52 ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_PropLog_Othms_OH_0,axiom, % 0.24/0.52 ( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a)) % 0.24/0.52 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_PropLog_Othms__I_0,axiom, % 0.24/0.52 c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_p,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_PropLog_Oweaken__right_0,axiom, % 0.24/0.52 ( ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.24/0.52 | c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_Set_OinsertE_0,axiom, % 0.24/0.52 ( ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a) % 0.24/0.52 | c_in(V_a,V_A,T_a) % 0.24/0.52 | V_a = V_b ) ). % 0.24/0.52 % 0.24/0.52 %------------------------------------------------------------------------------ % 0.24/0.52 %------------------------------------------- % 0.24/0.52 % Proof found % 0.24/0.52 % SZS status Theorem for theBenchmark % 0.24/0.52 % SZS output start Proof % 0.24/0.52 %ClaNum:21(EqnAxiom:15) % 0.24/0.52 %VarNum:33(SingletonVarNum:14) % 0.24/0.52 %MaxLitNum:3 % 0.24/0.52 %MaxfuncDepth:2 % 0.24/0.52 %SharedTerms:10 % 0.24/0.52 %goalClause: 16 18 % 0.24/0.52 %singleGoalClaCount:2 % 0.24/0.52 [18]~P1(f6(a2,a1,a4),f7(a3,a4),f8(a4)) % 0.24/0.52 [16]P1(a1,f5(a2,a3,f8(a4)),f8(a4)) % 0.24/0.52 [17]P1(f6(x171,x171,x172),f7(x173,x172),f8(x172)) % 0.24/0.52 [19]~P1(x191,x192,f8(x193))+P1(x191,f7(x192,x193),f8(x193)) % 0.24/0.52 [21]P1(f6(x211,x212,x213),f7(x214,x213),f8(x213))+~P1(x212,f7(x214,x213),f8(x213)) % 0.24/0.52 [20]E(x201,x202)+P1(x201,x203,x204)+~P1(x201,f5(x202,x203,x204),x204) % 0.24/0.52 %EqnAxiom % 0.24/0.52 [1]E(x11,x11) % 0.24/0.52 [2]E(x22,x21)+~E(x21,x22) % 0.24/0.52 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.24/0.52 [4]~E(x41,x42)+E(f8(x41),f8(x42)) % 0.24/0.52 [5]~E(x51,x52)+E(f5(x51,x53,x54),f5(x52,x53,x54)) % 0.24/0.52 [6]~E(x61,x62)+E(f5(x63,x61,x64),f5(x63,x62,x64)) % 0.24/0.52 [7]~E(x71,x72)+E(f5(x73,x74,x71),f5(x73,x74,x72)) % 0.24/0.52 [8]~E(x81,x82)+E(f7(x81,x83),f7(x82,x83)) % 0.24/0.52 [9]~E(x91,x92)+E(f7(x93,x91),f7(x93,x92)) % 0.24/0.52 [10]~E(x101,x102)+E(f6(x101,x103,x104),f6(x102,x103,x104)) % 0.24/0.52 [11]~E(x111,x112)+E(f6(x113,x111,x114),f6(x113,x112,x114)) % 0.24/0.52 [12]~E(x121,x122)+E(f6(x123,x124,x121),f6(x123,x124,x122)) % 0.24/0.52 [13]P1(x132,x133,x134)+~E(x131,x132)+~P1(x131,x133,x134) % 0.24/0.52 [14]P1(x143,x142,x144)+~E(x141,x142)+~P1(x143,x141,x144) % 0.24/0.52 [15]P1(x153,x154,x152)+~E(x151,x152)+~P1(x153,x154,x151) % 0.24/0.52 % 0.24/0.52 %------------------------------------------- % 0.24/0.52 cnf(24,plain, % 0.24/0.52 (~P1(a1,f7(a3,a4),f8(a4))), % 0.24/0.52 inference(scs_inference,[],[18,19,21])). % 0.24/0.52 cnf(26,plain, % 0.24/0.52 (~E(f6(x261,x261,a4),f6(a2,a1,a4))), % 0.24/0.52 inference(scs_inference,[],[18,17,19,21,13])). % 0.24/0.52 cnf(30,plain, % 0.24/0.52 (P1(a1,a3,f8(a4))), % 0.24/0.52 inference(scs_inference,[],[16,18,17,19,21,13,14,10,20])). % 0.24/0.52 cnf(36,plain, % 0.24/0.52 ($false), % 0.24/0.52 inference(scs_inference,[],[30,26,24,11,19]), % 0.24/0.52 ['proof']). % 0.24/0.52 % SZS output end Proof % 0.24/0.52 % Total time :0.006585s %------------------------------------------------------------------------------