%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL438-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:11 AM UTC 2026 % Result : Unsatisfiable 0.23s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL438-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.34 % Computer : n028.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sat Sep 5 00:32:29 UTC 2026 % 0.08/0.35 % CPUTime : % 0.23/0.51 start to proof:theBenchmark % 0.23/0.51 %------------------------------------------- % 0.23/0.51 % File :CSE---1.7 % 0.23/0.51 % Problem :theBenchmark % 0.23/0.51 % Transform :cnf % 0.23/0.51 % Format :tptp:raw % 0.23/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.23/0.51 % 0.23/0.51 % Result :Theorem 0.004098s % 0.23/0.51 % Output :CNFRefutation 0.004098s % 0.23/0.51 %------------------------------------------- % 0.23/0.51 %------------------------------------------------------------------------------ % 0.23/0.51 % File : LCL438-2 : TPTP v9.3.1. Released v3.2.0. % 0.23/0.51 % Domain : Logic Calculi (Propositional) % 0.23/0.51 % Problem : Problem about propositional logic % 0.23/0.51 % Version : [Pau06] axioms : Reduced > Especial. % 0.23/0.51 % English : % 0.23/0.51 % 0.23/0.51 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.23/0.51 % Source : [Pau06] % 0.23/0.51 % Names : % 0.23/0.51 % 0.23/0.51 % Status : Unsatisfiable % 0.23/0.51 % Rating : 0.00 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.23/0.51 % Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 4 RR) % 0.23/0.51 % Number of literals : 7 ( 0 equ; 3 neg) % 0.23/0.51 % Maximal clause size : 3 ( 1 avg) % 0.23/0.51 % Maximal term depth : 4 ( 1 avg) % 0.23/0.51 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.23/0.51 % Number of functors : 8 ( 8 usr; 5 con; 0-3 aty) % 0.23/0.51 % Number of variables : 9 ( 1 sgn) % 0.23/0.51 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.23/0.51 % 0.23/0.51 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.23/0.51 % of which only a small selection are required for the refutation. % 0.23/0.51 % The mission is to find those few axioms, after which a refutation % 0.23/0.51 % can be quite easily found. This version has only the necessary % 0.23/0.51 % axioms. % 0.23/0.51 %------------------------------------------------------------------------------ % 0.23/0.51 cnf(cls_conjecture_1,negated_conjecture, % 0.23/0.51 c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.23/0.51 % 0.23/0.51 cnf(cls_conjecture_3,negated_conjecture, % 0.23/0.51 c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ). % 0.23/0.51 % 0.23/0.51 cnf(cls_conjecture_4,negated_conjecture, % 0.23/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.23/0.51 % 0.23/0.51 cnf(cls_PropLog_Othms_OMP_0,axiom, % 0.23/0.51 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) % 0.23/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.23/0.51 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.23/0.51 % 0.23/0.51 cnf(cls_PropLog_Othms_OS_0,axiom, % 0.23/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.23/0.51 % 0.23/0.51 %------------------------------------------------------------------------------ % 0.23/0.51 %------------------------------------------- % 0.23/0.51 % Proof found % 0.23/0.51 % SZS status Theorem for theBenchmark % 0.23/0.51 % SZS output start Proof % 0.23/0.51 %ClaNum:5(EqnAxiom:0) % 0.23/0.51 %VarNum:30(SingletonVarNum:9) % 0.23/0.51 %MaxLitNum:3 % 0.23/0.51 %MaxfuncDepth:3 % 0.23/0.51 %SharedTerms:14 % 0.23/0.51 %goalClause: 1 2 4 % 0.23/0.51 %singleGoalClaCount:3 % 0.23/0.51 [1]P1(f3(a1,a7,a2),f4(a5,a2),f6(a2)) % 0.23/0.51 [4]~P1(f3(a1,a8,a2),f4(a5,a2),f6(a2)) % 0.23/0.51 [2]P1(f3(a1,f3(a7,a8,a2),a2),f4(a5,a2),f6(a2)) % 0.23/0.51 [3]P1(f3(f3(x31,f3(x32,x33,x34),x34),f3(f3(x31,x32,x34),f3(x31,x33,x34),x34),x34),f4(x35,x34),f6(x34)) % 0.23/0.51 [5]~P1(f3(x54,x51,x53),f4(x52,x53),f6(x53))+P1(x51,f4(x52,x53),f6(x53))+~P1(x54,f4(x52,x53),f6(x53)) % 0.23/0.51 %EqnAxiom % 0.23/0.51 % 0.23/0.51 %------------------------------------------- % 0.23/0.51 cnf(6,plain, % 0.23/0.51 (P1(f3(f3(a1,a7,a2),f3(a1,a8,a2),a2),f4(a5,a2),f6(a2))), % 0.23/0.51 inference(scs_inference,[],[2,3,5])). % 0.23/0.51 cnf(9,plain, % 0.23/0.51 ($false), % 0.23/0.51 inference(scs_inference,[],[1,4,6,5]), % 0.23/0.51 ['proof']). % 0.23/0.51 % SZS output end Proof % 0.23/0.51 % Total time :0.004098s %------------------------------------------------------------------------------