TSTP Solution File: ANA039-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : ANA039-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 : n022.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.21s 0.70s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ANA039-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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:39:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.56 start to proof:theBenchmark
% 0.21/0.69 %-------------------------------------------
% 0.21/0.69 % File :CSE---1.6
% 0.21/0.69 % Problem :theBenchmark
% 0.21/0.69 % Transform :cnf
% 0.21/0.69 % Format :tptp:raw
% 0.21/0.69 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.69
% 0.21/0.69 % Result :Theorem 0.080000s
% 0.21/0.69 % Output :CNFRefutation 0.080000s
% 0.21/0.69 %-------------------------------------------
% 0.21/0.69 %------------------------------------------------------------------------------
% 0.21/0.69 % File : ANA039-2 : TPTP v8.1.2. Released v3.2.0.
% 0.21/0.69 % Domain : Analysis
% 0.21/0.69 % Problem : Problem about Big-O notation
% 0.21/0.69 % Version : [Pau06] axioms : Reduced > Especial.
% 0.21/0.69 % English :
% 0.21/0.69
% 0.21/0.69 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.21/0.69 % Source : [Pau06]
% 0.21/0.69 % Names :
% 0.21/0.69
% 0.21/0.69 % Status : Unsatisfiable
% 0.21/0.69 % 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.21/0.69 % Syntax : Number of clauses : 10 ( 3 unt; 0 nHn; 7 RR)
% 0.21/0.69 % Number of literals : 21 ( 0 equ; 12 neg)
% 0.21/0.69 % Maximal clause size : 4 ( 2 avg)
% 0.21/0.69 % Maximal term depth : 4 ( 1 avg)
% 0.21/0.69 % Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty)
% 0.21/0.70 % Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% 0.21/0.70 % Number of variables : 16 ( 1 sgn)
% 0.21/0.70 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.21/0.70
% 0.21/0.70 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.21/0.70 % of which only a small selection are required for the refutation.
% 0.21/0.70 % The mission is to find those few axioms, after which a refutation
% 0.21/0.70 % can be quite easily found. This version has only the necessary
% 0.21/0.70 % axioms.
% 0.21/0.70 %------------------------------------------------------------------------------
% 0.21/0.70 cnf(cls_conjecture_0,negated_conjecture,
% 0.21/0.70 c_lessequals(c_HOL_Oabs(v_h(V_U),t_a),c_times(v_c,c_HOL_Oabs(v_f(V_U),t_a),t_a),t_a) ).
% 0.21/0.70
% 0.21/0.70 cnf(cls_conjecture_2,negated_conjecture,
% 0.21/0.70 ~ c_lessequals(c_HOL_Oabs(v_h(v_x),t_a),c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x),t_a),t_a),t_a) ).
% 0.21/0.70
% 0.21/0.70 cnf(tfree_tcs,negated_conjecture,
% 0.21/0.70 class_Ring__and__Field_Oordered__idom(t_a) ).
% 0.21/0.70
% 0.21/0.70 cnf(cls_OrderedGroup_Oabs__ge__self_0,axiom,
% 0.21/0.70 ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a)
% 0.21/0.70 | c_lessequals(V_a,c_HOL_Oabs(V_a,T_a),T_a) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
% 0.21/0.70 ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a)
% 0.21/0.70 | c_lessequals(c_0,c_HOL_Oabs(V_a,T_a),T_a) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
% 0.21/0.70 ( ~ class_Orderings_Oorder(T_a)
% 0.21/0.70 | ~ c_lessequals(V_y,V_z,T_a)
% 0.21/0.70 | ~ c_lessequals(V_x,V_y,T_a)
% 0.21/0.70 | c_lessequals(V_x,V_z,T_a) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
% 0.21/0.70 ( ~ class_Ring__and__Field_Opordered__semiring(T_a)
% 0.21/0.70 | ~ c_lessequals(V_a,V_b,T_a)
% 0.21/0.70 | ~ c_lessequals(c_0,V_c,T_a)
% 0.21/0.70 | c_lessequals(c_times(V_a,V_c,T_a),c_times(V_b,V_c,T_a),T_a) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
% 0.21/0.70 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.21/0.70 | class_Ring__and__Field_Opordered__semiring(T) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
% 0.21/0.70 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.21/0.70 | class_Orderings_Oorder(T) ) ).
% 0.21/0.70
% 0.21/0.70 cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
% 0.21/0.70 ( ~ class_Ring__and__Field_Oordered__idom(T)
% 0.21/0.70 | class_OrderedGroup_Olordered__ab__group__abs(T) ) ).
% 0.21/0.70
% 0.21/0.70 %------------------------------------------------------------------------------
% 0.21/0.70 %-------------------------------------------
% 0.21/0.70 % Proof found
% 0.21/0.70 % SZS status Theorem for theBenchmark
% 0.21/0.70 % SZS output start Proof
% 0.21/0.70 %ClaNum:10(EqnAxiom:0)
% 0.21/0.70 %VarNum:40(SingletonVarNum:16)
% 0.21/0.70 %MaxLitNum:4
% 0.21/0.70 %MaxfuncDepth:3
% 0.21/0.70 %SharedTerms:12
% 0.21/0.70 %goalClause: 1 2 3
% 0.21/0.70 %singleGoalClaCount:3
% 0.21/0.70 [1]P1(a1)
% 0.21/0.70 [3]~P2(f2(f5(a8),a1),f4(f2(a6,a1),f2(f7(a8),a1),a1),a1)
% 0.21/0.70 [2]P2(f2(f5(x21),a1),f4(a6,f2(f7(x21),a1),a1),a1)
% 0.21/0.70 [4]~P1(x41)+P3(x41)
% 0.21/0.70 [5]~P1(x51)+P4(x51)
% 0.21/0.70 [6]~P1(x61)+P5(x61)
% 0.21/0.70 [7]~P3(x72)+P2(a3,f2(x71,x72),x72)
% 0.21/0.70 [8]~P3(x82)+P2(x81,f2(x81,x82),x82)
% 0.21/0.70 [9]~P4(x93)+~P2(x94,x92,x93)+P2(x91,x92,x93)+~P2(x91,x94,x93)
% 0.21/0.70 [10]~P5(x103)+~P2(x101,x104,x103)+~P2(a3,x102,x103)+P2(f4(x101,x102,x103),f4(x104,x102,x103),x103)
% 0.21/0.70 %EqnAxiom
% 0.21/0.70
% 0.21/0.70 %-------------------------------------------
% 0.21/0.70 cnf(11,plain,
% 0.21/0.70 (P5(a1)),
% 0.21/0.70 inference(scs_inference,[],[1,6])).
% 0.21/0.70 cnf(12,plain,
% 0.21/0.70 (P4(a1)),
% 0.21/0.70 inference(scs_inference,[],[1,6,5])).
% 0.21/0.70 cnf(13,plain,
% 0.21/0.70 (P3(a1)),
% 0.21/0.70 inference(scs_inference,[],[1,6,5,4])).
% 0.21/0.70 cnf(17,plain,
% 0.21/0.70 (P2(a3,f2(x171,a1),a1)),
% 0.21/0.70 inference(scs_inference,[],[1,6,5,4,8,7])).
% 0.21/0.70 cnf(48,plain,
% 0.21/0.70 (P2(f4(x481,f2(x482,a1),a1),f4(f2(x481,a1),f2(x482,a1),a1),a1)),
% 0.21/0.70 inference(scs_inference,[],[13,17,11,8,10])).
% 0.21/0.70 cnf(57,plain,
% 0.21/0.70 ($false),
% 0.21/0.70 inference(scs_inference,[],[48,3,2,12,9]),
% 0.21/0.70 ['proof']).
% 0.21/0.70 % SZS output end Proof
% 0.21/0.70 % Total time :0.080000s
%------------------------------------------------------------------------------