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

% Computer : n029.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:55:32 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(h_type,type,
    h: $o > $i ).

thf(1,conjecture,
    ( ( h
      @ ( ( h @ $false )
        = ( h @ ~ $false ) ) )
    = ( h @ $false ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',1) ).

thf(2,negated_conjecture,
    ( ( h
      @ ( ( h @ $false )
        = ( h @ ~ $false ) ) )
   != ( h @ $false ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( h
      @ ( ( h @ $false )
        = ( h @ $true ) ) )
   != ( h @ $false ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ( ( h
      @ ( ( h @ $false )
        = ( h @ $true ) ) )
   != ( h @ $false ) ),
    inference(lifteq,[status(thm)],[3]) ).

thf(5,plain,
    ( ( h @ $false )
    = ( h @ $true ) ),
    inference(simp,[status(thm)],[4]) ).

thf(6,plain,
    ( ( h @ $false )
    = ( h @ $true ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(7,plain,
    ( ( h
      @ ( ( h @ $true )
        = ( h @ $true ) ) )
   != ( h @ $true ) ),
    inference(rewrite,[status(thm)],[4,6]) ).

thf(8,plain,
    $false,
    inference(simp,[status(thm)],[7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SYO039^2 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.12  % Command  : run_Leo-III %s %d
% 0.12/0.32  % Computer : n029.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Mon May 20 09:20:24 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.98/0.95  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.27/1.10  % [INFO] 	 Parsing done (148ms). 
% 1.27/1.11  % [INFO] 	 Running in sequential loop mode. 
% 1.84/1.47  % [INFO] 	 eprover registered as external prover. 
% 1.84/1.47  % [INFO] 	 cvc4 registered as external prover. 
% 1.84/1.48  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.55  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.02/1.57  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.02/1.57  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.02/1.58  % [INFO] 	 Type checking passed. 
% 2.02/1.58  % [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.61/1.97  % [INFO] 	 Killing All external provers ... 
% 2.61/1.97  % Time passed: 1498ms (effective reasoning time: 856ms)
% 2.61/1.97  % 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.61/1.98  % Axioms used in derivation (0): 
% 2.61/1.98  % No. of inferences in proof: 8
% 2.61/1.98  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1498 ms resp. 856 ms w/o parsing
% 2.87/2.00  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.87/2.00  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------