%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL441-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 : n015.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.25s 0.53s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL441-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.02 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.35 % Computer : n015.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 : Sat Sep 5 08:08:27 UTC 2026 % 0.09/0.35 % CPUTime : % 0.25/0.52 start to proof:theBenchmark % 0.25/0.52 %------------------------------------------- % 0.25/0.52 % File :CSE---1.7 % 0.25/0.52 % Problem :theBenchmark % 0.25/0.52 % Transform :cnf % 0.25/0.52 % Format :tptp:raw % 0.25/0.52 % Command :java -jar mcs_scs.jar %d %s % 0.25/0.52 % 0.25/0.52 % Result :Theorem 0.002495s % 0.25/0.52 % Output :CNFRefutation 0.002495s % 0.25/0.52 %------------------------------------------- % 0.25/0.52 %------------------------------------------------------------------------------ % 0.25/0.53 % File : LCL441-2 : TPTP v9.3.1. Released v3.2.0. % 0.25/0.53 % Domain : Logic Calculi (Propositional) % 0.25/0.53 % Problem : Problem about propositional logic % 0.25/0.53 % Version : [Pau06] axioms : Reduced > Especial. % 0.25/0.53 % English : % 0.25/0.53 % 0.25/0.53 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.25/0.53 % Source : [Pau06] % 0.25/0.53 % Names : % 0.25/0.53 % 0.25/0.53 % Status : Unsatisfiable % 0.25/0.53 % Rating : 0.25 v9.3.0, 0.12 v9.1.0, 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.25/0.53 % Syntax : Number of clauses : 3 ( 1 unt; 0 nHn; 2 RR) % 0.25/0.53 % Number of literals : 5 ( 0 equ; 3 neg) % 0.25/0.53 % Maximal clause size : 2 ( 1 avg) % 0.25/0.53 % Maximal term depth : 5 ( 2 avg) % 0.25/0.53 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.25/0.53 % Number of functors : 9 ( 9 usr; 4 con; 0-3 aty) % 0.25/0.53 % Number of variables : 6 ( 1 sgn) % 0.25/0.53 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.25/0.53 % 0.25/0.53 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.25/0.53 % of which only a small selection are required for the refutation. % 0.25/0.53 % The mission is to find those few axioms, after which a refutation % 0.25/0.53 % can be quite easily found. This version has only the necessary % 0.25/0.53 % axioms. % 0.25/0.53 %------------------------------------------------------------------------------ % 0.25/0.53 cnf(cls_conjecture_3,negated_conjecture, % 0.25/0.53 ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) % 0.25/0.53 | ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ) ). % 0.25/0.53 % 0.25/0.53 cnf(cls_PropLog_Othms_OH_0,axiom, % 0.25/0.53 ( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a)) % 0.25/0.53 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ). % 0.25/0.53 % 0.25/0.53 cnf(cls_Set_OinsertCI_1,axiom, % 0.25/0.53 c_in(V_x,c_insert(V_x,V_B,T_a),T_a) ). % 0.25/0.53 % 0.25/0.53 %------------------------------------------------------------------------------ % 0.25/0.53 %------------------------------------------- % 0.25/0.53 % Proof found % 0.25/0.53 % SZS status Theorem for theBenchmark % 0.25/0.53 % SZS output start Proof % 0.25/0.53 %ClaNum:3(EqnAxiom:0) % 0.25/0.53 %VarNum:12(SingletonVarNum:6) % 0.25/0.53 %MaxLitNum:2 % 0.25/0.53 %MaxfuncDepth:3 % 0.25/0.53 %SharedTerms:13 % 0.25/0.53 %goalClause: 3 % 0.25/0.53 [1]P1(x11,f1(x11,x12,x13),x13) % 0.25/0.53 [3]~P1(f5(f3(a9,a8),a4,a8),f2(f1(f5(f3(a9,a8),a4,a8),a6,f7(a8)),a8),f7(a8))+~P1(f3(a9,a8),f2(f1(f3(a9,a8),a6,f7(a8)),a8),f7(a8)) % 0.25/0.53 [2]~P1(x21,x22,f7(x23))+P1(x21,f2(x22,x23),f7(x23)) % 0.25/0.53 %EqnAxiom % 0.25/0.53 % 0.25/0.53 %------------------------------------------- % 0.25/0.53 cnf(4,plain, % 0.25/0.53 (~P1(f3(a9,a8),f2(f1(f3(a9,a8),a6,f7(a8)),a8),f7(a8))), % 0.25/0.53 inference(scs_inference,[],[1,2,3])). % 0.25/0.53 cnf(5,plain, % 0.25/0.53 ($false), % 0.25/0.53 inference(scs_inference,[],[1,4,2]), % 0.25/0.53 ['proof']). % 0.25/0.53 % SZS output end Proof % 0.25/0.53 % Total time :0.002495s %------------------------------------------------------------------------------