TSTP Solution File: ANA041-2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : ANA041-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n015.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:27 EDT 2023

% Result   : Unsatisfiable 0.20s 0.61s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : ANA041-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n015.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.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Aug 25 19:10:22 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % File        :CSE---1.6
% 0.20/0.61  % Problem     :theBenchmark
% 0.20/0.61  % Transform   :cnf
% 0.20/0.61  % Format      :tptp:raw
% 0.20/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.61  
% 0.20/0.61  % Result      :Theorem 0.000000s
% 0.20/0.61  % Output      :CNFRefutation 0.000000s
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  %------------------------------------------------------------------------------
% 0.20/0.61  % File     : ANA041-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.61  % Domain   : Analysis
% 0.20/0.61  % Problem  : Problem about Big-O notation
% 0.20/0.61  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.20/0.61  % English  :
% 0.20/0.61  
% 0.20/0.61  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.61  % Source   : [Pau06]
% 0.20/0.61  % Names    :
% 0.20/0.61  
% 0.20/0.61  % Status   : Unsatisfiable
% 0.20/0.61  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.61  % Syntax   : Number of clauses     :    2 (   2 unt;   0 nHn;   1 RR)
% 0.20/0.61  %            Number of literals    :    2 (   0 equ;   1 neg)
% 0.20/0.61  %            Maximal clause size   :    1 (   1 avg)
% 0.20/0.61  %            Maximal term depth    :    2 (   1 avg)
% 0.20/0.61  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.20/0.61  %            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
% 0.20/0.61  %            Number of variables   :    2 (   2 sgn)
% 0.20/0.61  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.61  
% 0.20/0.61  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.61  %            of which only a small selection are required for the refutation.
% 0.20/0.61  %            The mission is to find those few axioms, after which a refutation
% 0.20/0.61  %            can be quite easily found. This version has only the necessary
% 0.20/0.61  %            axioms.
% 0.20/0.61  %------------------------------------------------------------------------------
% 0.20/0.61  cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.61      c_lessequals(c_0,v_h(V_U,V_V),t_c) ).
% 0.20/0.61  
% 0.20/0.61  cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.61      ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c) ).
% 0.20/0.61  
% 0.20/0.61  %------------------------------------------------------------------------------
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark
% 0.20/0.61  % SZS output start Proof
% 0.20/0.61  %ClaNum:2(EqnAxiom:0)
% 0.20/0.61  %VarNum:2(SingletonVarNum:2)
% 0.20/0.61  %MaxLitNum:1
% 0.20/0.61  %MaxfuncDepth:1
% 0.20/0.61  %SharedTerms:6
% 0.20/0.61  %goalClause: 1 2
% 0.20/0.61  %singleGoalClaCount:2
% 0.20/0.61  [2]~P1(a1,f2(a4,a5),a3)
% 0.20/0.61  [1]P1(a1,f2(x11,x12),a3)
% 0.20/0.61  %EqnAxiom
% 0.20/0.61  
% 0.20/0.61  %-------------------------------------------
% 0.20/0.62  cnf(3,plain,
% 0.20/0.62     ($false),
% 0.20/0.62     inference(scs_inference,[],[1,2]),
% 0.20/0.62     ['proof']).
% 0.20/0.62  % SZS output end Proof
% 0.20/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------