TSTP Solution File: SEU501_8 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SEU501_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %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 : Fri May 19 11:59:24 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(in_type,type,
    in: $i > $i > $o ).

thf(emptyset_type,type,
    emptyset: $i ).

thf(emptysetAx_type,type,
    emptysetAx: $o ).

thf(1,conjecture,
    ( emptysetAx
   => ! [A: $i] :
        ( ( in @ A @ emptyset )
       => ! [B: $o] : B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE) ).

thf(2,negated_conjecture,
    ~ ( emptysetAx
     => ! [A: $i] :
          ( ( in @ A @ emptyset )
         => ! [B: $o] : B ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ( emptysetAx
     => ! [A: $i] :
          ( ( in @ A @ emptyset )
         => ! [B: $o] : B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ( emptysetAx
    = ( ! [A: $i] :
          ~ ( in @ A @ emptyset ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx) ).

thf(9,plain,
    ( emptysetAx
    = ( ! [A: $i] :
          ~ ( in @ A @ emptyset ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(11,plain,
    $false,
    inference(cvc4,[status(thm)],[4,9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU501_8 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n015.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu May 18 12:46:53 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.84/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.96  % [INFO] 	 Parsing done (102ms). 
% 1.16/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.51/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.51/1.16  % [INFO] 	 cvc4 registered as external prover. 
% 1.51/1.16  % [INFO] 	 Scanning for conjecture ... 
% 1.69/1.20  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.69/1.22  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.69/1.24  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.69/1.24  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.69/1.24  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.69/1.24  % [INFO] 	 Type checking passed. 
% 1.69/1.25  % [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.39/1.49  % External prover 'cvc4' found a proof!
% 2.39/1.49  % [INFO] 	 Killing All external provers ... 
% 2.39/1.49  % Time passed: 968ms (effective reasoning time: 522ms)
% 2.39/1.49  % 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.39/1.49  % Axioms used in derivation (1): emptysetAx
% 2.39/1.49  % No. of inferences in proof: 6
% 2.39/1.49  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 968 ms resp. 522 ms w/o parsing
% 2.39/1.53  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.39/1.53  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------