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

% Computer : n032.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 1.83s 1.32s
% Output   : Refutation 2.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    6 (   1 unt;   2 typ;   0 def)
%            Number of atoms       :   15 (   0 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   13 (   2   ~;   0   |;   4   &;   0   @)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   3 con; 0-0 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $o ).

thf(b_type,type,
    b: $o ).

thf(1,conjecture,
    ( ( a
      & b )
   => ( a
    <=> b ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(2,negated_conjecture,
    ~ ( ( a
        & b )
     => ( a
      <=> b ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( a
        & b )
     => ( ( a
         => b )
        & ( b
         => a ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(10,plain,
    $false,
    inference(cvc4,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SYN978+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.09  % Command  : run_Leo-III %s %d
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Thu May 18 19:42:05 EDT 2023
% 0.08/0.28  % CPUTime  : 
% 0.73/0.71  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.84/0.82  % [INFO] 	 Parsing done (110ms). 
% 0.84/0.83  % [INFO] 	 Running in sequential loop mode. 
% 1.29/1.04  % [INFO] 	 eprover registered as external prover. 
% 1.29/1.04  % [INFO] 	 cvc4 registered as external prover. 
% 1.29/1.05  % [INFO] 	 Scanning for conjecture ... 
% 1.49/1.09  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.49/1.11  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.49/1.11  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.49/1.11  % [INFO] 	 Type checking passed. 
% 1.49/1.11  % [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 ... 
% 1.83/1.32  % External prover 'cvc4' found a proof!
% 1.83/1.32  % [INFO] 	 Killing All external provers ... 
% 1.83/1.32  % Time passed: 934ms (effective reasoning time: 485ms)
% 1.83/1.32  % 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)>
% 1.83/1.32  % Axioms used in derivation (0): 
% 1.83/1.32  % No. of inferences in proof: 4
% 1.83/1.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 934 ms resp. 485 ms w/o parsing
% 2.08/1.34  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.08/1.34  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------