%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SYO123^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n024.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 21 08:55:52 EDT 2024

% Result   : Theorem 2.39s 1.43s
% Output   : Refutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   2 unt;   3 typ;   0 def)
%            Number of atoms       :   15 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   26 (   6   ~;   2   |;   3   &;  12   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Number of types       :    2 (   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   :    4 (   0   ^   4   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
thf(b_type,type,
    b: $i ).

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

thf(a_type,type,
    a: $i ).

thf(1,conjecture,
    ( ! [A: $i] : ( cP @ A )
   => ( ( cP @ a )
      & ( cP @ b ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cALLCONJ2) ).

thf(2,negated_conjecture,
    ~ ( ! [A: $i] : ( cP @ A )
     => ( ( cP @ a )
        & ( cP @ b ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i] : ( cP @ A )
     => ( ( cP @ a )
        & ( cP @ b ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYO123^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n024.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon May 20 08:31:24 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.96/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.21/0.94  % [INFO] 	 Parsing done (89ms). 
% 1.21/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.57/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.57/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.57/1.14  % [INFO] 	 Scanning for conjecture ... 
% 1.66/1.19  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.66/1.20  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.66/1.21  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.66/1.21  % [INFO] 	 Type checking passed. 
% 1.66/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.39/1.43  % [INFO] 	 Killing All external provers ... 
% 2.39/1.43  % Time passed: 913ms (effective reasoning time: 480ms)
% 2.39/1.43  % 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.39/1.43  % Axioms used in derivation (0): 
% 2.39/1.43  % No. of inferences in proof: 7
% 2.39/1.43  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 913 ms resp. 480 ms w/o parsing
% 2.49/1.49  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.49/1.49  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------