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

% Computer : n011.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:33:09 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(r_type,type,
    r: $i > $o ).

thf(p_type,type,
    p: $i > $i > $o ).

thf(f_type,type,
    f: $i > $i ).

thf(q_type,type,
    q: $i > $i > $o ).

thf(1,conjecture,
    ! [A: $i] :
      ( ! [B: $i] :
          ( ( ( r @ A )
           => ( r @ B ) )
         => ( p @ ( f @ B ) @ B ) )
     => ? [B: $i,C: $i] :
          ( ( p @ B @ C )
          & ( ( q @ ( f @ A ) @ A )
           => ( q @ B @ C ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ! [B: $i] :
            ( ( ( r @ A )
             => ( r @ B ) )
           => ( p @ ( f @ B ) @ B ) )
       => ? [B: $i,C: $i] :
            ( ( p @ B @ C )
            & ( ( q @ ( f @ A ) @ A )
             => ( q @ B @ C ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $i] :
        ( ! [B: $i] :
            ( ( ( r @ A )
             => ( r @ B ) )
           => ( p @ ( f @ B ) @ B ) )
       => ? [B: $i,C: $i] :
            ( ( p @ B @ C )
            & ( ( q @ ( f @ A ) @ A )
             => ( q @ B @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May 18 19:26:04 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.83/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.07/0.99  % [INFO] 	 Parsing done (116ms). 
% 1.07/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.65/1.19  % [INFO] 	 eprover registered as external prover. 
% 1.65/1.19  % [INFO] 	 cvc4 registered as external prover. 
% 1.65/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.78/1.25  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.78/1.27  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.78/1.27  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.78/1.27  % [INFO] 	 Type checking passed. 
% 1.78/1.27  % [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.56/1.54  % External prover 'e' found a proof!
% 2.56/1.54  % [INFO] 	 Killing All external provers ... 
% 2.56/1.54  % Time passed: 1031ms (effective reasoning time: 544ms)
% 2.56/1.54  % 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.56/1.54  % Axioms used in derivation (0): 
% 2.56/1.54  % No. of inferences in proof: 4
% 2.56/1.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1031 ms resp. 544 ms w/o parsing
% 2.56/1.60  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.56/1.60  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------