%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN368+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n031.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 12:28:32 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(big_p_type,type,
    big_p: $i > $o ).

thf(sk1_type,type,
    sk1: $i ).

thf(1,conjecture,
    ? [A: $i] :
    ! [B: $i] :
      ( ( big_p @ A )
     => ( big_p @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2119) ).

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

thf(3,plain,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( big_p @ A )
       => ( big_p @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ( ! [A: $i] : ( big_p @ A )
     => ! [A: $i] : ( big_p @ A ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ~ ( big_p @ sk1 ),
    inference(cnf,[status(esa)],[4]) ).

thf(6,plain,
    ! [A: $i] : ( big_p @ A ),
    inference(cnf,[status(esa)],[4]) ).

thf(7,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[5,6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN368+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n031.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu May 18 19:57:11 EDT 2023
% 0.16/0.36  % CPUTime  : 
% 0.87/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.01/0.91  % [INFO] 	 Parsing done (102ms). 
% 1.01/0.91  % [INFO] 	 Running in sequential loop mode. 
% 1.48/1.12  % [INFO] 	 eprover registered as external prover. 
% 1.48/1.12  % [INFO] 	 cvc4 registered as external prover. 
% 1.48/1.13  % [INFO] 	 Scanning for conjecture ... 
% 1.69/1.17  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.69/1.19  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.69/1.19  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.69/1.20  % [INFO] 	 Type checking passed. 
% 1.69/1.20  % [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.40/1.44  % [INFO] 	 Killing All external provers ... 
% 2.40/1.44  % Time passed: 930ms (effective reasoning time: 524ms)
% 2.40/1.44  % 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.40/1.44  % Axioms used in derivation (0): 
% 2.40/1.44  % No. of inferences in proof: 8
% 2.40/1.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 930 ms resp. 524 ms w/o parsing
% 2.45/1.46  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.45/1.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------