TSTP Solution File: SEV272^5 by Leo-III-SAT---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.15
% Problem  : SEV272^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d SAT

% Computer : n019.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 15:59:54 EDT 2024

% Result   : Theorem 2.16s 1.46s
% Output   : Refutation 2.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (   2 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :   34 (   2   ~;   0   |;   4   &;  20   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   28 (  28   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   4   ^   8   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
thf(1,conjecture,
    ( ( ^ [A: ( $i > $o ) > $o] :
        ! [B: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( B @ cZERO )
            & ! [C: ( $i > $o ) > $o] :
                ( ( B @ C )
               => ( B @ ( cSUCC @ C ) ) ) )
         => ( B @ A ) ) )
    = ( ^ [A: ( $i > $o ) > $o] :
        ! [B: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( B @ cZERO )
            & ! [C: ( $i > $o ) > $o] :
                ( ( B @ C )
               => ( B @ ( cSUCC @ C ) ) ) )
         => ( B @ A ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX6007A_pme) ).

thf(2,negated_conjecture,
    ( ( ^ [A: ( $i > $o ) > $o] :
        ! [B: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( B @ cZERO )
            & ! [C: ( $i > $o ) > $o] :
                ( ( B @ C )
               => ( B @ ( cSUCC @ C ) ) ) )
         => ( B @ A ) ) )
   != ( ^ [A: ( $i > $o ) > $o] :
        ! [B: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( B @ cZERO )
            & ! [C: ( $i > $o ) > $o] :
                ( ( B @ C )
               => ( B @ ( cSUCC @ C ) ) ) )
         => ( B @ A ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    $false,
    inference(simp,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SEV272^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.13/0.14  % Command  : run_Leo-III %s %d SAT
% 0.13/0.35  % Computer : n019.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 Jun 21 19:33:10 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 1.06/0.94  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/1.05  % [INFO] 	 Parsing done (115ms). 
% 1.26/1.06  % [INFO] 	 Running in sequential loop mode. 
% 1.70/1.27  % [INFO] 	 nitpick registered as external prover. 
% 1.70/1.27  % [INFO] 	 Scanning for conjecture ... 
% 1.97/1.33  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.97/1.35  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.97/1.35  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.97/1.35  % [INFO] 	 Type checking passed. 
% 1.97/1.36  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.16/1.45  % [INFO] 	 Killing All external provers ... 
% 2.16/1.46  % Time passed: 889ms (effective reasoning time: 390ms)
% 2.16/1.46  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.16/1.46  % Axioms used in derivation (0): 
% 2.16/1.46  % No. of inferences in proof: 4
% 2.16/1.46  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 889 ms resp. 390 ms w/o parsing
% 2.31/1.49  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.31/1.49  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------