↑ 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  : SEU619^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 : n003.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:47 AM UTC 2026

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

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

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

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

thf(setunion_decl,type,
    setunion: $i > $i ).

thf(iskpair_decl,type,
    iskpair: $i > $o ).

thf(setukpairIL_decl,type,
    setukpairIL: $o ).

thf(setukpairIR_decl,type,
    setukpairIR: $o ).

thf(iskpair_def,definition,
    ( iskpair
    = ( ^ [A: $i] :
        ? [B: $i] :
          ( ( in @ B @ ( setunion @ A ) )
          & ? [C: $i] :
              ( ( in @ C @ ( setunion @ A ) )
              & ( A
                = ( setadjoin @ ( setadjoin @ B @ emptyset ) @ ( setadjoin @ ( setadjoin @ B @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ).

thf(setukpairIL_def,definition,
    ( setukpairIL
    = ( ! [A: $i,B: $i] : ( in @ A @ ( setunion @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ) ) ).

thf(setukpairIR_def,definition,
    ( setukpairIR
    = ( ! [A: $i,B: $i] : ( in @ B @ ( setunion @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ) ) ).

thf(1,conjecture,
    ( setukpairIL
   => ( setukpairIR
     => ! [A: $i,B: $i] : ( iskpair @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairiskpair) ).

thf(2,negated_conjecture,
    ~ ( setukpairIL
     => ( setukpairIR
       => ! [A: $i,B: $i] : ( iskpair @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU619^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07  % 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.21  % Computer : n003.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 14:00:28 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/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
% 1.18/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.42/1.08  % [INFO] 	 Parsing done (175ms). 
% 1.42/1.09  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.28  % [INFO] 	 eprover registered as external prover. 
% 1.74/1.28  % [INFO] 	 Scanning for conjecture ... 
% 1.96/1.34  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.96/1.36  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.96/1.36  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.96/1.36  % [INFO] 	 Type checking passed. 
% 1.96/1.36  % [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.24/1.76  % External prover 'e' found a proof!
% 3.24/1.76  % [INFO] 	 Killing All external provers ... 
% 3.24/1.76  % Time passed: 1399ms (effective reasoning time: 673ms)
% 3.24/1.76  % 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.24/1.76  % Axioms used in derivation (0): 
% 3.24/1.76  % No. of inferences in proof: 4
% 3.24/1.76  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1399 ms resp. 673 ms w/o parsing
% 3.24/1.78  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.24/1.78  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------