TSTP Solution File: SYN992^1 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SYN992^1 : TPTP v8.2.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n008.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 : Tue May 21 08:17:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(refl_type,type,
    refl: ( $i > $i > $o ) > $o ).

thf(refl_def,definition,
    ( refl
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i] : ( A @ B @ B ) ) ) ).

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

thf(1,conjecture,
    ? [A: $i > $i > $o] : ( refl @ A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

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

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

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

thf(5,plain,
    ( ( sk1 @ ( (=) @ $i ) )
   != ( sk1 @ ( (=) @ $i ) ) ),
    inference(replace_andrewseq,[status(thm)],[4:[bind(A,$thf( (=) @ $i ))]]) ).

thf(6,plain,
    ( ( sk1 @ ( (=) @ $i ) )
   != ( sk1 @ ( (=) @ $i ) ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(7,plain,
    $false,
    inference(simp,[status(thm)],[6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN992^1 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.13/0.16  % Command  : run_Leo-III %s %d
% 0.17/0.37  % Computer : n008.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit : 300
% 0.17/0.37  % WCLimit  : 300
% 0.17/0.37  % DateTime : Mon May 20 13:50:54 EDT 2024
% 0.17/0.37  % CPUTime  : 
% 0.94/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.20/0.95  % [INFO] 	 Parsing done (90ms). 
% 1.25/0.96  % [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.70/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.81/1.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.81/1.27  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.81/1.28  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.81/1.28  % [INFO] 	 Type checking passed. 
% 1.81/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.09/1.42  % [INFO] 	 Killing All external provers ... 
% 2.09/1.42  % Time passed: 888ms (effective reasoning time: 454ms)
% 2.09/1.42  % 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.09/1.42  % Axioms used in derivation (0): 
% 2.09/1.42  % No. of inferences in proof: 7
% 2.09/1.42  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 888 ms resp. 454 ms w/o parsing
% 2.09/1.45  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.09/1.45  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------