%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN083-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n025.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:27:15 EDT 2023

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

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

thf(a_type,type,
    a: $i ).

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

thf(c_type,type,
    c: $i ).

thf(d_type,type,
    d: $i ).

thf(1,negated_conjecture,
    ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
   != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

thf(3,plain,
    ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
   != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN083-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n025.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:38:19 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.96/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.97  % [INFO] 	 Parsing done (107ms). 
% 1.16/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.63/1.19  % [INFO] 	 eprover registered as external prover. 
% 1.63/1.19  % [INFO] 	 cvc4 registered as external prover. 
% 1.63/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.25  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.86/1.27  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.86/1.27  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.86/1.27  % [INFO] 	 Type checking passed. 
% 1.86/1.28  % [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.64/1.62  % External prover 'e' found a proof!
% 2.64/1.62  % [INFO] 	 Killing All external provers ... 
% 2.64/1.62  % Time passed: 1087ms (effective reasoning time: 638ms)
% 2.64/1.62  % 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.64/1.62  % Axioms used in derivation (1): f_is_associative
% 2.64/1.62  % No. of inferences in proof: 5
% 2.64/1.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1087 ms resp. 638 ms w/o parsing
% 2.64/1.64  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.64  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------