TSTP Solution File: SEU641^2 by Leo-III-SAT---1.7.12

View Problem - Process Solution

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

% Computer : n004.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 : Tue May 21 03:43:07 EDT 2024

% Result   : Theorem 3.39s 2.08s
% Output   : Refutation 3.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   25 (  10 unt;   7 typ;   2 def)
%            Number of atoms       :   40 (  21 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   97 (   9   ~;   5   |;   0   &;  72   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^  26   !;   0   ?;  26   :)

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

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

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

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

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

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

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

thf(sk1_type,type,
    sk1: $i ).

thf(sk2_type,type,
    sk2: $i ).

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

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

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

thf(5,plain,
    ( ( setadjoin @ sk1 @ emptyset )
    = ( setadjoin @ sk2 @ emptyset ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    ( ( setadjoin @ sk2 @ emptyset )
    = ( setadjoin @ sk1 @ emptyset ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(7,plain,
    ! [B: $i,A: $i] : ( in @ A @ ( setadjoin @ A @ B ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ( in @ A @ ( setadjoin @ sk1 @ emptyset ) )
      | ( ( setadjoin @ sk2 @ emptyset )
       != ( setadjoin @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[9,7]) ).

thf(13,plain,
    in @ sk2 @ ( setadjoin @ sk1 @ emptyset ),
    inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( sk2 )),bind(B,$thf( emptyset ))]]) ).

thf(6,plain,
    ! [B: $i,A: $i] :
      ( ~ ( in @ A @ ( setadjoin @ B @ emptyset ) )
      | ( A = B ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ~ ( in @ A @ ( setadjoin @ B @ emptyset ) ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ~ ( in @ A @ ( setadjoin @ B @ emptyset ) ) ),
    inference(simp,[status(thm)],[10]) ).

thf(48,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( ( in @ sk2 @ ( setadjoin @ sk1 @ emptyset ) )
       != ( in @ A @ ( setadjoin @ B @ emptyset ) ) ) ),
    inference(paramod_ordered,[status(thm)],[13,11]) ).

thf(49,plain,
    sk2 = sk1,
    inference(pattern_uni,[status(thm)],[48:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 ))]]) ).

thf(4,plain,
    sk1 != sk2,
    inference(cnf,[status(esa)],[3]) ).

thf(8,plain,
    sk2 != sk1,
    inference(lifteq,[status(thm)],[4]) ).

thf(83,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[49,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem  : SEU641^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.17  % Command  : run_Leo-III %s %d
% 0.16/0.39  % Computer : n004.cluster.edu
% 0.16/0.39  % Model    : x86_64 x86_64
% 0.16/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39  % Memory   : 8042.1875MB
% 0.16/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit : 300
% 0.16/0.39  % WCLimit  : 300
% 0.16/0.39  % DateTime : Sun May 19 18:15:24 EDT 2024
% 0.16/0.39  % CPUTime  : 
% 0.99/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/1.12  % [INFO] 	 Parsing done (114ms). 
% 1.26/1.13  % [INFO] 	 Running in sequential loop mode. 
% 1.68/1.38  % [INFO] 	 nitpick registered as external prover. 
% 1.68/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.00/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.00/1.49  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.00/1.49  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.00/1.49  % [INFO] 	 Type checking passed. 
% 2.00/1.49  % [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.39/2.08  % [INFO] 	 Killing All external provers ... 
% 3.39/2.08  % Time passed: 1539ms (effective reasoning time: 940ms)
% 3.39/2.08  % 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.39/2.08  % Axioms used in derivation (0): 
% 3.39/2.08  % No. of inferences in proof: 16
% 3.39/2.08  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1539 ms resp. 940 ms w/o parsing
% 3.45/2.13  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.45/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------