%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COM009-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n020.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Jun 24 04:52:43 EDT 2024 % Result : Unsatisfiable 0.55s 0.61s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : COM009-2 : TPTP v8.2.0. Released v3.2.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n020.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Thu Jun 20 23:27:39 EDT 2024 % 0.11/0.32 % CPUTime : % 0.19/0.54 start to proof:theBenchmark % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % File :CSE---1.7 % 0.55/0.61 % Problem :theBenchmark % 0.55/0.61 % Transform :cnf % 0.55/0.61 % Format :tptp:raw % 0.55/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.55/0.61 % 0.55/0.61 % Result :Theorem 0.030000s % 0.55/0.61 % Output :CNFRefutation 0.030000s % 0.55/0.61 %------------------------------------------- % 0.55/0.61 %------------------------------------------------------------------------------ % 0.55/0.61 % File : COM009-2 : TPTP v8.2.0. Released v3.2.0. % 0.55/0.61 % Domain : Computing Theory % 0.55/0.61 % Problem : Problem about UNITY theory % 0.55/0.61 % Version : [Pau06] axioms : Reduced > Especial. % 0.55/0.61 % English : % 0.55/0.61 % 0.55/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.55/0.61 % Source : [Pau06] % 0.55/0.61 % Names : % 0.55/0.61 % 0.55/0.61 % Status : Unsatisfiable % 0.55/0.61 % Rating : 0.10 v8.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.05 v5.4.0, 0.10 v5.3.0, 0.06 v5.2.0, 0.00 v5.1.0, 0.06 v5.0.0, 0.07 v4.1.0, 0.08 v4.0.1, 0.09 v3.7.0, 0.00 v3.4.0, 0.08 v3.3.0, 0.14 v3.2.0 % 0.55/0.61 % Syntax : Number of clauses : 4 ( 1 unt; 1 nHn; 3 RR) % 0.55/0.61 % Number of literals : 7 ( 3 equ; 3 neg) % 0.55/0.61 % Maximal clause size : 2 ( 1 avg) % 0.55/0.61 % Maximal term depth : 2 ( 1 avg) % 0.55/0.61 % Number of predicates : 2 ( 1 usr; 0 prp; 2-2 aty) % 0.55/0.61 % Number of functors : 3 ( 3 usr; 2 con; 0-2 aty) % 0.55/0.61 % Number of variables : 4 ( 1 sgn) % 0.55/0.61 % SPC : CNF_UNS_RFO_SEQ_NHN % 0.55/0.61 % 0.55/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.55/0.61 % of which only a small selection are required for the refutation. % 0.55/0.61 % The mission is to find those few axioms, after which a refutation % 0.55/0.61 % can be quite easily found. This version has only the necessary % 0.55/0.61 % axioms. % 0.55/0.61 %------------------------------------------------------------------------------ % 0.55/0.61 cnf(cls_conjecture_0,negated_conjecture, % 0.55/0.61 ( c_UNITY_Ototalize(v_F,t_a) != v_F % 0.55/0.61 | ~ c_UNITY_Oall__total(v_F,t_a) ) ). % 0.55/0.61 % 0.55/0.61 cnf(cls_conjecture_1,negated_conjecture, % 0.55/0.61 ( c_UNITY_Oall__total(v_F,t_a) % 0.55/0.61 | c_UNITY_Ototalize(v_F,t_a) = v_F ) ). % 0.55/0.61 % 0.55/0.61 cnf(cls_UNITY_Oall__total__imp__totalize_0,axiom, % 0.55/0.61 ( ~ c_UNITY_Oall__total(V_F,T_a) % 0.55/0.61 | c_UNITY_Ototalize(V_F,T_a) = V_F ) ). % 0.55/0.61 % 0.55/0.61 cnf(cls_UNITY_Oall__total__totalize_0,axiom, % 0.55/0.61 c_UNITY_Oall__total(c_UNITY_Ototalize(V_F,T_a),T_a) ). % 0.55/0.61 % 0.55/0.61 %------------------------------------------------------------------------------ % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % Proof found % 0.55/0.61 % SZS status Theorem for theBenchmark % 0.55/0.61 % SZS output start Proof % 0.55/0.62 %ClaNum:11(EqnAxiom:7) % 0.55/0.62 %VarNum:8(SingletonVarNum:4) % 0.55/0.62 %MaxLitNum:2 % 0.55/0.62 %MaxfuncDepth:1 % 0.55/0.62 %SharedTerms:7 % 0.55/0.62 %goalClause: 9 10 % 0.55/0.62 [8]P1(f1(x81,x82),x82) % 0.55/0.62 [9]P1(a2,a3)+E(f1(a2,a3),a2) % 0.55/0.62 [10]~P1(a2,a3)+~E(f1(a2,a3),a2) % 0.55/0.62 [11]~P1(x111,x112)+E(f1(x111,x112),x111) % 0.55/0.62 %EqnAxiom % 0.55/0.62 [1]E(x11,x11) % 0.55/0.62 [2]E(x22,x21)+~E(x21,x22) % 0.55/0.62 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.55/0.62 [4]~E(x41,x42)+E(f1(x41,x43),f1(x42,x43)) % 0.55/0.62 [5]~E(x51,x52)+E(f1(x53,x51),f1(x53,x52)) % 0.55/0.62 [6]P1(x62,x63)+~E(x61,x62)+~P1(x61,x63) % 0.55/0.62 [7]P1(x73,x72)+~E(x71,x72)+~P1(x73,x71) % 0.55/0.62 % 0.55/0.62 %------------------------------------------- % 0.55/0.62 cnf(12,plain, % 0.55/0.62 (P1(x121,x122)+~E(f1(x123,x122),x121)), % 0.55/0.62 inference(scs_inference,[],[8,6])). % 0.55/0.62 cnf(31,plain, % 0.55/0.62 (E(f1(a2,a3),a2)), % 0.55/0.62 inference(scs_inference,[],[9,11])). % 0.55/0.62 cnf(32,plain, % 0.55/0.62 (~P1(a2,a3)), % 0.55/0.62 inference(scs_inference,[],[31,10])). % 0.55/0.62 cnf(42,plain, % 0.55/0.62 ($false), % 0.55/0.62 inference(scs_inference,[],[32,31,12]), % 0.55/0.62 ['proof']). % 0.55/0.62 % SZS output end Proof % 0.55/0.62 % Total time :0.030000s %------------------------------------------------------------------------------