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

% Computer : n026.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:08 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(p_type,type,
    p: $i > $i > $o ).

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

thf(sk2_type,type,
    sk2: $i ).

thf(1,conjecture,
    ( ? [A: $i] :
      ! [B: $i] : ( p @ A @ B )
   => ! [A: $i] :
      ? [B: $i] : ( p @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

thf(6,plain,
    ! [A: $i] :
      ~ ( p @ A @ sk2 ),
    inference(simp,[status(thm)],[4]) ).

thf(7,plain,
    ! [B: $i,A: $i] :
      ( ( p @ sk1 @ A )
     != ( p @ B @ sk2 ) ),
    inference(paramod_ordered,[status(thm)],[5,6]) ).

thf(8,plain,
    $false,
    inference(pattern_uni,[status(thm)],[7:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN972+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.36  % Computer : n026.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu May 18 19:46:06 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.92/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.25/1.01  % [INFO] 	 Parsing done (115ms). 
% 1.25/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.55/1.22  % [INFO] 	 eprover registered as external prover. 
% 1.72/1.22  % [INFO] 	 cvc4 registered as external prover. 
% 1.72/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.27  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.84/1.29  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.84/1.29  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.84/1.29  % [INFO] 	 Type checking passed. 
% 1.84/1.30  % [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.38/1.57  % [INFO] 	 Killing All external provers ... 
% 2.62/1.57  % Time passed: 1047ms (effective reasoning time: 552ms)
% 2.62/1.57  % 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.62/1.57  % Axioms used in derivation (0): 
% 2.62/1.57  % No. of inferences in proof: 8
% 2.62/1.57  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1047 ms resp. 552 ms w/o parsing
% 2.62/1.65  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.65  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------