TSTP Solution File: ANA038-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : ANA038-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n003.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 : Wed Aug 30 17:13:26 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA038-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 18:36:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 % File : ANA038-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.63 % Domain : Analysis
% 0.20/0.63 % Problem : Problem about Big-O notation
% 0.20/0.63 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.63 % Source : [Pau06]
% 0.20/0.63 % Names :
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % Rating : 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.06 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.00 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v3.2.0
% 0.20/0.63 % Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 9 RR)
% 0.20/0.63 % Number of literals : 20 ( 0 equ; 11 neg)
% 0.20/0.63 % Maximal clause size : 4 ( 2 avg)
% 0.20/0.63 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.63 % Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty)
% 0.20/0.63 % Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% 0.20/0.63 % Number of variables : 14 ( 1 sgn)
% 0.20/0.63 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.63
% 0.20/0.63 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.63 % of which only a small selection are required for the refutation.
% 0.20/0.63 % The mission is to find those few axioms, after which a refutation
% 0.20/0.63 % can be quite easily found. This version has only the necessary
% 0.20/0.63 % axioms.
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.63 c_lessequals(c_0,v_g(v_xa),t_b) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_conjecture_5,negated_conjecture,
% 0.20/0.63 c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_conjecture_8,negated_conjecture,
% 0.20/0.63 ~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b) ).
% 0.20/0.63
% 0.20/0.63 cnf(tfree_tcs,negated_conjecture,
% 0.20/0.63 class_Ring__and__Field_Oordered__idom(t_b) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Orderings_Ole__maxI2_0,axiom,
% 0.20/0.63 ( ~ class_Orderings_Olinorder(T_b)
% 0.20/0.63 | c_lessequals(V_y,c_Orderings_Omax(V_x,V_y,T_b),T_b) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
% 0.20/0.63 ( ~ class_Orderings_Oorder(T_a)
% 0.20/0.63 | ~ c_lessequals(V_y,V_z,T_a)
% 0.20/0.63 | ~ c_lessequals(V_x,V_y,T_a)
% 0.20/0.63 | c_lessequals(V_x,V_z,T_a) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
% 0.20/0.63 ( ~ class_Ring__and__Field_Opordered__semiring(T_a)
% 0.20/0.63 | ~ c_lessequals(V_a,V_b,T_a)
% 0.20/0.63 | ~ c_lessequals(c_0,V_c,T_a)
% 0.20/0.63 | c_lessequals(c_times(V_a,V_c,T_a),c_times(V_b,V_c,T_a),T_a) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
% 0.20/0.63 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.20/0.63 | class_Orderings_Olinorder(T) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
% 0.20/0.63 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.20/0.63 | class_Ring__and__Field_Opordered__semiring(T) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
% 0.20/0.63 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.20/0.63 | class_Orderings_Oorder(T) ) ).
% 0.20/0.63
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:10(EqnAxiom:0)
% 0.20/0.63 %VarNum:35(SingletonVarNum:14)
% 0.20/0.63 %MaxLitNum:4
% 0.20/0.63 %MaxfuncDepth:2
% 0.20/0.63 %SharedTerms:15
% 0.20/0.63 %goalClause: 1 2 3 4
% 0.20/0.63 %singleGoalClaCount:4
% 0.20/0.63 [1]P1(a1)
% 0.20/0.63 [2]P2(a2,f7(a6),a1)
% 0.20/0.63 [3]P2(f3(f8(a6),a1),f4(a9,f7(a6),a1),a1)
% 0.20/0.63 [4]~P2(f3(f8(a6),a1),f4(f5(a10,a9,a1),f7(a6),a1),a1)
% 0.20/0.63 [5]~P1(x51)+P3(x51)
% 0.20/0.63 [6]~P1(x61)+P4(x61)
% 0.20/0.63 [7]~P1(x71)+P5(x71)
% 0.20/0.63 [8]~P3(x83)+P2(x81,f5(x82,x81,x83),x83)
% 0.20/0.63 [9]~P4(x93)+~P2(x94,x92,x93)+P2(x91,x92,x93)+~P2(x91,x94,x93)
% 0.20/0.63 [10]~P5(x103)+~P2(x101,x104,x103)+~P2(a2,x102,x103)+P2(f4(x101,x102,x103),f4(x104,x102,x103),x103)
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 cnf(11,plain,
% 0.20/0.64 (P5(a1)),
% 0.20/0.64 inference(scs_inference,[],[1,7])).
% 0.20/0.64 cnf(12,plain,
% 0.20/0.64 (P4(a1)),
% 0.20/0.64 inference(scs_inference,[],[1,7,6])).
% 0.20/0.64 cnf(15,plain,
% 0.20/0.64 (P2(x151,f5(x152,x151,a1),a1)),
% 0.20/0.64 inference(scs_inference,[],[1,7,6,5,8])).
% 0.20/0.64 cnf(23,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[3,4,2,15,11,12,9,10]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------