%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n017.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:07:48 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(iext_type,type,
    iext: $i > $i > $i > $o ).

thf(uri_ex_p_type,type,
    uri_ex_p: $i ).

thf(uri_ex_q_type,type,
    uri_ex_q: $i ).

thf(uri_ex_s_type,type,
    uri_ex_s: $i ).

thf(1,conjecture,
    ? [A: $i,B: $i] :
      ( ( iext @ uri_ex_p @ A @ B )
      & ( iext @ uri_ex_q @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

thf(2,negated_conjecture,
    ~ ? [A: $i,B: $i] :
        ( ( iext @ uri_ex_p @ A @ B )
        & ( iext @ uri_ex_q @ B @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ? [A: $i,B: $i] :
        ( ( iext @ uri_ex_p @ A @ B )
        & ( iext @ uri_ex_q @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ? [A: $i] :
      ( ( iext @ uri_ex_p @ uri_ex_s @ A )
      & ( iext @ uri_ex_q @ A @ uri_ex_s ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

thf(6,plain,
    ? [A: $i] :
      ( ( iext @ uri_ex_p @ uri_ex_s @ A )
      & ( iext @ uri_ex_q @ A @ uri_ex_s ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(9,plain,
    $false,
    inference(e,[status(thm)],[4,6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n017.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu May 18 20:25:17 EDT 2023
% 0.16/0.36  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.24/0.94  % [INFO] 	 Parsing done (100ms). 
% 1.24/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.49/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.49/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.49/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.71/1.20  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.77/1.22  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.77/1.22  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.77/1.22  % [INFO] 	 Type checking passed. 
% 1.77/1.23  % [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.44/1.46  % External prover 'e' found a proof!
% 2.44/1.46  % [INFO] 	 Killing All external provers ... 
% 2.44/1.46  % Time passed: 948ms (effective reasoning time: 513ms)
% 2.44/1.46  % 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.44/1.46  % Axioms used in derivation (1): testcase_premise_fullish_002_Existential_Blank_Nodes
% 2.44/1.46  % No. of inferences in proof: 6
% 2.44/1.46  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 948 ms resp. 513 ms w/o parsing
% 2.44/1.49  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.44/1.49  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------