↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n004.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 10:12:37 AM UTC 2026

% Result   : Unsatisfiable 10.97s 2.57s
% Output   : Refutation 11.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   34
% Syntax   : Number of formulae    :  152 (  65 unt;  17 def)
%            Number of atoms       :  292 ( 109 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  274 ( 134   ~; 126   |;   0   &)
%                                         (  14 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   16 (  14 usr;  15 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   85 (   0 sgn  85   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).

fof(f2,axiom,
    ! [X0] : multiply(inverse(X0),X0) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).

fof(f3,plain,
    ! [X0] : identity = multiply(inverse(X0),X0),
    inference(reorient_equations,[],[f2]) ).

fof(f4,axiom,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).

fof(f7,axiom,
    ! [X0] : inverse(inverse(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_involution) ).

fof(f11,axiom,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_commutative) ).

fof(f12,axiom,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_commutative) ).

fof(f13,axiom,
    ! [X2,X0,X1] : intersection(X0,intersection(X1,X2)) = intersection(intersection(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_associative) ).

fof(f14,axiom,
    ! [X2,X0,X1] : union(X0,union(X1,X2)) = union(union(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_associative) ).

fof(f15,axiom,
    ! [X0,X1] : union(intersection(X0,X1),X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_intersection_absorbtion) ).

fof(f16,axiom,
    ! [X0,X1] : intersection(union(X0,X1),X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_union_absorbtion) ).

fof(f17,axiom,
    ! [X2,X0,X1] : multiply(X0,union(X1,X2)) = union(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_union1) ).

fof(f18,axiom,
    ! [X2,X0,X1] : multiply(X0,intersection(X1,X2)) = intersection(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_intersection1) ).

fof(f19,axiom,
    ! [X2,X0,X1] : multiply(union(X0,X1),X2) = union(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_union2) ).

fof(f20,axiom,
    ! [X2,X0,X1] : multiply(intersection(X0,X1),X2) = intersection(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_intersection2) ).

fof(f21,axiom,
    ! [X0] : positive_part(X0) = union(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',positive_part) ).

fof(f22,axiom,
    ! [X0] : negative_part(X0) = intersection(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative_part) ).

fof(f23,negated_conjecture,
    multiply(positive_part(a),negative_part(a)) != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_product) ).

fof(f24,plain,
    a != multiply(positive_part(a),negative_part(a)),
    inference(reorient_equations,[],[f23]) ).

fof(f25,plain,
    a != multiply(union(a,identity),intersection(a,identity)),
    inference(definition_unfolding,[],[f24,f21,f22]) ).

fof(f26,definition,
    sF0 = union(a,identity),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f27,plain,
    union(a,identity) = sF0,
    inference(reorient_equations,[],[f26]) ).

fof(f28,definition,
    sF1 = intersection(a,identity),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f29,plain,
    intersection(a,identity) = sF1,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF2 = multiply(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f31,plain,
    multiply(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f30]) ).

fof(f32,plain,
    a != sF2,
    inference(definition_folding,[],[f25,f31,f29,f27]) ).

fof(f33,plain,
    sF0 = union(identity,a),
    inference(forward_demodulation,[],[f27,f12]) ).

fof(f34,plain,
    sF1 = intersection(identity,a),
    inference(forward_demodulation,[],[f29,f11]) ).

fof(f36,definition,
    ( spl3_1
  <=> multiply(sF0,sF1) = sF2 ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f38,plain,
    ( multiply(sF0,sF1) = sF2
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f36]) ).

fof(f39,plain,
    spl3_1,
    inference(avatar_split_clause,[],[f31,f36]) ).

fof(f41,definition,
    ( spl3_2
  <=> sF1 = intersection(identity,a) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f43,plain,
    ( sF1 = intersection(identity,a)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f44,plain,
    spl3_2,
    inference(avatar_split_clause,[],[f34,f41]) ).

fof(f46,definition,
    ( spl3_3
  <=> sF0 = union(identity,a) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

fof(f48,plain,
    ( sF0 = union(identity,a)
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f46]) ).

fof(f49,plain,
    spl3_3,
    inference(avatar_split_clause,[],[f33,f46]) ).

fof(f51,definition,
    ( spl3_4
  <=> a = sF2 ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

fof(f53,plain,
    ( a != sF2
    | spl3_4 ),
    inference(avatar_component_clause,[],[f51]) ).

fof(f54,plain,
    ~ spl3_4,
    inference(avatar_split_clause,[],[f32,f51]) ).

fof(f55,plain,
    ! [X0,X1] : multiply(union(identity,X1),X0) = union(X0,multiply(X1,X0)),
    inference(superposition,[],[f19,f1]) ).

fof(f69,plain,
    ( ! [X0] : union(X0,multiply(a,X0)) = multiply(sF0,X0)
    | ~ spl3_3 ),
    inference(superposition,[],[f55,f48]) ).

fof(f81,plain,
    ! [X0,X1] : multiply(intersection(identity,X1),X0) = intersection(X0,multiply(X1,X0)),
    inference(superposition,[],[f20,f1]) ).

fof(f97,plain,
    ( ! [X0] : intersection(X0,multiply(a,X0)) = multiply(sF1,X0)
    | ~ spl3_2 ),
    inference(superposition,[],[f81,f43]) ).

fof(f165,plain,
    ! [X0,X1] : multiply(inverse(X0),union(X0,X1)) = union(identity,multiply(inverse(X0),X1)),
    inference(superposition,[],[f17,f3]) ).

fof(f185,plain,
    ! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
    inference(superposition,[],[f4,f3]) ).

fof(f203,plain,
    ! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(forward_demodulation,[],[f185,f1]) ).

fof(f216,plain,
    ! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[],[f203,f3]) ).

fof(f237,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(forward_demodulation,[],[f216,f7]) ).

fof(f239,plain,
    ( a = union(sF1,a)
    | ~ spl3_2 ),
    inference(superposition,[],[f15,f43]) ).

fof(f241,plain,
    ! [X0,X1] : union(intersection(X0,X1),X0) = X0,
    inference(superposition,[],[f15,f11]) ).

fof(f252,plain,
    ! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
    inference(forward_demodulation,[],[f241,f12]) ).

fof(f259,plain,
    ( identity = union(identity,sF1)
    | ~ spl3_2 ),
    inference(superposition,[],[f252,f43]) ).

fof(f269,plain,
    ( identity = union(sF1,identity)
    | ~ spl3_2 ),
    inference(forward_demodulation,[],[f259,f12]) ).

fof(f271,plain,
    ! [X0,X1] : intersection(union(X0,X1),X0) = X0,
    inference(superposition,[],[f16,f12]) ).

fof(f274,plain,
    ( a = intersection(sF0,a)
    | ~ spl3_3 ),
    inference(superposition,[],[f16,f48]) ).

fof(f289,plain,
    ! [X0,X1] : intersection(X0,union(X0,X1)) = X0,
    inference(forward_demodulation,[],[f271,f11]) ).

fof(f301,plain,
    ( identity = intersection(identity,sF0)
    | ~ spl3_3 ),
    inference(superposition,[],[f289,f48]) ).

fof(f313,plain,
    ( identity = intersection(sF0,identity)
    | ~ spl3_3 ),
    inference(forward_demodulation,[],[f301,f11]) ).

fof(f315,plain,
    ! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
    inference(superposition,[],[f203,f7]) ).

fof(f327,definition,
    ( spl3_6
  <=> a = intersection(sF0,a) ),
    introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).

fof(f329,plain,
    ( a = intersection(sF0,a)
    | ~ spl3_6 ),
    inference(avatar_component_clause,[],[f327]) ).

fof(f330,plain,
    ( spl3_6
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f274,f46,f327]) ).

fof(f332,definition,
    ( spl3_7
  <=> a = union(sF1,a) ),
    introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).

fof(f334,plain,
    ( a = union(sF1,a)
    | ~ spl3_7 ),
    inference(avatar_component_clause,[],[f332]) ).

fof(f335,plain,
    ( spl3_7
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f239,f41,f332]) ).

fof(f383,plain,
    ( ! [X0] : multiply(a,intersection(X0,multiply(a,X0))) = multiply(sF1,multiply(a,X0))
    | ~ spl3_2 ),
    inference(superposition,[],[f18,f97]) ).

fof(f384,plain,
    ( ! [X0] : multiply(sF1,multiply(a,X0)) = multiply(a,multiply(sF1,X0))
    | ~ spl3_2 ),
    inference(forward_demodulation,[],[f383,f97]) ).

fof(f415,plain,
    ! [X2,X3,X0,X1] : union(multiply(X0,X1),union(multiply(X0,X2),X3)) = union(multiply(X0,union(X1,X2)),X3),
    inference(superposition,[],[f14,f17]) ).

fof(f462,plain,
    ! [X2,X3,X0,X1] : intersection(multiply(X0,X1),intersection(multiply(X0,X2),X3)) = intersection(multiply(X0,intersection(X1,X2)),X3),
    inference(superposition,[],[f13,f18]) ).

fof(f923,plain,
    ! [X2,X3,X0,X1] : union(multiply(X0,union(X3,X2)),multiply(X1,X2)) = union(multiply(X0,X3),multiply(union(X0,X1),X2)),
    inference(superposition,[],[f415,f19]) ).

fof(f1009,plain,
    ( ! [X0,X1] : union(multiply(X0,identity),multiply(union(X0,X1),a)) = union(multiply(X0,sF0),multiply(X1,a))
    | ~ spl3_3 ),
    inference(superposition,[],[f923,f48]) ).

fof(f1152,plain,
    ( ! [X0,X1] : union(multiply(X0,sF0),multiply(X1,a)) = union(X0,multiply(union(X0,X1),a))
    | ~ spl3_3 ),
    inference(forward_demodulation,[],[f1009,f237]) ).

fof(f1372,plain,
    ! [X2,X3,X0,X1] : intersection(multiply(X0,intersection(X3,X2)),multiply(X1,X2)) = intersection(multiply(X0,X3),multiply(intersection(X0,X1),X2)),
    inference(superposition,[],[f462,f20]) ).

fof(f1477,plain,
    ( ! [X0,X1] : intersection(multiply(X0,identity),multiply(intersection(X0,X1),a)) = intersection(multiply(X0,sF1),multiply(X1,a))
    | ~ spl3_2 ),
    inference(superposition,[],[f1372,f43]) ).

fof(f1629,plain,
    ( ! [X0,X1] : intersection(multiply(X0,sF1),multiply(X1,a)) = intersection(X0,multiply(intersection(X0,X1),a))
    | ~ spl3_2 ),
    inference(forward_demodulation,[],[f1477,f237]) ).

fof(f2105,plain,
    ( multiply(a,sF1) = multiply(sF1,multiply(a,identity))
    | ~ spl3_2 ),
    inference(superposition,[],[f384,f237]) ).

fof(f2135,plain,
    ( multiply(a,sF1) = multiply(sF1,a)
    | ~ spl3_2 ),
    inference(forward_demodulation,[],[f2105,f237]) ).

fof(f3803,definition,
    ( spl3_12
  <=> identity = intersection(sF0,identity) ),
    introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).

fof(f3805,plain,
    ( identity = intersection(sF0,identity)
    | ~ spl3_12 ),
    inference(avatar_component_clause,[],[f3803]) ).

fof(f3806,plain,
    ( spl3_12
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f313,f46,f3803]) ).

fof(f3837,definition,
    ( spl3_13
  <=> multiply(a,sF1) = multiply(sF1,a) ),
    introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).

fof(f3839,plain,
    ( multiply(a,sF1) = multiply(sF1,a)
    | ~ spl3_13 ),
    inference(avatar_component_clause,[],[f3837]) ).

fof(f3840,plain,
    ( spl3_13
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f2135,f41,f3837]) ).

fof(f3842,plain,
    ( multiply(sF0,sF1) = union(sF1,multiply(sF1,a))
    | ~ spl3_3
    | ~ spl3_13 ),
    inference(superposition,[],[f69,f3839]) ).

fof(f3870,plain,
    ( sF2 = union(sF1,multiply(sF1,a))
    | ~ spl3_1
    | ~ spl3_3
    | ~ spl3_13 ),
    inference(forward_demodulation,[],[f3842,f38]) ).

fof(f3875,definition,
    ( spl3_14
  <=> identity = union(sF1,identity) ),
    introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).

fof(f3877,plain,
    ( identity = union(sF1,identity)
    | ~ spl3_14 ),
    inference(avatar_component_clause,[],[f3875]) ).

fof(f3878,plain,
    ( spl3_14
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f269,f41,f3875]) ).

fof(f4901,definition,
    ( spl3_21
  <=> sF2 = union(sF1,multiply(sF1,a)) ),
    introduced(definition,[new_symbols(definition,[spl3_21])],[avatar_definition]) ).

fof(f4903,plain,
    ( sF2 = union(sF1,multiply(sF1,a))
    | ~ spl3_21 ),
    inference(avatar_component_clause,[],[f4901]) ).

fof(f4904,plain,
    ( spl3_21
    | ~ spl3_1
    | ~ spl3_3
    | ~ spl3_13 ),
    inference(avatar_split_clause,[],[f3870,f3837,f46,f36,f4901]) ).

fof(f4908,plain,
    ( union(identity,multiply(inverse(sF1),multiply(sF1,a))) = multiply(inverse(sF1),sF2)
    | ~ spl3_21 ),
    inference(superposition,[],[f165,f4903]) ).

fof(f4917,plain,
    ( union(identity,a) = multiply(inverse(sF1),sF2)
    | ~ spl3_21 ),
    inference(forward_demodulation,[],[f4908,f203]) ).

fof(f4921,plain,
    ( sF0 = multiply(inverse(sF1),sF2)
    | ~ spl3_3
    | ~ spl3_21 ),
    inference(forward_demodulation,[],[f4917,f48]) ).

fof(f4925,definition,
    ( spl3_22
  <=> sF0 = multiply(inverse(sF1),sF2) ),
    introduced(definition,[new_symbols(definition,[spl3_22])],[avatar_definition]) ).

fof(f4927,plain,
    ( sF0 = multiply(inverse(sF1),sF2)
    | ~ spl3_22 ),
    inference(avatar_component_clause,[],[f4925]) ).

fof(f4928,plain,
    ( spl3_22
    | ~ spl3_3
    | ~ spl3_21 ),
    inference(avatar_split_clause,[],[f4921,f4901,f46,f4925]) ).

fof(f4929,plain,
    ( sF2 = multiply(sF1,sF0)
    | ~ spl3_22 ),
    inference(superposition,[],[f315,f4927]) ).

fof(f4992,definition,
    ( spl3_23
  <=> sF2 = multiply(sF1,sF0) ),
    introduced(definition,[new_symbols(definition,[spl3_23])],[avatar_definition]) ).

fof(f4994,plain,
    ( sF2 = multiply(sF1,sF0)
    | ~ spl3_23 ),
    inference(avatar_component_clause,[],[f4992]) ).

fof(f4995,plain,
    ( spl3_23
    | ~ spl3_22 ),
    inference(avatar_split_clause,[],[f4929,f4925,f4992]) ).

fof(f5329,plain,
    ( union(multiply(sF1,sF0),multiply(identity,a)) = union(sF1,multiply(identity,a))
    | ~ spl3_3
    | ~ spl3_14 ),
    inference(superposition,[],[f1152,f3877]) ).

fof(f5405,plain,
    ( union(sF1,a) = union(multiply(sF1,sF0),a)
    | ~ spl3_3
    | ~ spl3_14 ),
    inference(forward_demodulation,[],[f5329,f1]) ).

fof(f5452,plain,
    ( union(sF1,a) = union(a,multiply(sF1,sF0))
    | ~ spl3_3
    | ~ spl3_14 ),
    inference(forward_demodulation,[],[f5405,f12]) ).

fof(f5480,plain,
    ( union(sF1,a) = union(a,sF2)
    | ~ spl3_3
    | ~ spl3_14
    | ~ spl3_23 ),
    inference(forward_demodulation,[],[f5452,f4994]) ).

fof(f5489,plain,
    ( union(sF1,a) = union(sF2,a)
    | ~ spl3_3
    | ~ spl3_14
    | ~ spl3_23 ),
    inference(forward_demodulation,[],[f5480,f12]) ).

fof(f5492,plain,
    ( a = union(sF2,a)
    | ~ spl3_3
    | ~ spl3_7
    | ~ spl3_14
    | ~ spl3_23 ),
    inference(forward_demodulation,[],[f5489,f334]) ).

fof(f5496,definition,
    ( spl3_26
  <=> a = union(sF2,a) ),
    introduced(definition,[new_symbols(definition,[spl3_26])],[avatar_definition]) ).

fof(f5498,plain,
    ( a = union(sF2,a)
    | ~ spl3_26 ),
    inference(avatar_component_clause,[],[f5496]) ).

fof(f5499,plain,
    ( spl3_26
    | ~ spl3_3
    | ~ spl3_7
    | ~ spl3_14
    | ~ spl3_23 ),
    inference(avatar_split_clause,[],[f5492,f4992,f3875,f332,f46,f5496]) ).

fof(f5505,plain,
    ( sF2 = intersection(sF2,a)
    | ~ spl3_26 ),
    inference(superposition,[],[f289,f5498]) ).

fof(f6372,definition,
    ( spl3_28
  <=> sF2 = intersection(sF2,a) ),
    introduced(definition,[new_symbols(definition,[spl3_28])],[avatar_definition]) ).

fof(f6374,plain,
    ( sF2 = intersection(sF2,a)
    | ~ spl3_28 ),
    inference(avatar_component_clause,[],[f6372]) ).

fof(f6375,plain,
    ( spl3_28
    | ~ spl3_26 ),
    inference(avatar_split_clause,[],[f5505,f5496,f6372]) ).

fof(f6725,plain,
    ( intersection(multiply(sF0,sF1),multiply(identity,a)) = intersection(sF0,multiply(identity,a))
    | ~ spl3_2
    | ~ spl3_12 ),
    inference(superposition,[],[f1629,f3805]) ).

fof(f6814,plain,
    ( intersection(sF0,a) = intersection(multiply(sF0,sF1),a)
    | ~ spl3_2
    | ~ spl3_12 ),
    inference(forward_demodulation,[],[f6725,f1]) ).

fof(f6869,plain,
    ( intersection(sF0,a) = intersection(a,multiply(sF0,sF1))
    | ~ spl3_2
    | ~ spl3_12 ),
    inference(forward_demodulation,[],[f6814,f11]) ).

fof(f6898,plain,
    ( intersection(sF0,a) = intersection(a,sF2)
    | ~ spl3_1
    | ~ spl3_2
    | ~ spl3_12 ),
    inference(forward_demodulation,[],[f6869,f38]) ).

fof(f6909,plain,
    ( intersection(sF0,a) = intersection(sF2,a)
    | ~ spl3_1
    | ~ spl3_2
    | ~ spl3_12 ),
    inference(forward_demodulation,[],[f6898,f11]) ).

fof(f6913,plain,
    ( sF2 = intersection(sF0,a)
    | ~ spl3_1
    | ~ spl3_2
    | ~ spl3_12
    | ~ spl3_28 ),
    inference(forward_demodulation,[],[f6909,f6374]) ).

fof(f6916,plain,
    ( a = sF2
    | ~ spl3_1
    | ~ spl3_2
    | ~ spl3_6
    | ~ spl3_12
    | ~ spl3_28 ),
    inference(forward_demodulation,[],[f6913,f329]) ).

fof(f6917,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_2
    | spl3_4
    | ~ spl3_6
    | ~ spl3_12
    | ~ spl3_28 ),
    inference(forward_subsumption_resolution,[],[f6916,f53]) ).

fof(f6918,plain,
    ( ~ spl3_1
    | ~ spl3_2
    | spl3_4
    | ~ spl3_6
    | ~ spl3_12
    | ~ spl3_28 ),
    inference(avatar_contradiction_clause,[],[f6917]) ).

cnf(s1,plain,
    spl3_1,
    inference(sat_conversion,[],[f39]) ).

cnf(s2,plain,
    spl3_2,
    inference(sat_conversion,[],[f44]) ).

cnf(s3,plain,
    spl3_3,
    inference(sat_conversion,[],[f49]) ).

cnf(s4,plain,
    ~ spl3_4,
    inference(sat_conversion,[],[f54]) ).

cnf(s6,plain,
    ( ~ spl3_3
    | spl3_6 ),
    inference(sat_conversion,[],[f330]) ).

cnf(s7,plain,
    ( ~ spl3_2
    | spl3_7 ),
    inference(sat_conversion,[],[f335]) ).

cnf(s12,plain,
    ( ~ spl3_3
    | spl3_12 ),
    inference(sat_conversion,[],[f3806]) ).

cnf(s13,plain,
    ( ~ spl3_2
    | spl3_13 ),
    inference(sat_conversion,[],[f3840]) ).

cnf(s14,plain,
    ( ~ spl3_2
    | spl3_14 ),
    inference(sat_conversion,[],[f3878]) ).

cnf(s21,plain,
    ( ~ spl3_1
    | ~ spl3_3
    | ~ spl3_13
    | spl3_21 ),
    inference(sat_conversion,[],[f4904]) ).

cnf(s22,plain,
    ( ~ spl3_3
    | ~ spl3_21
    | spl3_22 ),
    inference(sat_conversion,[],[f4928]) ).

cnf(s23,plain,
    ( ~ spl3_22
    | spl3_23 ),
    inference(sat_conversion,[],[f4995]) ).

cnf(s26,plain,
    ( ~ spl3_3
    | ~ spl3_7
    | ~ spl3_14
    | ~ spl3_23
    | spl3_26 ),
    inference(sat_conversion,[],[f5499]) ).

cnf(s28,plain,
    ( ~ spl3_26
    | spl3_28 ),
    inference(sat_conversion,[],[f6375]) ).

cnf(s30,plain,
    ( ~ spl3_1
    | ~ spl3_2
    | spl3_4
    | ~ spl3_6
    | ~ spl3_12
    | ~ spl3_28 ),
    inference(sat_conversion,[],[f6918]) ).

cnf(s33,plain,
    spl3_12,
    inference(rat,[],[s12,s3]) ).

cnf(s35,plain,
    spl3_6,
    inference(rat,[],[s6,s3]) ).

cnf(s38,plain,
    spl3_14,
    inference(rat,[],[s14,s2]) ).

cnf(s39,plain,
    spl3_13,
    inference(rat,[],[s13,s2]) ).

cnf(s42,plain,
    spl3_7,
    inference(rat,[],[s7,s2]) ).

cnf(s43,plain,
    ~ spl3_28,
    inference(rat,[],[s30,s2,s33,s35,s4,s1]) ).

cnf(s44,plain,
    spl3_21,
    inference(rat,[],[s21,s39,s3,s1]) ).

cnf(s50,plain,
    ~ spl3_26,
    inference(rat,[],[s28,s43]) ).

cnf(s51,plain,
    spl3_22,
    inference(rat,[],[s22,s3,s44]) ).

cnf(s53,plain,
    ~ spl3_23,
    inference(rat,[],[s26,s42,s38,s3,s50]) ).

cnf(s55,plain,
    $false,
    inference(rat,[],[s23,s53,s51]) ).

fof(f6919,plain,
    $false,
    inference(avatar_sat_refutation,[],[s55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP114-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n004.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 09:19:21 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43  Running first-order theorem proving
% 0.15/0.44  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.97/2.56  % (3246269)Detected a unit-equality problem, will run specialized UEQ schedule.
% 10.97/2.56  % (3246292)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=482529974:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 10.97/2.56  % (3246293)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2020926732:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 10.97/2.56  % (3246294)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1457084285:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 10.97/2.56  % (3246295)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2895123656:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 10.97/2.56  % (3246297)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1499741855:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 10.97/2.56  % (3246298)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=4129857371:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 10.97/2.56  % (3246296)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4254979562:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 10.97/2.56  % (3246295)Instruction limit reached! 
% 10.97/2.56  % (3246295)------------------------------
% 10.97/2.56  % (3246295)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.56  % (3246295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.56  % (3246295)CaDiCaL version: 2.1.3
% 10.97/2.56  % (3246295)Termination reason: Instruction limit
% 10.97/2.56  % (3246295)Termination phase: Saturation
% 10.97/2.56  % (3246295)Time elapsed: 0.078 s
% 10.97/2.56  % (3246295)Peak memory usage: 88 MB
% 10.97/2.56  % (3246295)Instructions burned: 137 (million)
% 10.97/2.56  % (3246296)Instruction limit reached! 
% 10.97/2.56  % (3246296)------------------------------
% 10.97/2.56  % (3246296)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.56  % (3246296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.56  % (3246296)CaDiCaL version: 2.1.3
% 10.97/2.56  % (3246296)Termination reason: Instruction limit
% 10.97/2.56  % (3246296)Termination phase: Saturation
% 10.97/2.56  % (3246296)Time elapsed: 0.108 s
% 10.97/2.56  % (3246296)Peak memory usage: 89 MB
% 10.97/2.56  % (3246296)Instructions burned: 181 (million)
% 10.97/2.56  % (3246297)Instruction limit reached! 
% 10.97/2.56  % (3246297)------------------------------
% 10.97/2.56  % (3246297)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.56  % (3246297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.56  % (3246297)CaDiCaL version: 2.1.3
% 10.97/2.56  % (3246297)Termination reason: Instruction limit
% 10.97/2.56  % (3246297)Termination phase: Saturation
% 10.97/2.56  % (3246297)Time elapsed: 0.160 s
% 10.97/2.56  % (3246297)Peak memory usage: 90 MB
% 10.97/2.56  % (3246297)Instructions burned: 257 (million)
% 10.97/2.56  % (3246306)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3550886057:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 10.97/2.56  % (3246308)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1184773987:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 10.97/2.56  % (3246309)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1685867902:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 10.97/2.56  % (3246309)Instruction limit reached! 
% 10.97/2.56  % (3246309)------------------------------
% 10.97/2.56  % (3246309)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.56  % (3246309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.56  % (3246309)CaDiCaL version: 2.1.3
% 10.97/2.56  % (3246309)Termination reason: Instruction limit
% 10.97/2.56  % (3246309)Termination phase: Saturation
% 10.97/2.56  % (3246309)Time elapsed: 0.109 s
% 10.97/2.57  % (3246309)Peak memory usage: 91 MB
% 10.97/2.57  % (3246309)Instructions burned: 216 (million)
% 10.97/2.57  % (3246378)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=1028881366:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 10.97/2.57  % (3246298)Instruction limit reached! 
% 10.97/2.57  % (3246298)------------------------------
% 10.97/2.57  % (3246298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.57  % (3246298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.57  % (3246298)CaDiCaL version: 2.1.3
% 10.97/2.57  % (3246298)Termination reason: Instruction limit
% 10.97/2.57  % (3246298)Termination phase: Saturation
% 10.97/2.57  % (3246298)Time elapsed: 0.644 s
% 10.97/2.57  % (3246298)Peak memory usage: 101 MB
% 10.97/2.57  % (3246298)Instructions burned: 1188 (million)
% 10.97/2.57  % (3246378)Instruction limit reached! 
% 10.97/2.57  % (3246378)------------------------------
% 10.97/2.57  % (3246378)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.97/2.57  % (3246378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.97/2.57  % (3246378)CaDiCaL version: 2.1.3
% 10.97/2.57  % (3246378)Termination reason: Instruction limit
% 10.97/2.57  % (3246378)Termination phase: Saturation
% 10.97/2.57  % (3246378)Time elapsed: 0.192 s
% 10.97/2.57  % (3246378)Peak memory usage: 93 MB
% 10.97/2.57  % (3246378)Instructions burned: 318 (million)
% 10.97/2.57  % (3246465)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=2815403021:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 10.97/2.57  % (3246468)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=2705194727:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 10.97/2.57  % (3246292)First to succeed.
% 10.97/2.57  % (3246292)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3246269"
% 10.97/2.57  % (3246292)Refutation found. Thanks to Tanya!
% 10.97/2.57  % SZS status Unsatisfiable for theBenchmark
% 10.97/2.57  % SZS output start Proof for theBenchmark
% See solution above
% 11.59/2.77  % (3246292)------------------------------
% 11.59/2.77  % (3246292)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.59/2.77  % (3246292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.59/2.77  % (3246292)CaDiCaL version: 2.1.3
% 11.59/2.77  % (3246292)Termination reason: Refutation
% 11.59/2.77  % (3246292)Time elapsed: 1.153 s
% 11.59/2.77  % (3246292)Peak memory usage: 143 MB
% 11.59/2.77  % (3246292)Instructions burned: 2158 (million)
% 11.59/2.77  % (3246292)------------------------------
% 11.59/2.77  % (3246292)------------------------------
% 11.59/2.77  % (3246269)Success in time 1.531 s
% 11.59/2.77  % Vampire exiting
%------------------------------------------------------------------------------