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