↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN758-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n002.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 : Tue Sep 29 02:18:14 PM UTC 2026

% Result   : Unsatisfiable 1.09s 0.43s
% Output   : Refutation 1.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :   51
% Syntax   : Number of formulae    :   52 (   2 unt;   0 def)
%            Number of atoms       :  400 (   0 equ)
%            Maximal formula atoms :   10 (   7 avg)
%            Number of connectives :  641 ( 293   ~; 348   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (  13 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :  249 ( 249   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] : ssRr(X0,skf1(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f2,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssPv2(X2)
      | ~ ssPv4(X2)
      | ssPv3(X1)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

fof(f3,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssPv1(X2)
      | ~ ssPv4(X2)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f4,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ssPv3(X1)
      | ssPv1(X3)
      | ssPv2(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

fof(f5,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ssPv4(X1)
      | ssPv2(X3)
      | ssPv1(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

fof(f6,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ssPv2(X1)
      | ssPv1(X3)
      | ssPv1(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

fof(f7,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv3(X2)
      | ssPv1(X1)
      | ssPv2(X3)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

fof(f8,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ssPv4(X3)
      | ssPv1(X2)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f9,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ssPv4(X3)
      | ssPv1(X2)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).

fof(f10,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv4(X3)
      | ~ ssPv3(X2)
      | ssPv1(X1)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).

fof(f11,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ~ ssPv4(X2)
      | ssPv4(X1)
      | ssPv3(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).

fof(f12,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv4(X3)
      | ~ ssPv3(X2)
      | ssPv2(X1)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).

fof(f13,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X3)
      | ~ ssPv1(X2)
      | ssPv3(X1)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

fof(f14,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ssPv1(X3)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).

fof(f15,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X3)
      | ~ ssPv4(X2)
      | ssPv3(X1)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).

fof(f16,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv4(X2)
      | ssPv1(X3)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).

fof(f17,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv3(X3)
      | ~ ssPv2(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).

fof(f18,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv4(X3)
      | ~ ssPv2(X2)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).

fof(f19,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv2(X3)
      | ~ ssPv2(X2)
      | ~ ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).

fof(f20,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ssPv1(X4)
      | ssPv2(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).

fof(f21,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv2(X3)
      | ~ ssRr(X2,X4)
      | ssPv1(X1)
      | ssPv3(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).

fof(f22,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X4)
      | ssPv4(X3)
      | ssPv2(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).

fof(f23,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X4)
      | ~ ssPv3(X2)
      | ssPv3(X1)
      | ssPv4(X3)
      | ssPv2(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).

fof(f24,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ssPv4(X4)
      | ssPv3(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).

fof(f25,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ssPv1(X4)
      | ssPv3(X2)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).

fof(f26,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ssPv3(X4)
      | ssPv1(X2)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).

fof(f27,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv3(X2)
      | ssPv4(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).

fof(f28,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X3)
      | ~ ssRr(X2,X4)
      | ssPv2(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).

fof(f29,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ssPv1(X4)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).

fof(f30,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X2,X3)
      | ~ ssPv2(X3)
      | ~ ssRr(X2,X4)
      | ssPv1(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).

fof(f31,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ssPv3(X4)
      | ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).

fof(f32,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv3(X2)
      | ~ ssPv4(X2)
      | ssPv1(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause32) ).

fof(f33,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ~ ssPv3(X2)
      | ssPv3(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).

fof(f34,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ~ ssPv3(X2)
      | ssPv1(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).

fof(f35,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ~ ssPv4(X2)
      | ssPv2(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).

fof(f36,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ssPv4(X1)
      | ssPv1(X4)
      | ssPv3(X5)
      | ssPv1(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause36) ).

fof(f37,negated_conjecture,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssPv1(X4)
      | ~ ssRr(X2,X3)
      | ~ ssPv1(X2)
      | ~ ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).

fof(f38,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ssPv3(X1)
      | ssPv2(X4)
      | ssPv3(X5)
      | ssPv1(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause38) ).

fof(f39,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ssPv1(X4)
      | ssPv4(X5)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause39) ).

fof(f40,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ssPv2(X4)
      | ssPv3(X5)
      | ssPv1(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause40) ).

fof(f41,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ssPv4(X4)
      | ssPv3(X5)
      | ssPv3(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause41) ).

fof(f42,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv2(X5)
      | ssPv1(X4)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause42) ).

fof(f43,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv4(X5)
      | ~ ssPv2(X2)
      | ssPv4(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause43) ).

fof(f44,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv4(X5)
      | ~ ssPv4(X2)
      | ssPv3(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause44) ).

fof(f45,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv1(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv3(X5)
      | ~ ssPv1(X2)
      | ssPv4(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause45) ).

fof(f46,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv3(X5)
      | ~ ssPv1(X2)
      | ssPv3(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause46) ).

fof(f47,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv2(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv3(X5)
      | ~ ssPv3(X2)
      | ssPv4(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause47) ).

fof(f48,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssPv2(X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X2,X5)
      | ~ ssPv3(X5)
      | ~ ssPv4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause48) ).

fof(f49,negated_conjecture,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X5,X6)
      | ~ ssRr(X2,X5)
      | ~ ssPv1(X2)
      | ssPv3(X1)
      | ssPv2(X4)
      | ssPv1(X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause49) ).

fof(f50,negated_conjecture,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv3(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X5,X6)
      | ~ ssRr(X2,X5)
      | ssPv3(X4)
      | ssPv1(X6)
      | ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause50) ).

fof(f51,negated_conjecture,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ ssRr(X0,X1)
      | ~ ssPv4(X1)
      | ~ ssRr(X2,X0)
      | ~ ssRr(X3,X4)
      | ~ ssPv2(X4)
      | ~ ssRr(X2,X3)
      | ~ ssRr(X5,X6)
      | ~ ssPv1(X6)
      | ~ ssRr(X2,X5)
      | ~ ssPv2(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause51) ).

fof(f349,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f1,f2,f3,f4,f5,f6,f7,f8,f9,f10,f11,f12,f13,f14,f15,f16,f17,f18,f19,f20,f21,f22,f23,f24,f25,f26,f27,f28,f29,f30,f31,f32,f33,f34,f35,f36,f37,f38,f39,f40,f41,f42,f43,f44,f45,f46,f47,f48,f49,f50,f51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN758-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17  % Computer : n002.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 16:55:07 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/0.20  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.09/0.43  % (513973)Will run a generic schedule for satisfiability detection.
% 1.09/0.43  % (513983)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=267234179:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.09/0.43  % (513979)% WARNING: option uhcvi not known.
% 1.09/0.43  % (513978)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1742171680_2999 on theBenchmark for (2999ds/0Mi)
% 1.09/0.43  % (513982)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3280908564:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.09/0.43  % (513980)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=232852696:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.09/0.43  % (513981)dis+10_1_sil=32000:sp=arity:random_seed=1057051907:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.09/0.43  % (513984)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2146801076:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.09/0.43  % (513979)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=374845642:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.09/0.43  % TRYING [1]
% 1.09/0.43  % TRYING [2]
% 1.09/0.43  % TRYING [3]
% 1.09/0.43  % TRYING [4]
% 1.09/0.43  % (513983)Instruction limit reached! 
% 1.09/0.43  % (513983)------------------------------
% 1.09/0.43  % (513983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513983)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513983)Termination reason: Instruction limit
% 1.09/0.43  % (513983)Termination phase: Saturation
% 1.09/0.43  % (513983)Time elapsed: 0.034 s
% 1.09/0.43  % (513983)Peak memory usage: 11 MB
% 1.09/0.43  % (513983)Instructions burned: 131 (million)
% 1.09/0.43  % TRYING [5]
% 1.09/0.43  % (513992)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=565252021:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.09/0.43  % TRYING [1]
% 1.09/0.43  % TRYING [2]
% 1.09/0.43  % TRYING [3]
% 1.09/0.43  % TRYING [4]
% 1.09/0.43  % TRYING [6]
% 1.09/0.43  % (513982)Instruction limit reached! 
% 1.09/0.43  % (513982)------------------------------
% 1.09/0.43  % (513982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513982)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513982)Termination reason: Instruction limit
% 1.09/0.43  % (513982)Termination phase: Saturation
% 1.09/0.43  % (513982)Time elapsed: 0.050 s
% 1.09/0.43  % (513982)Peak memory usage: 11 MB
% 1.09/0.43  % (513982)Instructions burned: 117 (million)
% 1.09/0.43  % TRYING [5]
% 1.09/0.43  % (513981)Instruction limit reached! 
% 1.09/0.43  % (513981)------------------------------
% 1.09/0.43  % (513981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513981)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513981)Termination reason: Instruction limit
% 1.09/0.43  % (513981)Termination phase: Saturation
% 1.09/0.43  % (513981)Time elapsed: 0.059 s
% 1.09/0.43  % (513981)Peak memory usage: 11 MB
% 1.09/0.43  % (513981)Instructions burned: 104 (million)
% 1.09/0.43  % (513994)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2175777401:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.09/0.43  % TRYING [6]
% 1.09/0.43  % (513995)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1042170127:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.09/0.43  % TRYING [7]
% 1.09/0.43  % (513984)Instruction limit reached! 
% 1.09/0.43  % (513984)------------------------------
% 1.09/0.43  % (513984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513984)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513984)Termination reason: Instruction limit
% 1.09/0.43  % (513984)Termination phase: Saturation
% 1.09/0.43  % (513984)Time elapsed: 0.084 s
% 1.09/0.43  % (513984)Peak memory usage: 12 MB
% 1.09/0.43  % (513984)Instructions burned: 160 (million)
% 1.09/0.43  % TRYING [7]
% 1.09/0.43  % (513998)ott-21_1_sil=16000:fs=off:random_seed=2312176094:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.09/0.43  % TRYING [8]
% 1.09/0.43  % TRYING [8]
% 1.09/0.43  % TRYING [9]
% 1.09/0.43  % (513994)Instruction limit reached! 
% 1.09/0.43  % (513994)------------------------------
% 1.09/0.43  % (513994)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513994)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513994)Termination reason: Instruction limit
% 1.09/0.43  % (513994)Termination phase: Saturation
% 1.09/0.43  % (513994)Time elapsed: 0.072 s
% 1.09/0.43  % (513994)Peak memory usage: 11 MB
% 1.09/0.43  % (513994)Instructions burned: 131 (million)
% 1.09/0.43  % TRYING [9]
% 1.09/0.43  % TRYING [10]
% 1.09/0.43  % (514000)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=802209442:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.09/0.43  % (513992) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-513973-513992"...
% 1.09/0.43  % TRYING [10]
% 1.09/0.43  % (513992)...printing done.
% 1.09/0.43  % (513992)Refutation found. Thanks to Tanya!
% 1.09/0.43  % SZS status Unsatisfiable for theBenchmark
% 1.09/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 1.09/0.43  % (513992)------------------------------
% 1.09/0.43  % (513992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.43  % (513992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.43  % (513992)CaDiCaL version: 2.1.3
% 1.09/0.43  % (513992)Termination reason: Refutation
% 1.09/0.43  % (513992)Time elapsed: 0.149 s
% 1.09/0.43  % (513992)Peak memory usage: 15 MB
% 1.09/0.43  % (513992)Instructions burned: 553 (million)
% 1.09/0.43  % (513973)Success in time 0.222 s
% 1.09/0.43  % Vampire exiting
%------------------------------------------------------------------------------