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

View Problem - Process Solution

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

% Computer : n028.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:05 EDT 2024

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

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

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

thf(2,negated_conjecture,
    ~ ! [A: a > $o,B: a > $o,C: a] :
        ( ( ( A @ C )
          & ~ ( B @ C ) )
       => ( ( ( A @ C )
            & ~ ( B @ C ) )
          | ( ( B @ C )
            & ~ ( A @ C ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > $o,B: a > $o,C: a] :
        ( ( ( A @ C )
          & ~ ( B @ C ) )
       => ( ( ( A @ C )
            & ~ ( B @ C ) )
          | ( ( B @ C )
            & ~ ( A @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(9,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SET599^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11  % Command  : run_Leo-III %s %d
% 0.10/0.31  % Computer : n028.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Mon May 20 13:19:23 EDT 2024
% 0.15/0.31  % CPUTime  : 
% 0.94/0.91  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.15/1.06  % [INFO] 	 Parsing done (147ms). 
% 1.27/1.07  % [INFO] 	 Running in sequential loop mode. 
% 1.71/1.41  % [INFO] 	 eprover registered as external prover. 
% 1.71/1.41  % [INFO] 	 cvc4 registered as external prover. 
% 1.71/1.42  % [INFO] 	 Scanning for conjecture ... 
% 1.88/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.95/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.95/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.95/1.53  % [INFO] 	 Type checking passed. 
% 1.95/1.53  % [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.59/1.89  % External prover 'e' found a proof!
% 2.59/1.89  % [INFO] 	 Killing All external provers ... 
% 2.59/1.89  % Time passed: 1435ms (effective reasoning time: 815ms)
% 2.59/1.89  % 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.59/1.89  % Axioms used in derivation (0): 
% 2.59/1.89  % No. of inferences in proof: 4
% 2.59/1.89  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1435 ms resp. 815 ms w/o parsing
% 2.86/1.92  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.86/1.92  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------