%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL436-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 : n027.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.55s 0.66s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.05 % Problem : LCL436-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.05 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.15/0.41 % Computer : n027.cluster.edu % 0.15/0.41 % Model : x86_64 x86_64 % 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.41 % Memory : 8046.5625MB % 0.15/0.41 % OS : Linux 6.8.0-71-generic % 0.15/0.41 % CPULimit : 300 % 0.15/0.41 % WCLimit : 300 % 0.15/0.41 % DateTime : Fri Sep 4 15:08:27 UTC 2026 % 0.15/0.41 % CPUTime : % 0.55/0.65 start to proof:theBenchmark % 0.55/0.65 %------------------------------------------- % 0.55/0.65 % File :CSE---1.7 % 0.55/0.65 % Problem :theBenchmark % 0.55/0.65 % Transform :cnf % 0.55/0.65 % Format :tptp:raw % 0.55/0.65 % Command :java -jar mcs_scs.jar %d %s % 0.55/0.65 % 0.55/0.65 % Result :Theorem 0.005355s % 0.55/0.65 % Output :CNFRefutation 0.005355s % 0.55/0.65 %------------------------------------------- % 0.55/0.65 %------------------------------------------------------------------------------ % 0.55/0.65 % File : LCL436-2 : TPTP v9.3.1. Released v3.2.0. % 0.55/0.65 % Domain : Logic Calculi (Propositional) % 0.55/0.65 % Problem : Problem about propositional logic % 0.55/0.65 % Version : [Pau06] axioms : Reduced > Especial. % 0.55/0.65 % English : % 0.55/0.65 % 0.55/0.65 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.55/0.65 % Source : [Pau06] % 0.55/0.65 % Names : % 0.55/0.65 % 0.55/0.65 % Status : Unsatisfiable % 0.55/0.65 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.55/0.65 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR) % 0.55/0.65 % Number of literals : 4 ( 0 equ; 2 neg) % 0.55/0.65 % Maximal clause size : 2 ( 1 avg) % 0.55/0.65 % Maximal term depth : 5 ( 2 avg) % 0.55/0.65 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.55/0.65 % Number of functors : 9 ( 9 usr; 6 con; 0-3 aty) % 0.55/0.66 % Number of variables : 9 ( 2 sgn) % 0.55/0.66 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.55/0.66 % 0.55/0.66 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.55/0.66 % of which only a small selection are required for the refutation. % 0.55/0.66 % The mission is to find those few axioms, after which a refutation % 0.55/0.66 % can be quite easily found. This version has only the necessary % 0.55/0.66 % axioms. % 0.55/0.66 %------------------------------------------------------------------------------ % 0.55/0.66 cnf(cls_conjecture_0,negated_conjecture, % 0.55/0.66 ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_r,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(v_pa,v_r,t_a),t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.55/0.66 % 0.55/0.66 cnf(cls_PropLog_Othms_OS_0,axiom, % 0.55/0.66 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_r,T_a),T_a),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(V_p,V_r,T_a),T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ). % 0.55/0.66 % 0.55/0.66 cnf(cls_PropLog_Oweaken__right_0,axiom, % 0.55/0.66 ( ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.55/0.66 | 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.55/0.66 % 0.55/0.66 %------------------------------------------------------------------------------ % 0.55/0.66 %------------------------------------------- % 0.55/0.66 % Proof found % 0.55/0.66 % SZS status Theorem for theBenchmark % 0.55/0.66 % SZS output start Proof % 0.55/0.66 %ClaNum:3(EqnAxiom:0) % 0.55/0.66 %VarNum:26(SingletonVarNum:9) % 0.55/0.66 %MaxLitNum:2 % 0.55/0.66 %MaxfuncDepth:4 % 0.55/0.66 %SharedTerms:16 % 0.55/0.66 %goalClause: 2 % 0.55/0.66 %singleGoalClaCount:1 % 0.55/0.66 [2]~P1(f1(a5,f1(f1(a7,f1(a8,a9,a4),a4),f1(f1(a7,a8,a4),f1(a7,a9,a4),a4),a4),a4),f2(a6,a4),f3(a4)) % 0.55/0.66 [1]P1(f1(f1(x11,f1(x12,x13,x14),x14),f1(f1(x11,x12,x14),f1(x11,x13,x14),x14),x14),f2(x15,x14),f3(x14)) % 0.55/0.66 [3]P1(f1(x31,x32,x33),f2(x34,x33),f3(x33))+~P1(x32,f2(x34,x33),f3(x33)) % 0.55/0.66 %EqnAxiom % 0.55/0.66 % 0.55/0.66 %------------------------------------------- % 0.55/0.66 cnf(4,plain, % 0.55/0.66 ($false), % 0.55/0.66 inference(scs_inference,[],[2,1,3]), % 0.55/0.66 ['proof']). % 0.55/0.66 % SZS output end Proof % 0.55/0.66 % Total time :0.005355s %------------------------------------------------------------------------------