%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL445-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 : n008.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:12 AM UTC 2026 % Result : Unsatisfiable 0.25s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL445-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.09/0.34 % Computer : n008.cluster.edu % 0.09/0.34 % Model : x86_64 x86_64 % 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.34 % Memory : 8046.5625MB % 0.09/0.34 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 21:51:53 UTC 2026 % 0.09/0.35 % CPUTime : % 0.25/0.51 start to proof:theBenchmark % 0.25/0.51 %------------------------------------------- % 0.25/0.51 % File :CSE---1.7 % 0.25/0.51 % Problem :theBenchmark % 0.25/0.51 % Transform :cnf % 0.25/0.51 % Format :tptp:raw % 0.25/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.25/0.51 % 0.25/0.51 % Result :Theorem 0.006160s % 0.25/0.52 % Output :CNFRefutation 0.006160s % 0.25/0.52 %------------------------------------------- % 0.25/0.52 %------------------------------------------------------------------------------ % 0.25/0.52 % File : LCL445-2 : TPTP v9.3.1. Released v3.2.0. % 0.25/0.52 % Domain : Logic Calculi (Propositional) % 0.25/0.52 % Problem : Problem about propositional logic % 0.25/0.52 % Version : [Pau06] axioms : Reduced > Especial. % 0.25/0.52 % English : % 0.25/0.52 % 0.25/0.52 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.25/0.52 % Source : [Pau06] % 0.25/0.52 % Names : % 0.25/0.52 % 0.25/0.52 % Status : Unsatisfiable % 0.25/0.52 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.25/0.52 % Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 5 RR) % 0.25/0.52 % Number of literals : 9 ( 0 equ; 4 neg) % 0.25/0.52 % Maximal clause size : 3 ( 1 avg) % 0.25/0.52 % Maximal term depth : 5 ( 2 avg) % 0.25/0.52 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.25/0.52 % Number of functors : 9 ( 9 usr; 5 con; 0-3 aty) % 0.25/0.52 % Number of variables : 12 ( 1 sgn) % 0.25/0.52 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.25/0.52 % 0.25/0.52 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.25/0.52 % of which only a small selection are required for the refutation. % 0.25/0.52 % The mission is to find those few axioms, after which a refutation % 0.25/0.52 % can be quite easily found. This version has only the necessary % 0.25/0.52 % axioms. % 0.25/0.52 %------------------------------------------------------------------------------ % 0.25/0.52 cnf(cls_conjecture_0,negated_conjecture, % 0.25/0.52 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.25/0.52 % 0.25/0.52 cnf(cls_conjecture_1,negated_conjecture, % 0.25/0.52 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.25/0.52 % 0.25/0.52 cnf(cls_conjecture_2,negated_conjecture, % 0.25/0.52 ~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.25/0.52 % 0.25/0.52 cnf(cls_PropLog_Odeduction_0,axiom, % 0.25/0.52 ( ~ 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.25/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.25/0.52 % 0.25/0.52 cnf(cls_PropLog_Othms_OMP_0,axiom, % 0.25/0.52 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.25/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.25/0.52 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.25/0.52 % 0.25/0.52 cnf(cls_PropLog_Othms__excluded__middle_0,axiom, % 0.25/0.52 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),V_q,T_a),V_q,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ). % 0.25/0.52 % 0.25/0.52 %------------------------------------------------------------------------------ % 0.25/0.52 %------------------------------------------- % 0.25/0.52 % Proof found % 0.25/0.52 % SZS status Theorem for theBenchmark % 0.25/0.52 % SZS output start Proof % 0.25/0.52 %ClaNum:6(EqnAxiom:0) % 0.25/0.52 %VarNum:39(SingletonVarNum:12) % 0.25/0.52 %MaxLitNum:3 % 0.25/0.52 %MaxfuncDepth:4 % 0.25/0.52 %SharedTerms:15 % 0.25/0.52 %goalClause: 1 2 4 % 0.25/0.52 %singleGoalClaCount:3 % 0.25/0.52 [4]~P1(a1,f6(a3,a4),f9(a4)) % 0.25/0.52 [1]P1(a1,f6(f5(a2,a3,f9(a4)),a4),f9(a4)) % 0.25/0.52 [2]P1(a1,f6(f5(f8(a2,a7,a4),a3,f9(a4)),a4),f9(a4)) % 0.25/0.52 [3]P1(f8(f8(x31,x32,x33),f8(f8(f8(x31,a7,x33),x32,x33),x32,x33),x33),f6(x34,x33),f9(x33)) % 0.25/0.52 [6]P1(f8(x61,x62,x63),f6(x64,x63),f9(x63))+~P1(x62,f6(f5(x61,x64,f9(x63)),x63),f9(x63)) % 0.25/0.52 [5]~P1(f8(x54,x51,x53),f6(x52,x53),f9(x53))+P1(x51,f6(x52,x53),f9(x53))+~P1(x54,f6(x52,x53),f9(x53)) % 0.25/0.52 %EqnAxiom % 0.25/0.52 % 0.25/0.52 %------------------------------------------- % 0.25/0.52 cnf(9,plain, % 0.25/0.52 (P1(f8(f8(f8(a2,a7,a4),a1,a4),a1,a4),f6(a3,a4),f9(a4))), % 0.25/0.52 inference(scs_inference,[],[1,3,6,5])). % 0.25/0.52 cnf(12,plain, % 0.25/0.52 (P1(f8(f8(a2,a7,a4),a1,a4),f6(a3,a4),f9(a4))), % 0.25/0.52 inference(scs_inference,[],[2,6])). % 0.25/0.52 cnf(18,plain, % 0.25/0.52 ($false), % 0.25/0.52 inference(scs_inference,[],[12,4,9,5]), % 0.25/0.52 ['proof']). % 0.25/0.52 % SZS output end Proof % 0.25/0.52 % Total time :0.006160s %------------------------------------------------------------------------------