↑ 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  : SEU638^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n007.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:28:52 AM UTC 2026

% Result   : Theorem 3.36s 2.15s
% Output   : Refutation 3.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :    8 (   5 unt;   0 typ;   4 def)
%            Number of atoms       :   29 (   6 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   70 (   2   ~;   0   |;   5   &;  50   @)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (   3   ^;  18   !;   5   ?;  26   :)

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

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

thf(setadjoin_decl,type,
    setadjoin: $i > $i > $i ).

thf(dsetconstr_decl,type,
    dsetconstr: $i > ( $i > $o ) > $i ).

thf(dsetconstrEL_decl,type,
    dsetconstrEL: $o ).

thf(dsetconstrER_decl,type,
    dsetconstrER: $o ).

thf(singleton_decl,type,
    singleton: $i > $o ).

thf(ex1_decl,type,
    ex1: $i > ( $i > $o ) > $o ).

thf(dsetconstrEL_def,definition,
    ( dsetconstrEL
    = ( ! [A: $i,B: $i > $o,C: $i] :
          ( ( in @ C @ ( dsetconstr @ A @ B ) )
         => ( in @ C @ A ) ) ) ) ).

thf(dsetconstrER_def,definition,
    ( dsetconstrER
    = ( ! [A: $i,B: $i > $o,C: $i] :
          ( ( in @ C @ ( dsetconstr @ A @ B ) )
         => ( B @ C ) ) ) ) ).

thf(singleton_def,definition,
    ( singleton
    = ( ^ [A: $i] :
        ? [B: $i] :
          ( ( in @ B @ A )
          & ( A
            = ( setadjoin @ B @ emptyset ) ) ) ) ) ).

thf(ex1_def,definition,
    ( ex1
    = ( ^ [A: $i,B: $i > $o] : ( singleton @ ( dsetconstr @ A @ B ) ) ) ) ).

thf(1,conjecture,
    ( dsetconstrEL
   => ( dsetconstrER
     => ! [A: $i,B: $i > $o] :
          ( ( ex1 @ A @ B )
         => ? [C: $i] :
              ( ( in @ C @ A )
              & ( B @ C ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1E1) ).

thf(2,negated_conjecture,
    ~ ( dsetconstrEL
     => ( dsetconstrER
       => ! [A: $i,B: $i > $o] :
            ( ( ex1 @ A @ B )
           => ? [C: $i] :
                ( ( in @ C @ A )
                & ( B @ C ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i,B: $i > $o,C: $i] :
          ( ( in @ C @ ( dsetconstr @ A @ B ) )
         => ( in @ C @ A ) )
     => ( ! [A: $i,B: $i > $o,C: $i] :
            ( ( in @ C @ ( dsetconstr @ A @ B ) )
           => ( B @ C ) )
       => ! [A: $i,B: $i > $o] :
            ( ? [C: $i] :
                ( ( in @ C @ ( dsetconstr @ A @ B ) )
                & ( ( dsetconstr @ A @ B )
                  = ( setadjoin @ C @ emptyset ) ) )
           => ? [C: $i] :
                ( ( in @ C @ A )
                & ( B @ C ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU638^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.09/0.22  % Computer : n007.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 13:58:55 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.98/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/1.01  % [INFO] 	 Parsing done (196ms). 
% 1.14/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.92/1.42  % [INFO] 	 eprover registered as external prover. 
% 1.92/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.09/1.54  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.09/1.58  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.09/1.58  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.09/1.58  % [INFO] 	 Type checking passed. 
% 2.09/1.59  % [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.36/2.15  % External prover 'e' found a proof!
% 3.36/2.15  % [INFO] 	 Killing All external provers ... 
% 3.36/2.15  % Time passed: 1779ms (effective reasoning time: 1117ms)
% 3.36/2.15  % 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.36/2.15  % Axioms used in derivation (0): 
% 3.36/2.15  % No. of inferences in proof: 4
% 3.36/2.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1779 ms resp. 1117 ms w/o parsing
% 3.36/2.19  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.36/2.19  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------