↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : SYO288^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:45:32 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(cB_decl,type,
    cB: $i > $i > $o ).

thf(cA_decl,type,
    cA: $i > $o ).

thf(c0_decl,type,
    c0: $i ).

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

thf(sk1_def,definition,
    ( sk1
    = ( ^ [A: $i > $i > $o] :
        @+[B: $i] :
          ( ( A @ B @ c0 )
         != ( ( cA @ B )
            & ( cB @ B @ B ) ) ) ) ) ).

thf(1,conjecture,
    ? [A: $i > $i > $o] :
    ! [B: $i] :
      ( ( A @ B @ c0 )
      = ( ( cA @ B )
        & ( cB @ B @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSV10) ).

thf(2,negated_conjecture,
    ~ ? [A: $i > $i > $o] :
      ! [B: $i] :
        ( ( A @ B @ c0 )
        = ( ( cA @ B )
          & ( cB @ B @ B ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(4,plain,
    ! [A: $i > $i > $o] :
      ( ( A @ ( sk1 @ A ) @ c0 )
     != ( ( cA @ ( sk1 @ A ) )
        & ( cB @ ( sk1 @ A ) @ ( sk1 @ A ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i > $i > $o] :
      ( ( A @ ( sk1 @ A ) @ c0 )
     != ( ( cA @ ( sk1 @ A ) )
        & ( cB @ ( sk1 @ A ) @ ( sk1 @ A ) ) ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    $false,
    inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : ^ [C: $i] : ( ( cA @ B ) & ( cB @ B @ B ) ) ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO288^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.10/0.21  % Computer : n026.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 16:45:57 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/0.22  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.89/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.24/0.98  % [INFO] 	 Parsing done (182ms). 
% 1.24/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.84/1.39  % [INFO] 	 eprover registered as external prover. 
% 2.03/1.40  % [INFO] 	 Scanning for conjecture ... 
% 2.03/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.21/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.21/1.53  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.21/1.53  % [INFO] 	 Type checking passed. 
% 2.21/1.54  % [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.69/2.18  % [INFO] 	 Killing All external provers ... 
% 3.69/2.19  % Time passed: 1831ms (effective reasoning time: 1188ms)
% 3.69/2.19  % 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.69/2.19  % Axioms used in derivation (0): 
% 3.69/2.19  % No. of inferences in proof: 6
% 3.69/2.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1831 ms resp. 1188 ms w/o parsing
% 3.80/2.24  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.80/2.24  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------