TSTP Solution File: SET617^5 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SET617^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n010.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 : Tue May 21 03:03:14 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(1,conjecture,
    ! [A: a > $o] :
      ( ( ( ^ [B: a] :
              ( ( ( A @ B )
                & ~ $false )
              | ( $false
                & ~ ( A @ B ) ) ) )
        = A )
      & ( ( ^ [B: a] :
              ( ( $false
                & ~ ( A @ B ) )
              | ( ( A @ B )
                & ~ $false ) ) )
        = A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_92_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o] :
        ( ( ( ^ [B: a] :
                ( ( ( A @ B )
                  & ~ $false )
                | ( $false
                  & ~ ( A @ B ) ) ) )
          = A )
        & ( ( ^ [B: a] :
                ( ( $false
                  & ~ ( A @ B ) )
                | ( ( A @ B )
                  & ~ $false ) ) )
          = 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.02/0.10  % Problem  : SET617^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.13  % Command  : run_Leo-III %s %d
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon May 20 12:55:39 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.89/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.04/1.03  % [INFO] 	 Parsing done (144ms). 
% 1.20/1.04  % [INFO] 	 Running in sequential loop mode. 
% 1.50/1.28  % [INFO] 	 eprover registered as external prover. 
% 1.50/1.28  % [INFO] 	 cvc4 registered as external prover. 
% 1.50/1.29  % [INFO] 	 Scanning for conjecture ... 
% 1.68/1.34  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.77/1.37  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.77/1.37  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.77/1.38  % [INFO] 	 Type checking passed. 
% 1.77/1.38  % [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 ... 
% 1.96/1.49  % [INFO] 	 Killing All external provers ... 
% 1.96/1.49  % Time passed: 1001ms (effective reasoning time: 441ms)
% 1.96/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)>
% 1.96/1.49  % Axioms used in derivation (0): 
% 1.96/1.49  % No. of inferences in proof: 4
% 1.96/1.49  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1001 ms resp. 441 ms w/o parsing
% 1.96/1.52  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.96/1.52  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------