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

% Computer : n005.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 11:28:15 EDT 2023

% Result   : Unsatisfiable 3.83s 1.81s
% Output   : Refutation 3.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of formulae    :    8 (   5 unt;   3 typ;   0 def)
%            Number of atoms       :    5 (   4 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   58 (   2   ~;   0   |;   0   &;  56   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    1 (   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   :    8 (   0   ^;   8   !;   0   ?;   8   :)

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

thf(x0_type,type,
    x0: $i ).

thf(x1_type,type,
    x1: $i ).

thf(1,negated_conjecture,
    ( ( f @ x0 @ ( f @ x0 @ x0 ) )
   != ( f @ x1 @ ( f @ x1 @ x1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

thf(3,plain,
    ( ( f @ x0 @ ( f @ x0 @ x0 ) )
   != ( f @ x1 @ ( f @ x1 @ x1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( f @ ( f @ ( f @ ( f @ A @ B ) @ ( f @ B @ C ) ) @ D ) @ ( f @ B @ ( f @ ( f @ B @ ( f @ ( f @ A @ A ) @ A ) ) @ C ) ) )
      = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).

thf(6,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( f @ ( f @ ( f @ ( f @ A @ B ) @ ( f @ B @ C ) ) @ D ) @ ( f @ B @ ( f @ ( f @ B @ ( f @ ( f @ A @ A ) @ A ) ) @ C ) ) )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(47,plain,
    $false,
    inference(e,[status(thm)],[3,6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LAT394-2 : TPTP v8.1.2. Released v5.4.0.
% 0.12/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n005.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu May 18 14:19:24 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.99/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.18/0.97  % [INFO] 	 Parsing done (110ms). 
% 1.18/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.18  % [INFO] 	 eprover registered as external prover. 
% 1.67/1.18  % [INFO] 	 cvc4 registered as external prover. 
% 1.67/1.19  % [INFO] 	 Scanning for conjecture ... 
% 1.76/1.23  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.82/1.25  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.82/1.25  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.82/1.26  % [INFO] 	 Type checking passed. 
% 1.82/1.26  % [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 ... 
% 3.73/1.81  % External prover 'e' found a proof!
% 3.73/1.81  % [INFO] 	 Killing All external provers ... 
% 3.73/1.81  % Time passed: 1283ms (effective reasoning time: 828ms)
% 3.73/1.81  % 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)>
% 3.83/1.81  % Axioms used in derivation (1): sos
% 3.83/1.81  % No. of inferences in proof: 5
% 3.83/1.81  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1283 ms resp. 828 ms w/o parsing
% 3.83/1.83  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.83/1.83  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------