%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN986+1.000 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n012.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:10 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(r_type,type,
    r: $i > $i > $i > $o ).

thf(zero_type,type,
    zero: $i ).

thf(succ_type,type,
    succ: $i > $i ).

thf(3,axiom,
    ! [A: $i] : ( r @ A @ zero @ ( succ @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp1) ).

thf(7,plain,
    ! [A: $i] : ( r @ A @ zero @ ( succ @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,plain,
    ! [A: $i] : ( r @ A @ zero @ ( succ @ A ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(1,conjecture,
    ? [A: $i] : ( r @ zero @ zero @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] : ( r @ zero @ zero @ A ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(5,plain,
    ~ ? [A: $i] : ( r @ zero @ zero @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ! [A: $i] :
      ~ ( r @ zero @ zero @ A ),
    inference(cnf,[status(esa)],[5]) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ( r @ A @ zero @ ( succ @ A ) )
     != ( r @ zero @ zero @ B ) ),
    inference(paramod_ordered,[status(thm)],[8,6]) ).

thf(13,plain,
    $false,
    inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( zero )),bind(B,$thf( succ @ zero ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN986+1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n012.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May 18 19:48:17 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.85/0.84  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.25/0.95  % [INFO] 	 Parsing done (110ms). 
% 1.25/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.53/1.15  % [INFO] 	 eprover registered as external prover. 
% 1.53/1.15  % [INFO] 	 cvc4 registered as external prover. 
% 1.53/1.16  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.20  % [INFO] 	 Found a conjecture and 2 axioms. Running axiom selection ... 
% 1.80/1.22  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 1.91/1.23  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.91/1.23  % [INFO] 	 Type checking passed. 
% 1.91/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.64/1.52  % [INFO] 	 Killing All external provers ... 
% 2.64/1.52  % Time passed: 1004ms (effective reasoning time: 558ms)
% 2.64/1.52  % 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.52  % Axioms used in derivation (1): hyp1
% 2.64/1.52  % No. of inferences in proof: 9
% 2.64/1.52  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1004 ms resp. 558 ms w/o parsing
% 2.73/1.57  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.73/1.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------