%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL430-2 : TPTP v9.3.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n002.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:09 AM UTC 2026 % Result : Unsatisfiable 0.23s 0.53s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL430-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.08/0.35 % Computer : n002.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Fri Sep 4 19:43:50 UTC 2026 % 0.12/0.36 % CPUTime : % 0.23/0.52 start to proof:theBenchmark % 0.23/0.52 %------------------------------------------- % 0.23/0.52 % File :CSE---1.7 % 0.23/0.52 % Problem :theBenchmark % 0.23/0.52 % Transform :cnf % 0.23/0.52 % Format :tptp:raw % 0.23/0.52 % Command :java -jar mcs_scs.jar %d %s % 0.23/0.52 % 0.23/0.52 % Result :Theorem 0.011778s % 0.23/0.52 % Output :CNFRefutation 0.011778s % 0.23/0.53 %------------------------------------------- % 0.23/0.53 %------------------------------------------------------------------------------ % 0.23/0.53 % File : LCL430-2 : TPTP v9.3.1. Released v3.2.0. % 0.23/0.53 % Domain : Logic Calculi (Propositional) % 0.23/0.53 % Problem : Problem about propositional logic % 0.23/0.53 % Version : [Pau06] axioms : Reduced > Especial. % 0.23/0.53 % English : % 0.23/0.53 % 0.23/0.53 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.23/0.53 % Source : [Pau06] % 0.23/0.53 % Names : % 0.23/0.53 % 0.23/0.53 % Status : Unsatisfiable % 0.23/0.53 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.00 v3.2.0 % 0.23/0.53 % Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 4 RR) % 0.23/0.53 % Number of literals : 14 ( 0 equ; 7 neg) % 0.23/0.53 % Maximal clause size : 3 ( 1 avg) % 0.23/0.53 % Maximal term depth : 6 ( 2 avg) % 0.23/0.53 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.23/0.53 % Number of functors : 15 ( 15 usr; 7 con; 0-3 aty) % 0.23/0.53 % Number of variables : 27 ( 1 sgn) % 0.23/0.53 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.23/0.53 % 0.23/0.53 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.23/0.53 % of which only a small selection are required for the refutation. % 0.23/0.53 % The mission is to find those few axioms, after which a refutation % 0.23/0.53 % can be quite easily found. This version has only the necessary % 0.23/0.53 % axioms. % 0.23/0.53 %------------------------------------------------------------------------------ % 0.23/0.53 cnf(cls_PropLog_ODiff__weaken__left_0,axiom, % 0.23/0.53 ( ~ c_in(V_p,c_PropLog_Othms(c_minus(V_A,V_B,tc_set(tc_PropLog_Opl(T_a))),T_a),tc_PropLog_Opl(T_a)) % 0.23/0.53 | ~ c_lessequals(V_A,V_C,tc_set(tc_PropLog_Opl(T_a))) % 0.23/0.53 | c_in(V_p,c_PropLog_Othms(c_minus(V_C,V_B,tc_set(tc_PropLog_Opl(T_a))),T_a),tc_PropLog_Opl(T_a)) ) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_PropLog_Ohyps__insert_0,axiom, % 0.23/0.53 c_lessequals(c_PropLog_Ohyps(V_p,c_insert(V_v,V_t,T_a),T_a),c_insert(c_PropLog_Opl_Ovar(V_v,T_a),c_minus(c_PropLog_Ohyps(V_p,V_t,T_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(V_v,T_a),c_PropLog_Opl_Ofalse,T_a),c_emptyset,tc_PropLog_Opl(T_a)),tc_set(tc_PropLog_Opl(T_a))),tc_PropLog_Opl(T_a)),tc_set(tc_PropLog_Opl(T_a))) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_PropLog_Oinsert__Diff__same_0,axiom, % 0.23/0.53 c_lessequals(c_minus(V_B,V_C,tc_set(T_a)),c_insert(V_a,c_minus(V_B,c_insert(V_a,V_C,T_a),tc_set(T_a)),T_a),tc_set(T_a)) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_PropLog_Oinsert__Diff__subset2_0,axiom, % 0.23/0.53 c_lessequals(c_minus(c_insert(V_a,c_minus(V_B,c_insert(V_c,c_emptyset,T_a),tc_set(T_a)),T_a),V_D,tc_set(T_a)),c_insert(V_a,c_minus(V_B,c_insert(V_c,V_D,T_a),tc_set(T_a)),T_a),tc_set(T_a)) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_PropLog_Othms__excluded__middle__rule_0,axiom, % 0.23/0.53 ( ~ c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)) % 0.23/0.53 | ~ c_in(V_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)) % 0.23/0.53 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_PropLog_Oweaken__left_0,axiom, % 0.23/0.53 ( ~ c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a)) % 0.23/0.53 | ~ c_lessequals(V_G,V_H,tc_set(tc_PropLog_Opl(T_a))) % 0.23/0.53 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_conjecture_3,negated_conjecture, % 0.23/0.53 c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,V_U,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ). % 0.23/0.53 % 0.23/0.53 cnf(cls_conjecture_5,negated_conjecture, % 0.23/0.53 ~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ). % 0.23/0.53 % 0.23/0.53 %------------------------------------------------------------------------------ % 0.23/0.53 %------------------------------------------- % 0.23/0.53 % Proof found % 0.23/0.53 % SZS status Theorem for theBenchmark % 0.23/0.53 % SZS output start Proof % 0.23/0.53 %ClaNum:8(EqnAxiom:0) % 0.23/0.53 %VarNum:88(SingletonVarNum:27) % 0.23/0.53 %MaxLitNum:3 % 0.23/0.53 %MaxfuncDepth:4 % 0.23/0.53 %SharedTerms:16 % 0.23/0.53 %goalClause: 1 5 % 0.23/0.53 %singleGoalClaCount:2 % 0.23/0.53 [5]~P1(a1,f5(f4(f3(a1,a14,a2),f9(f8(f6(a15,a2),a7,a2),a11,f12(a2)),f13(f12(a2))),a2),f12(a2)) % 0.23/0.53 [1]P1(a1,f5(f4(f3(a1,x11,a2),a11,f13(f12(a2))),a2),f12(a2)) % 0.23/0.53 [4]P2(f3(x41,f9(x42,x43,x44),x44),f9(f6(x42,x44),f4(f3(x41,x43,x44),f9(f8(f6(x42,x44),a7,x44),a10,f12(x44)),f13(f12(x44))),f12(x44)),f13(f12(x44))) % 0.23/0.53 [2]P2(f4(x21,x22,f13(x23)),f9(x24,f4(x21,f9(x24,x22,x23),f13(x23)),x23),f13(x23)) % 0.23/0.53 [3]P2(f4(f9(x31,f4(x32,f9(x33,a10,x34),f13(x34)),x34),x35,f13(x34)),f9(x31,f4(x32,f9(x33,x35,x34),f13(x34)),x34),f13(x34)) % 0.23/0.53 [6]~P1(x61,f5(x64,x63),f12(x63))+P1(x61,f5(x62,x63),f12(x63))+~P2(x64,x62,f13(f12(x63))) % 0.23/0.53 [8]P1(x81,f5(x82,x83),f12(x83))+~P1(x81,f5(f9(x84,x82,f12(x83)),x83),f12(x83))+~P1(x81,f5(f9(f8(x84,a7,x83),x82,f12(x83)),x83),f12(x83)) % 0.23/0.53 [7]~P2(x75,x72,f13(f12(x74)))+P1(x71,f5(f4(x72,x73,f13(f12(x74))),x74),f12(x74))+~P1(x71,f5(f4(x75,x73,f13(f12(x74))),x74),f12(x74)) % 0.23/0.53 %EqnAxiom % 0.23/0.53 % 0.23/0.53 %------------------------------------------- % 0.23/0.53 cnf(12,plain, % 0.23/0.53 (~P1(a1,f5(f9(f6(a15,a2),f4(f3(a1,a14,a2),f9(f8(f6(a15,a2),a7,a2),a11,f12(a2)),f13(f12(a2))),f12(a2)),a2),f12(a2))), % 0.23/0.53 inference(scs_inference,[],[1,5,2,6,8])). % 0.23/0.53 cnf(23,plain, % 0.23/0.53 ($false), % 0.23/0.53 inference(scs_inference,[],[12,3,1,4,6,7]), % 0.23/0.53 ['proof']). % 0.23/0.53 % SZS output end Proof % 0.23/0.53 % Total time :0.011778s %------------------------------------------------------------------------------