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

% Computer : n014.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  7 11:01:47 EDT 2024

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

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

thf(big_q_type,type,
    big_q: $i > $o ).

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN383+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13  % Command  : run_Leo-III %s %d
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon May  6 20:56:39 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.93/0.91  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.18/1.04  % [INFO] 	 Parsing done (133ms). 
% 1.18/1.05  % [INFO] 	 Running in sequential loop mode. 
% 1.72/1.39  % [INFO] 	 nitpick registered as external prover. 
% 1.72/1.40  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.48  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.97/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.97/1.50  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.97/1.51  % [INFO] 	 Type checking passed. 
% 1.97/1.51  % [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.54/1.85  % [INFO] 	 Killing All external provers ... 
% 2.54/1.86  % Time passed: 1365ms (effective reasoning time: 797ms)
% 2.54/1.86  % 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.54/1.86  % Axioms used in derivation (0): 
% 2.54/1.86  % No. of inferences in proof: 7
% 2.54/1.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1365 ms resp. 797 ms w/o parsing
% 2.54/1.89  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.54/1.89  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------