%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL446-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 : n013.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.24s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL446-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.35 % Computer : n013.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 : Sat Sep 5 14:11:19 UTC 2026 % 0.08/0.35 % 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.004540s % 0.24/0.51 % Output :CNFRefutation 0.004540s % 0.24/0.51 %------------------------------------------- % 0.24/0.51 %------------------------------------------------------------------------------ % 0.24/0.51 % File : LCL446-2 : TPTP v9.3.1. Released v3.2.0. % 0.24/0.51 % Domain : Logic Calculi (Propositional) % 0.24/0.51 % Problem : Problem about propositional logic % 0.24/0.51 % Version : [Pau06] axioms : Reduced > Especial. % 0.24/0.51 % English : % 0.24/0.51 % 0.24/0.51 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.24/0.51 % Source : [Pau06] % 0.24/0.51 % Names : % 0.24/0.51 % 0.24/0.51 % Status : Unsatisfiable % 0.24/0.51 % Rating : 0.25 v9.3.0, 0.06 v9.1.0, 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.24/0.51 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 2 RR) % 0.24/0.51 % Number of literals : 6 ( 0 equ; 3 neg) % 0.24/0.51 % Maximal clause size : 3 ( 1 avg) % 0.24/0.51 % Maximal term depth : 4 ( 1 avg) % 0.24/0.51 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.24/0.51 % Number of functors : 6 ( 6 usr; 3 con; 0-3 aty) % 0.24/0.51 % Number of variables : 13 ( 3 sgn) % 0.24/0.51 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.24/0.51 % 0.24/0.51 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.24/0.51 % of which only a small selection are required for the refutation. % 0.24/0.51 % The mission is to find those few axioms, after which a refutation % 0.24/0.51 % can be quite easily found. This version has only the necessary % 0.24/0.51 % axioms. % 0.24/0.51 %------------------------------------------------------------------------------ % 0.24/0.51 cnf(cls_conjecture_0,negated_conjecture, % 0.24/0.51 ~ 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.51 % 0.24/0.51 cnf(cls_PropLog_Othms_OK_0,axiom, % 0.24/0.51 c_in(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_p,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ). % 0.24/0.51 % 0.24/0.51 cnf(cls_PropLog_Othms_OMP_0,axiom, % 0.24/0.51 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.24/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.24/0.51 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.24/0.51 % 0.24/0.51 cnf(cls_PropLog_Othms_OS_0,axiom, % 0.24/0.51 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.24/0.51 % 0.24/0.51 %------------------------------------------------------------------------------ % 0.24/0.51 %------------------------------------------- % 0.24/0.51 % Proof found % 0.24/0.51 % SZS status Theorem for theBenchmark % 0.24/0.51 % SZS output start Proof % 0.24/0.51 %ClaNum:4(EqnAxiom:0) % 0.24/0.51 %VarNum:38(SingletonVarNum:13) % 0.24/0.51 %MaxLitNum:3 % 0.24/0.51 %MaxfuncDepth:3 % 0.24/0.51 %SharedTerms:7 % 0.24/0.51 %goalClause: 3 % 0.24/0.51 %singleGoalClaCount:1 % 0.24/0.51 [3]~P1(f1(a5,a5,a4),f2(a6,a4),f3(a4)) % 0.24/0.51 [1]P1(f1(x11,f1(x12,x11,x13),x13),f2(x14,x13),f3(x13)) % 0.24/0.52 [2]P1(f1(f1(x21,f1(x22,x23,x24),x24),f1(f1(x21,x22,x24),f1(x21,x23,x24),x24),x24),f2(x25,x24),f3(x24)) % 0.24/0.52 [4]~P1(f1(x44,x41,x43),f2(x42,x43),f3(x43))+P1(x41,f2(x42,x43),f3(x43))+~P1(x44,f2(x42,x43),f3(x43)) % 0.24/0.52 %EqnAxiom % 0.24/0.52 % 0.24/0.52 %------------------------------------------- % 0.24/0.52 cnf(8,plain, % 0.24/0.52 (P1(f1(f1(x81,x82,x83),f1(x81,x81,x83),x83),f2(x84,x83),f3(x83))), % 0.24/0.52 inference(scs_inference,[],[2,1,4])). % 0.24/0.52 cnf(11,plain, % 0.24/0.52 ($false), % 0.24/0.52 inference(scs_inference,[],[3,8,1,4]), % 0.24/0.52 ['proof']). % 0.24/0.52 % SZS output end Proof % 0.24/0.52 % Total time :0.004540s %------------------------------------------------------------------------------