↑ 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  : SEU674^2 : TPTP v9.3.1. Released v3.7.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 : n006.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:59 AM UTC 2026

% Result   : Theorem 2.74s 1.78s
% Output   : Refutation 2.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   10 (   8 unt;   0 typ;   6 def)
%            Number of atoms       :   34 (   7 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   78 (   2   ~;   0   |;   2   &;  65   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;   4 con; 0-4 aty)
%            Number of variables   :   30 (  16   ^;  13   !;   1   ?;  30   :)

% 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(dsetconstr_decl,type,
    dsetconstr: $i > ( $i > $o ) > $i ).

thf(subset_decl,type,
    subset: $i > $i > $o ).

thf(kpair_decl,type,
    kpair: $i > $i > $i ).

thf(cartprod_decl,type,
    cartprod: $i > $i > $i ).

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

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

thf(breln_decl,type,
    breln: $i > $i > $i > $o ).

thf(func_decl,type,
    func: $i > $i > $i > $o ).

thf(apProp_decl,type,
    apProp: $o ).

thf(ap_decl,type,
    ap: $i > $i > $i > $i > $i ).

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(breln_def,definition,
    ( breln
    = ( ^ [A: $i,B: $i,C: $i] : ( subset @ C @ ( cartprod @ A @ B ) ) ) ) ).

thf(func_def,definition,
    ( func
    = ( ^ [A: $i,B: $i,C: $i] :
          ( ( breln @ A @ B @ C )
          & ! [D: $i] :
              ( ( in @ D @ A )
             => ( ex1 @ B
                @ ^ [E: $i] : ( in @ ( kpair @ D @ E ) @ C ) ) ) ) ) ) ).

thf(apProp_def,definition,
    ( apProp
    = ( ! [A: $i,B: $i,C: $i] :
          ( ( func @ A @ B @ C )
         => ! [D: $i] :
              ( ( in @ D @ A )
             => ( in
                @ ( setunion
                  @ ( dsetconstr @ B
                    @ ^ [E: $i] : ( in @ ( kpair @ D @ E ) @ C ) ) )
                @ B ) ) ) ) ) ).

thf(ap_def,definition,
    ( ap
    = ( ^ [A: $i,B: $i,C: $i,D: $i] :
          ( setunion
          @ ( dsetconstr @ B
            @ ^ [E: $i] : ( in @ ( kpair @ D @ E ) @ C ) ) ) ) ) ).

thf(1,conjecture,
    ( apProp
   => ! [A: $i,B: $i,C: $i] :
        ( ( func @ A @ B @ C )
       => ! [D: $i] :
            ( ( in @ D @ A )
           => ( in @ ( ap @ A @ B @ C @ D ) @ B ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',app) ).

thf(2,negated_conjecture,
    ~ ( apProp
     => ! [A: $i,B: $i,C: $i] :
          ( ( func @ A @ B @ C )
         => ! [D: $i] :
              ( ( in @ D @ A )
             => ( in @ ( ap @ A @ B @ C @ D ) @ B ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    $false,
    inference(simp,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU674^2 : TPTP v9.3.1. Released v3.7.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.11/0.22  % Computer : n006.cluster.edu
% 0.11/0.22  % Model    : x86_64 x86_64
% 0.11/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22  % Memory   : 8046.5625MB
% 0.11/0.22  % OS       : Linux 6.8.0-71-generic
% 0.11/0.22  % CPULimit : 300
% 0.11/0.22  % WCLimit  : 300
% 0.11/0.22  % DateTime : Tue Sep 29 14:06:54 UTC 2026
% 0.11/0.22  % CPUTime  : 
% 0.11/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/1.01  % [INFO] 	 Parsing done (209ms). 
% 1.24/1.02  % [INFO] 	 Running in sequential loop mode. 
% 2.16/1.44  % [INFO] 	 eprover registered as external prover. 
% 2.16/1.44  % [INFO] 	 Scanning for conjecture ... 
% 2.36/1.57  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.55/1.60  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.55/1.60  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.55/1.61  % [INFO] 	 Type checking passed. 
% 2.55/1.61  % [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 ... 
% 2.74/1.77  % [INFO] 	 Killing All external provers ... 
% 2.74/1.77  % Time passed: 1406ms (effective reasoning time: 743ms)
% 2.74/1.78  % 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)>
% 2.74/1.78  % Axioms used in derivation (0): 
% 2.74/1.78  % No. of inferences in proof: 4
% 2.74/1.78  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1406 ms resp. 743 ms w/o parsing
% 2.94/1.84  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.94/1.84  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------