%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL437-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 : n028.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.26s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL437-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 : n028.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 16:02:58 UTC 2026 % 0.08/0.35 % CPUTime : % 0.26/0.51 start to proof:theBenchmark % 0.26/0.51 %------------------------------------------- % 0.26/0.51 % File :CSE---1.7 % 0.26/0.51 % Problem :theBenchmark % 0.26/0.51 % Transform :cnf % 0.26/0.51 % Format :tptp:raw % 0.26/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.26/0.51 % 0.26/0.51 % Result :Theorem 0.003579s % 0.26/0.51 % Output :CNFRefutation 0.003579s % 0.26/0.51 %------------------------------------------- % 0.26/0.51 %------------------------------------------------------------------------------ % 0.26/0.51 % File : LCL437-2 : TPTP v9.3.1. Released v3.2.0. % 0.26/0.51 % Domain : Logic Calculi (Propositional) % 0.26/0.51 % Problem : Problem about propositional logic % 0.26/0.51 % Version : [Pau06] axioms : Reduced > Especial. % 0.26/0.51 % English : % 0.26/0.51 % 0.26/0.51 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.26/0.51 % Source : [Pau06] % 0.26/0.51 % Names : % 0.26/0.51 % 0.26/0.51 % Status : Unsatisfiable % 0.26/0.51 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.26/0.51 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR) % 0.26/0.51 % Number of literals : 4 ( 0 equ; 2 neg) % 0.26/0.51 % Maximal clause size : 2 ( 1 avg) % 0.26/0.51 % Maximal term depth : 5 ( 2 avg) % 0.26/0.51 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.26/0.51 % Number of functors : 8 ( 8 usr; 5 con; 0-3 aty) % 0.26/0.51 % Number of variables : 7 ( 2 sgn) % 0.26/0.51 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.26/0.51 % 0.26/0.51 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.26/0.51 % of which only a small selection are required for the refutation. % 0.26/0.51 % The mission is to find those few axioms, after which a refutation % 0.26/0.51 % can be quite easily found. This version has only the necessary % 0.26/0.51 % axioms. % 0.26/0.51 %------------------------------------------------------------------------------ % 0.26/0.51 cnf(cls_conjecture_0,negated_conjecture, % 0.26/0.51 ~ 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(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Opl_Ofalse,t_a),v_pa,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.26/0.51 % 0.26/0.51 cnf(cls_PropLog_Othms_ODN_0,axiom, % 0.26/0.51 c_in(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),c_PropLog_Opl_Ofalse,T_a),V_p,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ). % 0.26/0.51 % 0.26/0.51 cnf(cls_PropLog_Oweaken__right_0,axiom, % 0.26/0.51 ( ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.26/0.51 | 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.26/0.51 % 0.26/0.51 %------------------------------------------------------------------------------ % 0.26/0.51 %------------------------------------------- % 0.26/0.51 % Proof found % 0.26/0.51 % SZS status Theorem for theBenchmark % 0.26/0.51 % SZS output start Proof % 0.26/0.51 %ClaNum:3(EqnAxiom:0) % 0.26/0.51 %VarNum:18(SingletonVarNum:7) % 0.26/0.51 %MaxLitNum:2 % 0.26/0.51 %MaxfuncDepth:4 % 0.26/0.51 %SharedTerms:12 % 0.26/0.51 %goalClause: 2 % 0.26/0.51 %singleGoalClaCount:1 % 0.26/0.51 [2]~P1(f2(a6,f2(f2(f2(a8,a1,a5),a1,a5),a8,a5),a5),f3(a7,a5),f4(a5)) % 0.26/0.51 [1]P1(f2(f2(f2(x11,a1,x12),a1,x12),x11,x12),f3(x13,x12),f4(x12)) % 0.26/0.51 [3]P1(f2(x31,x32,x33),f3(x34,x33),f4(x33))+~P1(x32,f3(x34,x33),f4(x33)) % 0.26/0.51 %EqnAxiom % 0.26/0.51 % 0.26/0.51 %------------------------------------------- % 0.26/0.51 cnf(4,plain, % 0.26/0.51 ($false), % 0.26/0.51 inference(scs_inference,[],[2,1,3]), % 0.26/0.51 ['proof']). % 0.26/0.51 % SZS output end Proof % 0.26/0.51 % Total time :0.003579s %------------------------------------------------------------------------------