↑ 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  : SEU502_8 : TPTP v9.3.1. Released v8.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 : n011.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 : Sun Sep 27 08:39:08 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(in_decl,type,
    in: $i > $i > $o ).

thf(emptyset_decl,type,
    emptyset: $i ).

thf(emptysetE_decl,type,
    emptysetE: $o ).

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

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $i] : ( emptyset @ ( A @ in ) ) ) ) ).

thf(1,conjecture,
    ( emptysetE
   => ! [A: $i] :
        ( ( emptyset @ ( A @ in ) )
       => $false ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetimpfalse) ).

thf(2,negated_conjecture,
    ~ ( emptysetE
     => ! [A: $i] :
          ( ( emptyset @ ( A @ in ) )
         => $false ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ( emptysetE
     => ! [A: $i] :
          ~ ( emptyset @ ( A @ in ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ~ ( emptysetE
     => ~ ? [A: $i] : ( emptyset @ ( A @ in ) ) ),
    inference(miniscope,[status(thm)],[4]) ).

thf(6,plain,
    ( ( emptyset @ ( sk1 @ in ) )
    & emptysetE ),
    inference(cnf,[status(esa)],[5]) ).

thf(8,plain,
    emptyset @ ( sk1 @ in ),
    inference(cnfConj,[status(thm)],[6]) ).

thf(3,axiom,
    ( emptysetE
    = ( ! [A: $i] :
          ( ( emptyset @ ( A @ in ) )
         => ! [B: $o] : B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE) ).

thf(9,plain,
    ( emptysetE
    = ( ! [A: $i] :
          ( ( emptyset @ ( A @ in ) )
         => ! [B: $o] : B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(10,plain,
    ( emptysetE
    = ( ! [A: $i] :
          ( ( emptyset @ ( A @ in ) )
         => ! [B: $o] : B ) ) ),
    inference(lifteq,[status(thm)],[9]) ).

thf(7,plain,
    emptysetE,
    inference(cnfConj,[status(thm)],[6]) ).

thf(11,plain,
    ! [A: $i] :
      ( ( emptyset @ ( A @ in ) )
     => ! [B: $o] : B ),
    inference(rewrite,[status(thm)],[10,7]) ).

thf(12,plain,
    ! [B: $o,A: $i] :
      ( B
      | ~ ( emptyset @ ( A @ in ) ) ),
    inference(cnf,[status(esa)],[11]) ).

thf(24,plain,
    ! [A: $i] :
      ( $false
      | ~ ( emptyset @ ( A @ in ) ) ),
    inference(prim_subst,[status(thm)],[12:[bind(A,$thf( A )),bind(B,$thf( $false ))]]) ).

thf(34,plain,
    ! [A: $i] :
      ~ ( emptyset @ ( A @ in ) ),
    inference(simp,[status(thm)],[24]) ).

thf(37,plain,
    $false,
    inference(rewrite,[status(thm)],[8,34]) ).

thf(38,plain,
    $false,
    inference(simp,[status(thm)],[37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU502_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07  % 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.15/0.40  % Computer : n011.cluster.edu
% 0.15/0.40  % Model    : x86_64 x86_64
% 0.15/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40  % Memory   : 8046.5625MB
% 0.15/0.40  % OS       : Linux 6.8.0-71-generic
% 0.15/0.40  % CPULimit : 300
% 0.15/0.40  % WCLimit  : 300
% 0.15/0.40  % DateTime : Sat Sep 26 10:06:44 UTC 2026
% 0.15/0.40  % CPUTime  : 
% 0.15/0.41  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/1.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.29/1.19  % [INFO] 	 Parsing done (182ms). 
% 1.41/1.20  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.61  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.62  % [INFO] 	 Scanning for conjecture ... 
% 2.02/1.69  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.19/1.72  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.19/1.76  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.19/1.76  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.19/1.76  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.19/1.77  % [INFO] 	 Type checking passed. 
% 2.19/1.77  % [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.74/2.46  % [INFO] 	 Killing All external provers ... 
% 3.74/2.46  % Time passed: 1910ms (effective reasoning time: 1254ms)
% 3.74/2.46  % 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.74/2.47  % Axioms used in derivation (1): emptysetE
% 3.74/2.47  % No. of inferences in proof: 16
% 3.74/2.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1910 ms resp. 1254 ms w/o parsing
% 4.07/2.51  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.07/2.51  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------