%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL432-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 : n016.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.24s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL432-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.35 % Computer : n016.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 15:53:28 UTC 2026 % 0.09/0.36 % CPUTime : % 0.24/0.52 start to proof:theBenchmark % 0.24/0.52 %------------------------------------------- % 0.24/0.52 % File :CSE---1.7 % 0.24/0.52 % Problem :theBenchmark % 0.24/0.52 % Transform :cnf % 0.24/0.52 % Format :tptp:raw % 0.24/0.52 % Command :java -jar mcs_scs.jar %d %s % 0.24/0.52 % 0.24/0.52 % Result :Theorem 0.003966s % 0.24/0.52 % Output :CNFRefutation 0.003966s % 0.24/0.52 %------------------------------------------- % 0.24/0.52 %------------------------------------------------------------------------------ % 0.24/0.52 % File : LCL432-2 : TPTP v9.3.1. Released v3.2.0. % 0.24/0.52 % Domain : Logic Calculi (Propositional) % 0.24/0.52 % Problem : Problem about propositional logic % 0.24/0.52 % Version : [Pau06] axioms : Reduced > Especial. % 0.24/0.52 % English : % 0.24/0.52 % 0.24/0.52 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.24/0.52 % Source : [Pau06] % 0.24/0.52 % Names : % 0.24/0.52 % 0.24/0.52 % Status : Unsatisfiable % 0.24/0.52 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.24/0.52 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 3 RR) % 0.24/0.52 % Number of literals : 4 ( 0 equ; 2 neg) % 0.24/0.52 % Maximal clause size : 2 ( 1 avg) % 0.24/0.52 % Maximal term depth : 2 ( 1 avg) % 0.24/0.52 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.24/0.52 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty) % 0.24/0.52 % Number of variables : 2 ( 0 sgn) % 0.24/0.52 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.24/0.52 % 0.24/0.52 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.24/0.52 % of which only a small selection are required for the refutation. % 0.24/0.52 % The mission is to find those few axioms, after which a refutation % 0.24/0.52 % can be quite easily found. This version has only the necessary % 0.24/0.52 % axioms. % 0.24/0.52 %------------------------------------------------------------------------------ % 0.24/0.52 cnf(cls_conjecture_0,negated_conjecture, % 0.24/0.52 c_PropLog_Osat(c_emptyset,v_x,t_a) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_conjecture_1,negated_conjecture, % 0.24/0.52 ~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)) ). % 0.24/0.52 % 0.24/0.52 cnf(cls_PropLog_Ocompleteness__0_0,axiom, % 0.24/0.52 ( ~ c_PropLog_Osat(c_emptyset,V_p,T_a) % 0.24/0.52 | c_in(V_p,c_PropLog_Othms(c_emptyset,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.24/0.52 % 0.24/0.52 %------------------------------------------------------------------------------ % 0.24/0.52 %------------------------------------------- % 0.24/0.52 % Proof found % 0.24/0.52 % SZS status Theorem for theBenchmark % 0.24/0.52 % SZS output start Proof % 0.24/0.52 %ClaNum:3(EqnAxiom:0) % 0.24/0.52 %VarNum:5(SingletonVarNum:2) % 0.24/0.52 %MaxLitNum:2 % 0.24/0.52 %MaxfuncDepth:1 % 0.24/0.52 %SharedTerms:7 % 0.24/0.52 %goalClause: 1 2 % 0.24/0.52 %singleGoalClaCount:2 % 0.24/0.52 [1]P1(a1,a3,a4) % 0.24/0.52 [2]~P2(a3,f2(a1,a4),f5(a4)) % 0.24/0.52 [3]~P1(a1,x31,x32)+P2(x31,f2(a1,x32),f5(x32)) % 0.24/0.52 %EqnAxiom % 0.24/0.52 % 0.24/0.52 %------------------------------------------- % 0.24/0.52 cnf(4,plain, % 0.24/0.52 ($false), % 0.24/0.52 inference(scs_inference,[],[1,2,3]), % 0.24/0.52 ['proof']). % 0.24/0.52 % SZS output end Proof % 0.24/0.52 % Total time :0.003966s %------------------------------------------------------------------------------