%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN339-1 : TPTP v8.1.2. Released v1.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:28:25 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(f_type,type,
    f: $i > $i > $i > $o ).

thf(y_type,type,
    y: $i > $i ).

thf(1,negated_conjecture,
    ! [B: $i,A: $i] : ( f @ A @ ( y @ A ) @ B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

thf(3,plain,
    ! [B: $i,A: $i] : ( f @ A @ ( y @ A ) @ B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,negated_conjecture,
    ! [B: $i,A: $i] :
      ~ ( f @ ( y @ A ) @ B @ B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

thf(4,plain,
    ! [B: $i,A: $i] :
      ~ ( f @ ( y @ A ) @ B @ B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ! [B: $i,A: $i] :
      ~ ( f @ ( y @ A ) @ B @ B ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(6,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( f @ A @ ( y @ A ) @ B )
     != ( f @ ( y @ C ) @ D @ D ) ),
    inference(paramod_ordered,[status(thm)],[3,5]) ).

thf(7,plain,
    $false,
    inference(pattern_uni,[status(thm)],[6:[bind(A,$thf( y @ I )),bind(B,$thf( y @ ( y @ I ) )),bind(C,$thf( I )),bind(D,$thf( y @ ( y @ I ) ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN339-1 : TPTP v8.1.2. Released v1.2.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n017.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 19:06:01 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.86/0.82  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/0.91  % [INFO] 	 Parsing done (93ms). 
% 1.22/0.92  % [INFO] 	 Running in sequential loop mode. 
% 1.53/1.10  % [INFO] 	 eprover registered as external prover. 
% 1.53/1.11  % [INFO] 	 cvc4 registered as external prover. 
% 1.53/1.11  % [INFO] 	 Scanning for conjecture ... 
% 1.53/1.15  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.53/1.17  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.53/1.17  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.53/1.17  % [INFO] 	 Type checking passed. 
% 1.53/1.17  % [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: 909ms (effective reasoning time: 504ms)
% 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/sandbox2/benchmark/theBenchmark.p : 909 ms resp. 504 ms w/o parsing
% 2.39/1.44  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.39/1.44  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------