↑ 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  : SEU801^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 : n020.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:29:21 AM UTC 2026

% Result   : Theorem 4.27s 2.29s
% Output   : Refutation 4.59s
% 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       :   25 (   5 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   74 (   2   ~;   0   |;   2   &;  60   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   2 con; 0-4 aty)
%            Number of variables   :   25 (   6   ^;  17   !;   2   ?;  25   :)

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

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

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

thf(funcSet_decl,type,
    funcSet: $i > $i > $i ).

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

thf(surjective_decl,type,
    surjective: $i > $i > $i > $o ).

thf(surjFuncSet_decl,type,
    surjFuncSet: $i > $i > $i ).

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

thf(surjective_def,definition,
    ( surjective
    = ( ^ [A: $i,B: $i,C: $i] :
        ! [D: $i] :
          ( ( in @ D @ B )
         => ? [E: $i] :
              ( ( in @ E @ A )
              & ( ( ap @ A @ B @ C @ E )
                = D ) ) ) ) ) ).

thf(surjFuncSet_def,definition,
    ( surjFuncSet
    = ( ^ [A: $i,B: $i] : ( dsetconstr @ ( funcSet @ A @ B ) @ ( surjective @ A @ B ) ) ) ) ).

thf(1,conjecture,
    ( dsetconstrEL
   => ! [A: $i,B: $i,C: $i] :
        ( ( in @ C @ ( surjFuncSet @ A @ B ) )
       => ( in @ C @ ( funcSet @ A @ B ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',surjFuncSetFuncIn) ).

thf(2,negated_conjecture,
    ~ ( dsetconstrEL
     => ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ ( surjFuncSet @ A @ B ) )
         => ( in @ C @ ( funcSet @ A @ B ) ) ) ),
    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,C: $i] :
          ( ( in @ C
            @ ( dsetconstr @ ( funcSet @ A @ B )
              @ ^ [D: $i] :
                ! [E: $i] :
                  ( ( in @ E @ B )
                 => ? [F: $i] :
                      ( ( in @ F @ A )
                      & ( ( ap @ A @ B @ D @ F )
                        = E ) ) ) ) )
         => ( in @ C @ ( funcSet @ A @ B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU801^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.08/0.18  % Computer : n020.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 14:33:04 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  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.90/0.76  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.25/0.95  % [INFO] 	 Parsing done (194ms). 
% 1.25/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.92/1.37  % [INFO] 	 eprover registered as external prover. 
% 1.92/1.38  % [INFO] 	 Scanning for conjecture ... 
% 2.30/1.50  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.30/1.53  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.30/1.54  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.30/1.54  % [INFO] 	 Type checking passed. 
% 2.30/1.54  % [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.27/2.28  % External prover 'e' found a proof!
% 4.27/2.28  % [INFO] 	 Killing All external provers ... 
% 4.27/2.28  % Time passed: 1959ms (effective reasoning time: 1310ms)
% 4.27/2.28  % 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.27/2.29  % Axioms used in derivation (0): 
% 4.27/2.29  % No. of inferences in proof: 4
% 4.27/2.29  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1959 ms resp. 1310 ms w/o parsing
% 4.59/2.33  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.59/2.33  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------