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

% Computer : n004.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:04 EDT 2023

% Result   : Theorem 2.38s 1.65s
% Output   : Refutation 2.38s
% 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       :   22 (   0 equ;   0 cnn)
%            Maximal formula atoms :    7 (   5 avg)
%            Number of connectives :   47 (   2   ~;   0   |;   9   &;  27   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   15 (   0   ^;   9   !;   6   ?;  15   :)

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n004.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu May 18 19:45:40 EDT 2023
% 0.16/0.38  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/0.94  % [INFO] 	 Parsing done (109ms). 
% 1.14/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.58/1.19  % [INFO] 	 eprover registered as external prover. 
% 1.58/1.20  % [INFO] 	 cvc4 registered as external prover. 
% 1.58/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.66/1.27  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.66/1.29  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.66/1.29  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.66/1.30  % [INFO] 	 Type checking passed. 
% 1.66/1.30  % [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.38/1.65  % External prover 'e' found a proof!
% 2.38/1.65  % [INFO] 	 Killing All external provers ... 
% 2.38/1.65  % Time passed: 1122ms (effective reasoning time: 694ms)
% 2.38/1.65  % 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.38/1.65  % Axioms used in derivation (0): 
% 2.38/1.65  % No. of inferences in proof: 4
% 2.38/1.65  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1122 ms resp. 694 ms w/o parsing
% 2.38/1.68  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.38/1.68  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------