TSTP Solution File: SEU656^2 by Leo-III---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : SEU656^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 15:27:43 EDT 2024

% Result   : Theorem 5.70s 2.46s
% Output   : Refutation 6.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   11 (   8 unt;   0 typ;   7 def)
%            Number of atoms       :   53 (  23 equ;   0 cnn)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  262 (   2   ~;   0   |;   6   &; 231   @)
%                                         (   0 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  15 usr;   9 con; 0-2 aty)
%            Number of variables   :   42 (   8   ^  28   !;   6   ?;  42   :)

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

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

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

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

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

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

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

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

thf(kpair_def,definition,
    ( kpair
    = ( ^ [A: $i,B: $i] : ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ).

thf(kpairp_type,type,
    kpairp: $o ).

thf(kpairp_def,definition,
    ( kpairp
    = ( ! [A: $i,B: $i] : ( iskpair @ ( kpair @ A @ B ) ) ) ) ).

thf(theprop_type,type,
    theprop: $o ).

thf(theprop_def,definition,
    ( theprop
    = ( ! [A: $i] :
          ( ( singleton @ A )
         => ( in @ ( setunion @ A ) @ A ) ) ) ) ).

thf(kfst_type,type,
    kfst: $i > $i ).

thf(setukpairinjR_type,type,
    setukpairinjR: $o ).

thf(setukpairinjR_def,definition,
    ( setukpairinjR
    = ( ! [A: $i,B: $i,C: $i,D: $i] :
          ( ( ( kpair @ A @ B )
            = ( kpair @ C @ D ) )
         => ( B = D ) ) ) ) ).

thf(ksndsingleton_type,type,
    ksndsingleton: $o ).

thf(ksndsingleton_def,definition,
    ( ksndsingleton
    = ( ! [A: $i] :
          ( ( iskpair @ A )
         => ( singleton
            @ ( dsetconstr @ ( setunion @ A )
              @ ^ [B: $i] :
                  ( A
                  = ( kpair @ ( kfst @ A ) @ B ) ) ) ) ) ) ) ).

thf(ksnd_type,type,
    ksnd: $i > $i ).

thf(ksnd_def,definition,
    ( ksnd
    = ( ^ [A: $i] :
          ( setunion
          @ ( dsetconstr @ ( setunion @ A )
            @ ^ [B: $i] :
                ( A
                = ( kpair @ ( kfst @ A ) @ B ) ) ) ) ) ) ).

thf(1,conjecture,
    ( dsetconstrER
   => ( kpairp
     => ( theprop
       => ( setukpairinjR
         => ( ksndsingleton
           => ! [A: $i,B: $i] :
                ( ( ksnd @ ( kpair @ A @ B ) )
                = B ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ksndpairEq) ).

thf(2,negated_conjecture,
    ~ ( dsetconstrER
     => ( kpairp
       => ( theprop
         => ( setukpairinjR
           => ( ksndsingleton
             => ! [A: $i,B: $i] :
                  ( ( ksnd @ ( kpair @ A @ B ) )
                  = B ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i,B: $i > $o,C: $i] :
          ( ( in @ C @ ( dsetconstr @ A @ B ) )
         => ( B @ C ) )
     => ( ! [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 ) ) ) ) )
       => ( ! [A: $i] :
              ( ? [B: $i] :
                  ( ( in @ B @ A )
                  & ( A
                    = ( setadjoin @ B @ emptyset ) ) )
             => ( in @ ( setunion @ A ) @ A ) )
         => ( ! [A: $i,B: $i,C: $i,D: $i] :
                ( ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
                  = ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) )
               => ( B = D ) )
           => ( ! [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 ) ) ) ) )
                 => ? [B: $i] :
                      ( ( in @ B
                        @ ( dsetconstr @ ( setunion @ A )
                          @ ^ [C: $i] :
                              ( A
                              = ( setadjoin @ ( setadjoin @ ( kfst @ A ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( kfst @ A ) @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) ) )
                      & ( ( dsetconstr @ ( setunion @ A )
                          @ ^ [C: $i] :
                              ( A
                              = ( setadjoin @ ( setadjoin @ ( kfst @ A ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( kfst @ A ) @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) )
                        = ( setadjoin @ B @ emptyset ) ) ) )
             => ! [A: $i,B: $i] :
                  ( ( setunion
                    @ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) )
                      @ ^ [C: $i] :
                          ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
                          = ( setadjoin @ ( setadjoin @ ( kfst @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( kfst @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) ) )
                  = B ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU656^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Fri Jun 21 12:04:40 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.98/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.10/1.01  % [INFO] 	 Parsing done (126ms). 
% 1.10/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.81/1.27  % [INFO] 	 eprover registered as external prover. 
% 1.81/1.27  % [INFO] 	 Scanning for conjecture ... 
% 2.05/1.36  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.24/1.38  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.24/1.38  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.24/1.38  % [INFO] 	 Type checking passed. 
% 2.24/1.39  % [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 ... 
% 5.70/2.46  % External prover 'e' found a proof!
% 5.70/2.46  % [INFO] 	 Killing All external provers ... 
% 5.70/2.46  % Time passed: 1939ms (effective reasoning time: 1432ms)
% 5.70/2.46  % 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)>
% 5.70/2.46  % Axioms used in derivation (0): 
% 5.70/2.46  % No. of inferences in proof: 4
% 5.70/2.46  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1939 ms resp. 1432 ms w/o parsing
% 5.70/2.50  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.15/2.50  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------