↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : ANA041-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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:14:00 EDT 2024

% Result   : Unsatisfiable 0.60s 0.67s
% Output   : CNFRefutation 0.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : ANA041-2 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36  % Computer : n020.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun Jun 23 04:57:54 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.56/0.63  start to proof:theBenchmark
% 0.60/0.66  %-------------------------------------------
% 0.60/0.66  % File        :CSE---1.7
% 0.60/0.66  % Problem     :theBenchmark
% 0.60/0.66  % Transform   :cnf
% 0.60/0.67  % Format      :tptp:raw
% 0.60/0.67  % Command     :java -jar mcs_scs.jar %d %s
% 0.60/0.67  
% 0.60/0.67  % Result      :Theorem 0.000000s
% 0.60/0.67  % Output      :CNFRefutation 0.000000s
% 0.60/0.67  %-------------------------------------------
% 0.60/0.67  %------------------------------------------------------------------------------
% 0.60/0.67  % File     : ANA041-2 : TPTP v8.2.0. Released v3.2.0.
% 0.60/0.67  % Domain   : Analysis
% 0.60/0.67  % Problem  : Problem about Big-O notation
% 0.60/0.67  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.60/0.67  % English  :
% 0.60/0.67  
% 0.60/0.67  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.60/0.67  % Source   : [Pau06]
% 0.60/0.67  % Names    :
% 0.60/0.67  
% 0.60/0.67  % Status   : Unsatisfiable
% 0.60/0.67  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.60/0.67  % Syntax   : Number of clauses     :    2 (   2 unt;   0 nHn;   1 RR)
% 0.60/0.67  %            Number of literals    :    2 (   0 equ;   1 neg)
% 0.60/0.67  %            Maximal clause size   :    1 (   1 avg)
% 0.60/0.67  %            Maximal term depth    :    2 (   1 avg)
% 0.60/0.67  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.60/0.67  %            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
% 0.60/0.67  %            Number of variables   :    2 (   2 sgn)
% 0.60/0.67  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.60/0.67  
% 0.60/0.67  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.60/0.67  %            of which only a small selection are required for the refutation.
% 0.60/0.67  %            The mission is to find those few axioms, after which a refutation
% 0.60/0.67  %            can be quite easily found. This version has only the necessary
% 0.60/0.67  %            axioms.
% 0.60/0.67  %------------------------------------------------------------------------------
% 0.60/0.67  cnf(cls_conjecture_0,negated_conjecture,
% 0.60/0.67      c_lessequals(c_0,v_h(V_U,V_V),t_c) ).
% 0.60/0.67  
% 0.60/0.67  cnf(cls_conjecture_3,negated_conjecture,
% 0.60/0.67      ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c) ).
% 0.60/0.67  
% 0.60/0.67  %------------------------------------------------------------------------------
% 0.60/0.67  %-------------------------------------------
% 0.60/0.67  % Proof found
% 0.60/0.67  % SZS status Theorem for theBenchmark
% 0.60/0.67  % SZS output start Proof
% 0.60/0.67  %ClaNum:2(EqnAxiom:0)
% 0.60/0.67  %VarNum:2(SingletonVarNum:2)
% 0.60/0.67  %MaxLitNum:1
% 0.60/0.67  %MaxfuncDepth:1
% 0.60/0.67  %SharedTerms:6
% 0.60/0.67  %goalClause: 1 2
% 0.60/0.67  %singleGoalClaCount:2
% 0.60/0.67  [2]~P1(a1,f2(a4,a5),a3)
% 0.60/0.67  [1]P1(a1,f2(x11,x12),a3)
% 0.60/0.67  %EqnAxiom
% 0.60/0.67  
% 0.60/0.68  %-------------------------------------------
% 0.60/0.68  cnf(3,plain,
% 0.60/0.68     ($false),
% 0.60/0.68     inference(scs_inference,[],[1,2]),
% 0.60/0.68     ['proof']).
% 0.60/0.68  % SZS output end Proof
% 0.60/0.68  % Total time :0.000000s
%------------------------------------------------------------------------------