TSTP Solution File: SYO530^1 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SYO530^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n022.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 08:57:17 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(1,conjecture,
    ! [A: $i > $i > $o] :
      ( ? [B: $i,C: $i] : ( A @ B @ C )
     => ( A @ ( epsa @ A ) @ ( epsb @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(2,negated_conjecture,
    ~ ! [A: $i > $i > $o] :
        ( ? [B: $i,C: $i] : ( A @ B @ C )
       => ( A @ ( epsa @ A ) @ ( epsb @ A ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ! [A: $i > $i > $o] :
        ( ? [B: $i,C: $i] : ( A @ B @ C )
       => ( A
          @ ( eps
            @ ^ [B: $i] :
              ? [C: $i] : ( A @ B @ C ) )
          @ ( eps
            @ ( A
              @ ( eps
                @ ^ [B: $i] :
                  ? [C: $i] : ( A @ B @ C ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [A: $i > $o] :
      ( ? [B: $i] : ( A @ B )
     => ( A @ ( eps @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceax) ).

thf(7,plain,
    ! [A: $i > $o] :
      ( ? [B: $i] : ( A @ B )
     => ( A @ ( eps @ A ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(17,plain,
    $false,
    inference(e,[status(thm)],[4,7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : SYO530^1 : TPTP v8.2.0. Released v5.2.0.
% 0.05/0.13  % Command  : run_Leo-III %s %d
% 0.12/0.33  % Computer : n022.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 11:04:38 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.10/0.95  % [INFO] 	 Parsing done (121ms). 
% 1.10/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.55/1.25  % [INFO] 	 eprover registered as external prover. 
% 1.55/1.25  % [INFO] 	 cvc4 registered as external prover. 
% 1.55/1.26  % [INFO] 	 Scanning for conjecture ... 
% 1.75/1.34  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.80/1.37  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.80/1.38  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.80/1.38  % [INFO] 	 Type checking passed. 
% 1.80/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 ... 
% 2.92/1.85  % External prover 'e' found a proof!
% 2.92/1.85  % [INFO] 	 Killing All external provers ... 
% 2.92/1.85  % Time passed: 1379ms (effective reasoning time: 885ms)
% 2.92/1.85  % 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.92/1.85  % Axioms used in derivation (1): choiceax
% 2.92/1.85  % No. of inferences in proof: 6
% 2.92/1.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1379 ms resp. 885 ms w/o parsing
% 3.00/1.89  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.89  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------