↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV232+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n018.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 : Fri Sep 25 03:12:33 PM UTC 2026

% Result   : Theorem 9.71s 1.82s
% Output   : Proof 9.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   30 (  19 unt;   0 def)
%            Number of atoms       :  145 ( 108 equ)
%            Maximal formula atoms :   28 (   4 avg)
%            Number of connectives :  193 (  78   ~;  29   |;  78   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  12 con; 0-4 aty)
%            Number of variables   :   18 (   0 sgn  15   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ! [A,B] :
        ( ( leq(B,n5)
          & leq(A,n5)
          & leq(n0,B)
          & leq(n0,A) )
       => a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
   => ! [C,D] :
        ( ( leq(D,n2)
          & leq(C,n2)
          & leq(n0,D)
          & leq(n0,C) )
       => ( ( n2 = C
            & n1 = D
            & n1 = C
            & n0 = D
            & ~ ( n2 = D
                & n2 = C )
            & ~ ( n2 = C
                & n1 = D )
            & ~ ( n2 = D
                & n1 = C )
            & ~ ( n1 = D
                & n1 = C )
            & ~ ( n2 = C
                & n0 = D )
            & ~ ( n2 = D
                & n0 = C )
            & ~ ( n1 = D
                & n0 = C ) )
         => a_select2(rho,n1) = n0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0841) ).

fof(f52_neg,negated_conjecture,
    ~ ( ! [A,B] :
          ( ( leq(B,n5)
            & leq(A,n5)
            & leq(n0,B)
            & leq(n0,A) )
         => a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
     => ! [C,D] :
          ( ( leq(D,n2)
            & leq(C,n2)
            & leq(n0,D)
            & leq(n0,C) )
         => ( ( n2 = C
              & n1 = D
              & n1 = C
              & n0 = D
              & ~ ( n2 = D
                  & n2 = C )
              & ~ ( n2 = C
                  & n1 = D )
              & ~ ( n2 = D
                  & n1 = C )
              & ~ ( n1 = D
                  & n1 = C )
              & ~ ( n2 = C
                  & n0 = D )
              & ~ ( n2 = D
                  & n0 = C )
              & ~ ( n1 = D
                  & n0 = C ) )
           => a_select2(rho,n1) = n0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ? [C,D] :
        ( a_select2(rho,n1) != n0
        & n2 = C
        & n1 = D
        & n1 = C
        & n0 = D
        & ( n2 != D
          | n2 != C )
        & ( n2 != C
          | n1 != D )
        & ( n2 != D
          | n1 != C )
        & ( n1 != D
          | n1 != C )
        & ( n2 != C
          | n0 != D )
        & ( n2 != D
          | n0 != C )
        & ( n1 != D
          | n0 != C )
        & leq(D,n2)
        & leq(C,n2)
        & leq(n0,D)
        & leq(n0,C) )
    & ! [A,B] :
        ( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
        | ~ leq(B,n5)
        | ~ leq(A,n5)
        | ~ leq(n0,B)
        | ~ leq(n0,A) ) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B] :
      ( a_select2(rho,n1) != n0
      & n2 = sk27
      & n1 = sk28
      & n1 = sk27
      & n0 = sk28
      & ( n2 != sk28
        | n2 != sk27 )
      & ( n2 != sk27
        | n1 != sk28 )
      & ( n2 != sk28
        | n1 != sk27 )
      & ( n1 != sk28
        | n1 != sk27 )
      & ( n2 != sk27
        | n0 != sk28 )
      & ( n2 != sk28
        | n0 != sk27 )
      & ( n1 != sk28
        | n0 != sk27 )
      & leq(sk28,n2)
      & leq(sk27,n2)
      & leq(n0,sk28)
      & leq(n0,sk27)
      & ( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
        | ~ leq(B,n5)
        | ~ leq(A,n5)
        | ~ leq(n0,B)
        | ~ leq(n0,A) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk27,sk28])],[f52_nnf]) ).

cnf(c263,plain,
    ( n1 != sk28
    | n1 != sk27 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi299,negated_conjecture,
    ifeq(n1,sk27,ifeq(n1,sk28,false,trueq),trueq) = trueq,
    inference(equality_encoding,[status(esa)],[c263]) ).

cnf(c268,plain,
    n1 = sk27,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi259,negated_conjecture,
    n1 = sk27,
    inference(equality_encoding,[status(esa)],[c268]) ).

cnf(c269,plain,
    n1 = sk28,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi260,negated_conjecture,
    n1 = sk28,
    inference(equality_encoding,[status(esa)],[c269]) ).

cnf(t4,plain,
    trueq = false,
    inference(hyper_resolution,[status(thm)],[hi299,hi259,hi260]) ).

cnf(t384,plain,
    false = trueq,
    inference(orient,[status(thm)],[t4]) ).

fof(f2,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).

fof(f2_nnf,plain,
    ! [X] : ~ gt(X,X),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] : ~ gt(X,X),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ gt(X0,X0),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

fof(f51,axiom,
    def != use,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',defuse) ).

fof(f51_nnf,plain,
    def != use,
    inference(nnf_transformation,[status(thm)],[f51]) ).

fof(f51_sk,plain,
    def != use,
    inference(skolemisation,[status(esa)],[f51_nnf]) ).

cnf(c254,plain,
    def != use,
    inference(cnf_transformation,[status(esa)],[f51_sk]) ).

cnf(c260,plain,
    ( n1 != sk28
    | n0 != sk27 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c261,plain,
    ( n2 != sk28
    | n0 != sk27 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c262,plain,
    ( n2 != sk27
    | n0 != sk28 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c264,plain,
    ( n2 != sk28
    | n1 != sk27 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c265,plain,
    ( n2 != sk27
    | n1 != sk28 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c266,plain,
    ( n2 != sk28
    | n2 != sk27 ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c271,plain,
    a_select2(rho,n1) != n0,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(goal_0,negated_conjecture,
    trueq != false,
    inference(equality_encoding,[status(esa)],[c2,c254,c260,c261,c262,c263,c264,c265,c266,c271]) ).

cnf(g0_0,plain,
    trueq != trueq,
    inference(rw,[status(thm)],[goal_0,t384]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV232+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n018.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 18:50:50 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 9.71/1.82  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.71/1.82  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------