TSTP Solution File: SWV217+1 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : SWV217+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n014.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  7 10:57:29 EDT 2024

% Result   : Theorem 7.18s 3.03s
% Output   : Refutation 7.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   31 (  11 unt;  14 typ;   0 def)
%            Number of atoms       :  191 ( 178 equ;   0 cnn)
%            Maximal formula atoms :   58 (  11 avg)
%            Number of connectives :  300 (  84   ~;   3   |; 165   &;  42   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   33 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;  11 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(leq_type,type,
    leq: $i > $i > $o ).

thf(n0_type,type,
    n0: $i ).

thf(n5_type,type,
    n5: $i ).

thf(n4_type,type,
    n4: $i ).

thf(n3_type,type,
    n3: $i ).

thf(n1_type,type,
    n1: $i ).

thf(n2_type,type,
    n2: $i ).

thf(times_type,type,
    times: $i > $i > $i ).

thf(divide_type,type,
    divide: $i > $i > $i ).

thf(n400_type,type,
    n400: $i ).

thf(a_select2_type,type,
    a_select2: $i > $i > $i ).

thf(sigma_type,type,
    sigma: $i ).

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

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

thf(1,conjecture,
    ! [A: $i,B: $i] :
      ( ( ( leq @ n0 @ A )
        & ( leq @ n0 @ B )
        & ( leq @ A @ n5 )
        & ( leq @ B @ n5 ) )
     => ( ( ~ ( ( n0 = A )
              & ( n4 = B ) )
          & ~ ( ( n0 = A )
              & ( n5 = B ) )
          & ~ ( ( n0 = B )
              & ( n3 = A ) )
          & ~ ( ( n0 = B )
              & ( n4 = A ) )
          & ~ ( ( n0 = B )
              & ( n5 = A ) )
          & ~ ( ( n1 = A )
              & ( n4 = B ) )
          & ~ ( ( n1 = A )
              & ( n5 = B ) )
          & ~ ( ( n1 = B )
              & ( n3 = A ) )
          & ~ ( ( n1 = B )
              & ( n4 = A ) )
          & ~ ( ( n1 = B )
              & ( n5 = A ) )
          & ~ ( ( n2 = A )
              & ( n3 = B ) )
          & ~ ( ( n2 = A )
              & ( n4 = B ) )
          & ~ ( ( n2 = A )
              & ( n5 = B ) )
          & ~ ( ( n2 = B )
              & ( n3 = A ) )
          & ~ ( ( n2 = B )
              & ( n4 = A ) )
          & ~ ( ( n2 = B )
              & ( n5 = A ) )
          & ~ ( ( n3 = A )
              & ( n3 = B ) )
          & ~ ( ( n3 = A )
              & ( n4 = B ) )
          & ~ ( ( n3 = A )
              & ( n5 = B ) )
          & ~ ( ( n3 = B )
              & ( n4 = A ) )
          & ~ ( ( n3 = B )
              & ( n5 = A ) )
          & ~ ( ( n4 = A )
              & ( n4 = B ) )
          & ~ ( ( n4 = A )
              & ( n5 = B ) )
          & ~ ( ( n4 = B )
              & ( n5 = A ) )
          & ~ ( ( n5 = A )
              & ( n5 = B ) )
          & ( n2 = A )
          & ( n2 = B )
          & ( n3 = B ) )
       => ( ( times @ ( divide @ n1 @ n400 ) @ ( a_select2 @ sigma @ n2 ) )
          = n0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0241) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i] :
        ( ( ( leq @ n0 @ A )
          & ( leq @ n0 @ B )
          & ( leq @ A @ n5 )
          & ( leq @ B @ n5 ) )
       => ( ( ~ ( ( n0 = A )
                & ( n4 = B ) )
            & ~ ( ( n0 = A )
                & ( n5 = B ) )
            & ~ ( ( n0 = B )
                & ( n3 = A ) )
            & ~ ( ( n0 = B )
                & ( n4 = A ) )
            & ~ ( ( n0 = B )
                & ( n5 = A ) )
            & ~ ( ( n1 = A )
                & ( n4 = B ) )
            & ~ ( ( n1 = A )
                & ( n5 = B ) )
            & ~ ( ( n1 = B )
                & ( n3 = A ) )
            & ~ ( ( n1 = B )
                & ( n4 = A ) )
            & ~ ( ( n1 = B )
                & ( n5 = A ) )
            & ~ ( ( n2 = A )
                & ( n3 = B ) )
            & ~ ( ( n2 = A )
                & ( n4 = B ) )
            & ~ ( ( n2 = A )
                & ( n5 = B ) )
            & ~ ( ( n2 = B )
                & ( n3 = A ) )
            & ~ ( ( n2 = B )
                & ( n4 = A ) )
            & ~ ( ( n2 = B )
                & ( n5 = A ) )
            & ~ ( ( n3 = A )
                & ( n3 = B ) )
            & ~ ( ( n3 = A )
                & ( n4 = B ) )
            & ~ ( ( n3 = A )
                & ( n5 = B ) )
            & ~ ( ( n3 = B )
                & ( n4 = A ) )
            & ~ ( ( n3 = B )
                & ( n5 = A ) )
            & ~ ( ( n4 = A )
                & ( n4 = B ) )
            & ~ ( ( n4 = A )
                & ( n5 = B ) )
            & ~ ( ( n4 = B )
                & ( n5 = A ) )
            & ~ ( ( n5 = A )
                & ( n5 = B ) )
            & ( n2 = A )
            & ( n2 = B )
            & ( n3 = B ) )
         => ( ( times @ ( divide @ n1 @ n400 ) @ ( a_select2 @ sigma @ n2 ) )
            = n0 ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ ! [A: $i,B: $i] :
        ( ( ( leq @ n0 @ A )
          & ( leq @ n0 @ B )
          & ( leq @ A @ n5 )
          & ( leq @ B @ n5 ) )
       => ( ( ~ ( ( n0 = A )
                & ( n4 = B ) )
            & ~ ( ( n0 = A )
                & ( n5 = B ) )
            & ~ ( ( n0 = B )
                & ( n3 = A ) )
            & ~ ( ( n0 = B )
                & ( n4 = A ) )
            & ~ ( ( n0 = B )
                & ( n5 = A ) )
            & ~ ( ( n1 = A )
                & ( n4 = B ) )
            & ~ ( ( n1 = A )
                & ( n5 = B ) )
            & ~ ( ( n1 = B )
                & ( n3 = A ) )
            & ~ ( ( n1 = B )
                & ( n4 = A ) )
            & ~ ( ( n1 = B )
                & ( n5 = A ) )
            & ~ ( ( n2 = A )
                & ( n3 = B ) )
            & ~ ( ( n2 = A )
                & ( n4 = B ) )
            & ~ ( ( n2 = A )
                & ( n5 = B ) )
            & ~ ( ( n2 = B )
                & ( n3 = A ) )
            & ~ ( ( n2 = B )
                & ( n4 = A ) )
            & ~ ( ( n2 = B )
                & ( n5 = A ) )
            & ~ ( ( n3 = A )
                & ( n3 = B ) )
            & ~ ( ( n3 = A )
                & ( n4 = B ) )
            & ~ ( ( n3 = A )
                & ( n5 = B ) )
            & ~ ( ( n3 = B )
                & ( n4 = A ) )
            & ~ ( ( n3 = B )
                & ( n5 = A ) )
            & ~ ( ( n4 = A )
                & ( n4 = B ) )
            & ~ ( ( n4 = A )
                & ( n5 = B ) )
            & ~ ( ( n4 = B )
                & ( n5 = A ) )
            & ~ ( ( n5 = A )
                & ( n5 = B ) )
            & ( n2 = A )
            & ( n2 = B )
            & ( n3 = B ) )
         => ( ( times @ ( divide @ n1 @ n400 ) @ ( a_select2 @ sigma @ n2 ) )
            = n0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(118,plain,
    n2 = sk2,
    inference(cnf,[status(esa)],[92]) ).

thf(131,plain,
    sk2 = n2,
    inference(lifteq,[status(thm)],[118]) ).

thf(107,plain,
    n3 = sk2,
    inference(cnf,[status(esa)],[92]) ).

thf(150,plain,
    sk2 = n3,
    inference(lifteq,[status(thm)],[107]) ).

thf(602,plain,
    n2 = n3,
    inference(rewrite,[status(thm)],[150,131]) ).

thf(604,plain,
    sk2 = n3,
    inference(rewrite,[status(thm)],[131,602]) ).

thf(101,plain,
    ( ( n2 != sk2 )
    | ( n3 != sk1 ) ),
    inference(cnf,[status(esa)],[92]) ).

thf(126,plain,
    ( ( sk2 != n2 )
    | ( sk1 != n3 ) ),
    inference(lifteq,[status(thm)],[101]) ).

thf(116,plain,
    n2 = sk1,
    inference(cnf,[status(esa)],[92]) ).

thf(128,plain,
    sk1 = n2,
    inference(lifteq,[status(thm)],[116]) ).

thf(603,plain,
    sk1 = n3,
    inference(rewrite,[status(thm)],[128,602]) ).

thf(605,plain,
    ( ( sk2 != n3 )
    | ( n3 != n3 ) ),
    inference(rewrite,[status(thm)],[126,602,603]) ).

thf(606,plain,
    sk2 != n3,
    inference(simp,[status(thm)],[605]) ).

thf(609,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[604,606]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SWV217+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.14  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue May  7 00:31:24 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.93/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.27/1.08  % [INFO] 	 Parsing done (214ms). 
% 1.27/1.09  % [INFO] 	 Running in sequential loop mode. 
% 1.81/1.38  % [INFO] 	 nitpick registered as external prover. 
% 1.99/1.38  % [INFO] 	 Scanning for conjecture ... 
% 2.30/1.55  % [INFO] 	 Found a conjecture and 91 axioms. Running axiom selection ... 
% 2.46/1.65  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2 axioms). 
% 2.87/1.76  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.87/1.77  % [INFO] 	 Type checking passed. 
% 2.87/1.77  % [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 ... 
% 7.18/3.03  % [INFO] 	 Killing All external provers ... 
% 7.18/3.03  % Time passed: 2555ms (effective reasoning time: 1933ms)
% 7.18/3.03  % 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)>
% 7.18/3.03  % Axioms used in derivation (0): 
% 7.18/3.03  % No. of inferences in proof: 17
% 7.18/3.03  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2555 ms resp. 1933 ms w/o parsing
% 7.18/3.07  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.18/3.07  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------