TSTP Solution File: SWV215+1 by PyRes---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWV215+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% 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 : Thu May  9 17:44:26 EDT 2024

% Result   : Theorem 0.86s 1.04s
% Output   : Refutation 0.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :  381 ( 360 equ)
%            Maximal formula atoms :   75 (  38 avg)
%            Number of connectives :  642 ( 271   ~; 100   |; 267   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   45 (  22 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   4   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0161,conjecture,
    ! [A,B] :
      ( ( leq(n0,A)
        & leq(n0,B)
        & leq(A,n5)
        & leq(B,n5) )
     => ( ( ~ ( n0 = A
              & n3 = B )
          & ~ ( n0 = A
              & n4 = B )
          & ~ ( n0 = A
              & n5 = B )
          & ~ ( n0 = B
              & n1 = A )
          & ~ ( n0 = B
              & n2 = A )
          & ~ ( n0 = B
              & n3 = A )
          & ~ ( n0 = B
              & n4 = A )
          & ~ ( n0 = B
              & n5 = A )
          & ~ ( n1 = A
              & n1 = B )
          & ~ ( n1 = A
              & n2 = B )
          & ~ ( n1 = A
              & n3 = B )
          & ~ ( n1 = A
              & n4 = B )
          & ~ ( n1 = A
              & n5 = B )
          & ~ ( n1 = B
              & n2 = A )
          & ~ ( n1 = B
              & n3 = A )
          & ~ ( n1 = B
              & n4 = A )
          & ~ ( n1 = B
              & n5 = A )
          & ~ ( n2 = A
              & n2 = B )
          & ~ ( 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 )
          & n0 = A
          & n2 = A
          & n2 = B
          & n4 = B )
       => n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0161) ).

fof(c75,negated_conjecture,
    ~ ! [A,B] :
        ( ( leq(n0,A)
          & leq(n0,B)
          & leq(A,n5)
          & leq(B,n5) )
       => ( ( ~ ( n0 = A
                & n3 = B )
            & ~ ( n0 = A
                & n4 = B )
            & ~ ( n0 = A
                & n5 = B )
            & ~ ( n0 = B
                & n1 = A )
            & ~ ( n0 = B
                & n2 = A )
            & ~ ( n0 = B
                & n3 = A )
            & ~ ( n0 = B
                & n4 = A )
            & ~ ( n0 = B
                & n5 = A )
            & ~ ( n1 = A
                & n1 = B )
            & ~ ( n1 = A
                & n2 = B )
            & ~ ( n1 = A
                & n3 = B )
            & ~ ( n1 = A
                & n4 = B )
            & ~ ( n1 = A
                & n5 = B )
            & ~ ( n1 = B
                & n2 = A )
            & ~ ( n1 = B
                & n3 = A )
            & ~ ( n1 = B
                & n4 = A )
            & ~ ( n1 = B
                & n5 = A )
            & ~ ( n2 = A
                & n2 = B )
            & ~ ( 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 )
            & n0 = A
            & n2 = A
            & n2 = B
            & n4 = B )
         => n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0161]) ).

fof(c76,negated_conjecture,
    ? [A,B] :
      ( leq(n0,A)
      & leq(n0,B)
      & leq(A,n5)
      & leq(B,n5)
      & ( n0 != A
        | n3 != B )
      & ( n0 != A
        | n4 != B )
      & ( n0 != A
        | n5 != B )
      & ( n0 != B
        | n1 != A )
      & ( n0 != B
        | n2 != A )
      & ( n0 != B
        | n3 != A )
      & ( n0 != B
        | n4 != A )
      & ( n0 != B
        | n5 != A )
      & ( n1 != A
        | n1 != B )
      & ( n1 != A
        | n2 != B )
      & ( n1 != A
        | n3 != B )
      & ( n1 != A
        | n4 != B )
      & ( n1 != A
        | n5 != B )
      & ( n1 != B
        | n2 != A )
      & ( n1 != B
        | n3 != A )
      & ( n1 != B
        | n4 != A )
      & ( n1 != B
        | n5 != A )
      & ( n2 != A
        | n2 != B )
      & ( 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 )
      & n0 = A
      & n2 = A
      & n2 = B
      & n4 = B
      & n0 != times(divide(n1,n400),a_select2(sigma,n2)) ),
    inference(fof_nnf,[status(thm)],[c75]) ).

fof(c77,negated_conjecture,
    ? [X8,X9] :
      ( leq(n0,X8)
      & leq(n0,X9)
      & leq(X8,n5)
      & leq(X9,n5)
      & ( n0 != X8
        | n3 != X9 )
      & ( n0 != X8
        | n4 != X9 )
      & ( n0 != X8
        | n5 != X9 )
      & ( n0 != X9
        | n1 != X8 )
      & ( n0 != X9
        | n2 != X8 )
      & ( n0 != X9
        | n3 != X8 )
      & ( n0 != X9
        | n4 != X8 )
      & ( n0 != X9
        | n5 != X8 )
      & ( n1 != X8
        | n1 != X9 )
      & ( n1 != X8
        | n2 != X9 )
      & ( n1 != X8
        | n3 != X9 )
      & ( n1 != X8
        | n4 != X9 )
      & ( n1 != X8
        | n5 != X9 )
      & ( n1 != X9
        | n2 != X8 )
      & ( n1 != X9
        | n3 != X8 )
      & ( n1 != X9
        | n4 != X8 )
      & ( n1 != X9
        | n5 != X8 )
      & ( n2 != X8
        | n2 != X9 )
      & ( n2 != X8
        | n3 != X9 )
      & ( n2 != X8
        | n4 != X9 )
      & ( n2 != X8
        | n5 != X9 )
      & ( n2 != X9
        | n3 != X8 )
      & ( n2 != X9
        | n4 != X8 )
      & ( n2 != X9
        | n5 != X8 )
      & ( n3 != X8
        | n3 != X9 )
      & ( n3 != X8
        | n4 != X9 )
      & ( n3 != X8
        | n5 != X9 )
      & ( n3 != X9
        | n4 != X8 )
      & ( n3 != X9
        | n5 != X8 )
      & ( n4 != X8
        | n4 != X9 )
      & ( n4 != X8
        | n5 != X9 )
      & ( n4 != X9
        | n5 != X8 )
      & ( n5 != X8
        | n5 != X9 )
      & n0 = X8
      & n2 = X8
      & n2 = X9
      & n4 = X9
      & n0 != times(divide(n1,n400),a_select2(sigma,n2)) ),
    inference(variable_rename,[status(thm)],[c76]) ).

fof(c78,negated_conjecture,
    ( leq(n0,skolem0001)
    & leq(n0,skolem0002)
    & leq(skolem0001,n5)
    & leq(skolem0002,n5)
    & ( n0 != skolem0001
      | n3 != skolem0002 )
    & ( n0 != skolem0001
      | n4 != skolem0002 )
    & ( n0 != skolem0001
      | n5 != skolem0002 )
    & ( n0 != skolem0002
      | n1 != skolem0001 )
    & ( n0 != skolem0002
      | n2 != skolem0001 )
    & ( n0 != skolem0002
      | n3 != skolem0001 )
    & ( n0 != skolem0002
      | n4 != skolem0001 )
    & ( n0 != skolem0002
      | n5 != skolem0001 )
    & ( n1 != skolem0001
      | n1 != skolem0002 )
    & ( n1 != skolem0001
      | n2 != skolem0002 )
    & ( n1 != skolem0001
      | n3 != skolem0002 )
    & ( n1 != skolem0001
      | n4 != skolem0002 )
    & ( n1 != skolem0001
      | n5 != skolem0002 )
    & ( n1 != skolem0002
      | n2 != skolem0001 )
    & ( n1 != skolem0002
      | n3 != skolem0001 )
    & ( n1 != skolem0002
      | n4 != skolem0001 )
    & ( n1 != skolem0002
      | n5 != skolem0001 )
    & ( n2 != skolem0001
      | n2 != skolem0002 )
    & ( n2 != skolem0001
      | n3 != skolem0002 )
    & ( n2 != skolem0001
      | n4 != skolem0002 )
    & ( n2 != skolem0001
      | n5 != skolem0002 )
    & ( n2 != skolem0002
      | n3 != skolem0001 )
    & ( n2 != skolem0002
      | n4 != skolem0001 )
    & ( n2 != skolem0002
      | n5 != skolem0001 )
    & ( n3 != skolem0001
      | n3 != skolem0002 )
    & ( n3 != skolem0001
      | n4 != skolem0002 )
    & ( n3 != skolem0001
      | n5 != skolem0002 )
    & ( n3 != skolem0002
      | n4 != skolem0001 )
    & ( n3 != skolem0002
      | n5 != skolem0001 )
    & ( n4 != skolem0001
      | n4 != skolem0002 )
    & ( n4 != skolem0001
      | n5 != skolem0002 )
    & ( n4 != skolem0002
      | n5 != skolem0001 )
    & ( n5 != skolem0001
      | n5 != skolem0002 )
    & n0 = skolem0001
    & n2 = skolem0001
    & n2 = skolem0002
    & n4 = skolem0002
    & n0 != times(divide(n1,n400),a_select2(sigma,n2)) ),
    inference(skolemize,[status(esa)],[c77]) ).

cnf(c116,negated_conjecture,
    n0 = skolem0001,
    inference(split_conjunct,[status(thm)],[c78]) ).

cnf(c119,negated_conjecture,
    n4 = skolem0002,
    inference(split_conjunct,[status(thm)],[c78]) ).

cnf(c84,negated_conjecture,
    ( n0 != skolem0001
    | n4 != skolem0002 ),
    inference(split_conjunct,[status(thm)],[c78]) ).

cnf(c1215,plain,
    n0 != skolem0001,
    inference(resolution,[status(thm)],[c84,c119]) ).

cnf(c1217,plain,
    $false,
    inference(resolution,[status(thm)],[c1215,c116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem  : SWV215+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu May  9 06:19:08 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.86/1.04  % Version:  1.5
% 0.86/1.04  % SZS status Theorem
% 0.86/1.04  % SZS output start CNFRefutation
% See solution above
% 0.86/1.04  
% 0.86/1.04  % Initial clauses    : 363
% 0.86/1.04  % Processed clauses  : 191
% 0.86/1.04  % Factors computed   : 24
% 0.86/1.04  % Resolvents computed: 687
% 0.86/1.04  % Tautologies deleted: 0
% 0.86/1.04  % Forward subsumed   : 68
% 0.86/1.04  % Backward subsumed  : 3
% 0.86/1.04  % -------- CPU Time ---------
% 0.86/1.04  % User time          : 0.669 s
% 0.86/1.04  % System time        : 0.013 s
% 0.86/1.04  % Total time         : 0.682 s
%------------------------------------------------------------------------------