↑ 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  : SEU649^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 : n005.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:54 AM UTC 2026

% Result   : Theorem 4.76s 2.71s
% Output   : Refutation 4.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of formulae    :    9 (   6 unt;   0 typ;   5 def)
%            Number of atoms       :   53 (  21 equ;   0 cnn)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :  106 (   2   ~;   2   |;   0   &;  70   @)
%                                         (   0 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^;  32   !;   0   ?;  32   :)

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

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

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

thf(setext_decl,type,
    setext: $o ).

thf(setadjoinIL_decl,type,
    setadjoinIL: $o ).

thf(uniqinunit_decl,type,
    uniqinunit: $o ).

thf(eqinunit_decl,type,
    eqinunit: $o ).

thf(upairset2E_decl,type,
    upairset2E: $o ).

thf(setext_def,definition,
    ( setext
    = ( ! [A: $i,B: $i] :
          ( ! [C: $i] :
              ( ( in @ C @ A )
             => ( in @ C @ B ) )
         => ( ! [C: $i] :
                ( ( in @ C @ B )
               => ( in @ C @ A ) )
           => ( A = B ) ) ) ) ) ).

thf(setadjoinIL_def,definition,
    ( setadjoinIL
    = ( ! [A: $i,B: $i] : ( in @ A @ ( setadjoin @ A @ B ) ) ) ) ).

thf(uniqinunit_def,definition,
    ( uniqinunit
    = ( ! [A: $i,B: $i] :
          ( ( in @ A @ ( setadjoin @ B @ emptyset ) )
         => ( A = B ) ) ) ) ).

thf(eqinunit_def,definition,
    ( eqinunit
    = ( ! [A: $i,B: $i] :
          ( ( A = B )
         => ( in @ A @ ( setadjoin @ B @ emptyset ) ) ) ) ) ).

thf(upairset2E_def,definition,
    ( upairset2E
    = ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) )
         => ( ( C = A )
            | ( C = B ) ) ) ) ) ).

thf(1,conjecture,
    ( setext
   => ( setadjoinIL
     => ( uniqinunit
       => ( eqinunit
         => ( upairset2E
           => ! [A: $i,B: $i] :
                ( ( A = B )
               => ( ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) )
                  = ( setadjoin @ A @ emptyset ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjR11) ).

thf(2,negated_conjecture,
    ~ ( setext
     => ( setadjoinIL
       => ( uniqinunit
         => ( eqinunit
           => ( upairset2E
             => ! [A: $i,B: $i] :
                  ( ( A = B )
                 => ( ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) )
                    = ( setadjoin @ A @ emptyset ) ) ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU649^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.10  % 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.10/0.25  % Computer : n005.cluster.edu
% 0.10/0.25  % Model    : x86_64 x86_64
% 0.10/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25  % Memory   : 8046.5625MB
% 0.10/0.25  % OS       : Linux 6.8.0-71-generic
% 0.10/0.25  % CPULimit : 300
% 0.10/0.25  % WCLimit  : 300
% 0.10/0.25  % DateTime : Tue Sep 29 14:02:16 UTC 2026
% 0.10/0.25  % CPUTime  : 
% 0.10/0.26  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
% 1.13/1.03  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.73/1.22  % [INFO] 	 Parsing done (184ms). 
% 1.73/1.23  % [INFO] 	 Running in sequential loop mode. 
% 2.34/1.67  % [INFO] 	 eprover registered as external prover. 
% 2.34/1.68  % [INFO] 	 Scanning for conjecture ... 
% 2.79/1.82  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.79/1.87  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.79/1.88  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.79/1.88  % [INFO] 	 Type checking passed. 
% 2.79/1.89  % [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 ... 
% 4.76/2.71  % External prover 'e' found a proof!
% 4.76/2.71  % [INFO] 	 Killing All external provers ... 
% 4.76/2.71  % Time passed: 2240ms (effective reasoning time: 1471ms)
% 4.76/2.71  % 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)>
% 4.76/2.71  % Axioms used in derivation (0): 
% 4.76/2.71  % No. of inferences in proof: 4
% 4.76/2.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2240 ms resp. 1471 ms w/o parsing
% 4.76/2.78  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.76/2.78  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------