%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYO349_8 : TPTP v8.1.2. Released v8.0.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:35:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(cB_type,type,
    cB: $o ).

thf(cP_type,type,
    cP: $o > $o ).

thf(cA_type,type,
    cA: $o ).

thf(1,conjecture,
    ( ~ cA
    | ~ cB
    | ~ ( cP @ cA )
    | ( cP @ cB ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM617) ).

thf(2,negated_conjecture,
    ~ ( ~ cA
      | ~ cB
      | ~ ( cP @ cA )
      | ( cP @ cB ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ~ cA
      | ~ cB
      | ~ ( cP @ cA )
      | ( cP @ cB ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ( cP @ cB ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    cB,
    inference(cnf,[status(esa)],[3]) ).

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

thf(5,plain,
    cP @ cA,
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    cA,
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    cP @ $true,
    inference(rewrite,[status(thm)],[5,7]) ).

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

thf(11,plain,
    $false,
    inference(simp,[status(thm)],[10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO349_8 : TPTP v8.1.2. Released v8.0.0.
% 0.14/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu May 18 18:22:25 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.82/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.21/0.94  % [INFO] 	 Parsing done (103ms). 
% 1.21/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.48/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.48/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.48/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.66/1.19  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.77/1.21  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.77/1.21  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.77/1.21  % [INFO] 	 Type checking passed. 
% 1.77/1.21  % [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.14/1.44  % [INFO] 	 Killing All external provers ... 
% 2.14/1.44  % Time passed: 925ms (effective reasoning time: 492ms)
% 2.14/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.14/1.44  % Axioms used in derivation (0): 
% 2.14/1.44  % No. of inferences in proof: 11
% 2.14/1.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 925 ms resp. 492 ms w/o parsing
% 2.42/1.46  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.42/1.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------