%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET609+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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 12:44:08 PM UTC 2026
% Result : Theorem 2.33s 0.83s
% Output : Refutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of formulae : 136 ( 24 unt; 12 def)
% Number of atoms : 337 ( 30 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 343 ( 142 ~; 166 |; 23 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 93 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f9,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f10,conjecture,
! [X0,X1,X2] : difference(X0,difference(X1,X2)) = union(difference(X0,X1),intersection(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th81) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] : difference(X0,difference(X1,X2)) = union(difference(X0,X1),intersection(X0,X2)),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f13,plain,
? [X0,X1,X2] : difference(X0,difference(X1,X2)) != union(difference(X0,X1),intersection(X0,X2)),
inference(ennf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f26]) ).
fof(f28,plain,
difference(sK2,difference(sK3,sK4)) != union(difference(sK2,sK3),intersection(sK2,sK4)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f13]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| X0 = X1
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
difference(sK2,difference(sK3,sK4)) != union(difference(sK2,sK3),intersection(sK2,sK4)),
inference(cnf_transformation,[],[f28]) ).
fof(f56,definition,
sF5 = difference(sK3,sK4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f57,plain,
difference(sK3,sK4) = sF5,
inference(reorient_equations,[],[f56]) ).
fof(f58,definition,
sF6 = difference(sK2,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f59,plain,
difference(sK2,sF5) = sF6,
inference(reorient_equations,[],[f58]) ).
fof(f60,definition,
sF7 = difference(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f61,plain,
difference(sK2,sK3) = sF7,
inference(reorient_equations,[],[f60]) ).
fof(f62,definition,
sF8 = intersection(sK2,sK4),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f63,plain,
intersection(sK2,sK4) = sF8,
inference(reorient_equations,[],[f62]) ).
fof(f64,definition,
sF9 = union(sF7,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f65,plain,
union(sF7,sF8) = sF9,
inference(reorient_equations,[],[f64]) ).
fof(f66,plain,
sF6 != sF9,
inference(definition_folding,[],[f51,f65,f63,f61,f59,f57]) ).
fof(f67,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sF9) ),
inference(superposition,[],[f30,f65]) ).
fof(f70,plain,
! [X0] :
( ~ member(X0,sF7)
| member(X0,sF9) ),
inference(superposition,[],[f31,f65]) ).
fof(f73,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sK4) ),
inference(superposition,[],[f32,f63]) ).
fof(f76,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sK2) ),
inference(superposition,[],[f33,f63]) ).
fof(f79,plain,
! [X0] :
( ~ member(X0,sF5)
| ~ member(X0,sK4) ),
inference(superposition,[],[f35,f57]) ).
fof(f80,plain,
! [X0] :
( ~ member(X0,sF6)
| ~ member(X0,sF5) ),
inference(superposition,[],[f35,f59]) ).
fof(f81,plain,
! [X0] :
( ~ member(X0,sF7)
| ~ member(X0,sK3) ),
inference(superposition,[],[f35,f61]) ).
fof(f82,plain,
! [X0] :
( ~ member(X0,sF5)
| member(X0,sK3) ),
inference(superposition,[],[f36,f57]) ).
fof(f83,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sK2) ),
inference(superposition,[],[f36,f59]) ).
fof(f84,plain,
! [X0] :
( ~ member(X0,sF7)
| member(X0,sK2) ),
inference(superposition,[],[f36,f61]) ).
fof(f93,plain,
! [X0] :
( ~ member(X0,sF9)
| member(X0,sF8)
| member(X0,sF7) ),
inference(superposition,[],[f29,f65]) ).
fof(f99,plain,
! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK2)
| member(X0,sF8) ),
inference(superposition,[],[f34,f63]) ).
fof(f105,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,sF5)
| member(X0,sK4) ),
inference(superposition,[],[f37,f57]) ).
fof(f106,plain,
! [X0] :
( ~ member(X0,sK2)
| member(X0,sF6)
| member(X0,sF5) ),
inference(superposition,[],[f37,f59]) ).
fof(f107,plain,
! [X0] :
( ~ member(X0,sK2)
| member(X0,sF7)
| member(X0,sK3) ),
inference(superposition,[],[f37,f61]) ).
fof(f117,plain,
! [X0] :
( member(sK1(X0,sF6),sK2)
| member(sK1(X0,sF6),X0)
| sF6 = X0 ),
inference(resolution,[],[f49,f83]) ).
fof(f143,plain,
! [X0] :
( member(sK1(sF9,X0),sF8)
| member(sK1(sF9,X0),X0)
| sF9 = X0
| member(sK1(sF9,X0),sF7) ),
inference(resolution,[],[f49,f93]) ).
fof(f1665,plain,
( member(sK1(sF9,sF6),sK2)
| sF6 = sF9
| member(sK1(sF9,sF6),sF8)
| member(sK1(sF9,sF6),sF7) ),
inference(resolution,[],[f117,f93]) ).
fof(f1674,plain,
( member(sK1(sF9,sF6),sK2)
| member(sK1(sF9,sF6),sF8)
| member(sK1(sF9,sF6),sF7) ),
inference(forward_subsumption_resolution,[],[f1665,f66]) ).
fof(f1684,plain,
( member(sK1(sF9,sF6),sK2)
| member(sK1(sF9,sF6),sF7) ),
inference(forward_subsumption_resolution,[],[f1674,f76]) ).
fof(f1693,plain,
member(sK1(sF9,sF6),sK2),
inference(forward_subsumption_resolution,[],[f1684,f84]) ).
fof(f2071,plain,
( member(sK1(sF9,sF6),sF7)
| member(sK1(sF9,sF6),sK3) ),
inference(resolution,[],[f1693,f107]) ).
fof(f2072,plain,
( member(sK1(sF9,sF6),sF6)
| member(sK1(sF9,sF6),sF5) ),
inference(resolution,[],[f1693,f106]) ).
fof(f2098,definition,
( spl10_50
<=> member(sK1(sF9,sF6),sF5) ),
introduced(definition,[new_symbols(definition,[spl10_50])],[avatar_definition]) ).
fof(f2099,plain,
( ~ member(sK1(sF9,sF6),sF5)
| spl10_50 ),
inference(avatar_component_clause,[],[f2098]) ).
fof(f2100,plain,
( member(sK1(sF9,sF6),sF5)
| ~ spl10_50 ),
inference(avatar_component_clause,[],[f2098]) ).
fof(f2102,definition,
( spl10_51
<=> member(sK1(sF9,sF6),sF6) ),
introduced(definition,[new_symbols(definition,[spl10_51])],[avatar_definition]) ).
fof(f2104,plain,
( member(sK1(sF9,sF6),sF6)
| ~ spl10_51 ),
inference(avatar_component_clause,[],[f2102]) ).
fof(f2105,plain,
( spl10_50
| spl10_51 ),
inference(avatar_split_clause,[],[f2072,f2102,f2098]) ).
fof(f2107,definition,
( spl10_52
<=> member(sK1(sF9,sF6),sK3) ),
introduced(definition,[new_symbols(definition,[spl10_52])],[avatar_definition]) ).
fof(f2108,plain,
( ~ member(sK1(sF9,sF6),sK3)
| spl10_52 ),
inference(avatar_component_clause,[],[f2107]) ).
fof(f2109,plain,
( member(sK1(sF9,sF6),sK3)
| ~ spl10_52 ),
inference(avatar_component_clause,[],[f2107]) ).
fof(f2111,definition,
( spl10_53
<=> member(sK1(sF9,sF6),sF7) ),
introduced(definition,[new_symbols(definition,[spl10_53])],[avatar_definition]) ).
fof(f2112,plain,
( ~ member(sK1(sF9,sF6),sF7)
| spl10_53 ),
inference(avatar_component_clause,[],[f2111]) ).
fof(f2113,plain,
( member(sK1(sF9,sF6),sF7)
| ~ spl10_53 ),
inference(avatar_component_clause,[],[f2111]) ).
fof(f2114,plain,
( spl10_52
| spl10_53 ),
inference(avatar_split_clause,[],[f2071,f2111,f2107]) ).
fof(f2175,plain,
( member(sK1(sF9,sF6),sK3)
| ~ spl10_50 ),
inference(resolution,[],[f2100,f82]) ).
fof(f2176,plain,
( ~ member(sK1(sF9,sF6),sK4)
| ~ spl10_50 ),
inference(resolution,[],[f2100,f79]) ).
fof(f2990,definition,
( spl10_113
<=> member(sK1(sF9,sF6),sK4) ),
introduced(definition,[new_symbols(definition,[spl10_113])],[avatar_definition]) ).
fof(f2991,plain,
( ~ member(sK1(sF9,sF6),sK4)
| spl10_113 ),
inference(avatar_component_clause,[],[f2990]) ).
fof(f2992,plain,
( member(sK1(sF9,sF6),sK4)
| ~ spl10_113 ),
inference(avatar_component_clause,[],[f2990]) ).
fof(f2995,definition,
( spl10_114
<=> member(sK1(sF9,sF6),sF8) ),
introduced(definition,[new_symbols(definition,[spl10_114])],[avatar_definition]) ).
fof(f2997,plain,
( member(sK1(sF9,sF6),sF8)
| ~ spl10_114 ),
inference(avatar_component_clause,[],[f2995]) ).
fof(f3000,definition,
( spl10_115
<=> member(sK1(sF9,sF6),sF9) ),
introduced(definition,[new_symbols(definition,[spl10_115])],[avatar_definition]) ).
fof(f3001,plain,
( ~ member(sK1(sF9,sF6),sF9)
| spl10_115 ),
inference(avatar_component_clause,[],[f3000]) ).
fof(f3002,plain,
( member(sK1(sF9,sF6),sF9)
| ~ spl10_115 ),
inference(avatar_component_clause,[],[f3000]) ).
fof(f3004,plain,
( $false
| ~ spl10_50
| spl10_52 ),
inference(forward_subsumption_resolution,[],[f2175,f2108]) ).
fof(f3005,plain,
( ~ spl10_50
| spl10_52 ),
inference(avatar_contradiction_clause,[],[f3004]) ).
fof(f3006,plain,
( ~ spl10_113
| ~ spl10_50 ),
inference(avatar_split_clause,[],[f2176,f2098,f2990]) ).
fof(f3202,plain,
( sF6 = sF9
| ~ member(sK1(sF9,sF6),sF9)
| ~ spl10_51 ),
inference(resolution,[],[f2104,f50]) ).
fof(f3207,plain,
( ~ member(sK1(sF9,sF6),sF9)
| ~ spl10_51 ),
inference(forward_subsumption_resolution,[],[f3202,f66]) ).
fof(f3209,plain,
( $false
| ~ spl10_51
| ~ spl10_115 ),
inference(forward_subsumption_resolution,[],[f3207,f3002]) ).
fof(f3210,plain,
( ~ spl10_51
| ~ spl10_115 ),
inference(avatar_contradiction_clause,[],[f3209]) ).
fof(f3372,plain,
( ~ member(sK1(sF9,sF6),sK3)
| ~ spl10_53 ),
inference(resolution,[],[f2113,f81]) ).
fof(f3373,plain,
( member(sK1(sF9,sF6),sF9)
| ~ spl10_53 ),
inference(resolution,[],[f2113,f70]) ).
fof(f3375,plain,
( $false
| ~ spl10_53
| spl10_115 ),
inference(forward_subsumption_resolution,[],[f3373,f3001]) ).
fof(f3376,plain,
( ~ spl10_53
| spl10_115 ),
inference(avatar_contradiction_clause,[],[f3375]) ).
fof(f3399,plain,
( member(sK1(sF9,sF6),sF5)
| member(sK1(sF9,sF6),sK4)
| ~ spl10_52 ),
inference(resolution,[],[f2109,f105]) ).
fof(f3930,plain,
( member(sK1(sF9,sF6),sF8)
| sF6 = sF9
| member(sK1(sF9,sF6),sF7)
| ~ member(sK1(sF9,sF6),sF5) ),
inference(resolution,[],[f143,f80]) ).
fof(f5291,plain,
( ~ member(sK1(sF9,sF6),sK2)
| member(sK1(sF9,sF6),sF8)
| ~ spl10_113 ),
inference(resolution,[],[f2992,f99]) ).
fof(f5302,plain,
( member(sK1(sF9,sF6),sF8)
| ~ spl10_113 ),
inference(forward_subsumption_resolution,[],[f5291,f1693]) ).
fof(f5316,plain,
( member(sK1(sF9,sF6),sK4)
| spl10_50
| ~ spl10_52 ),
inference(forward_subsumption_resolution,[],[f3399,f2099]) ).
fof(f5550,plain,
( $false
| spl10_50
| ~ spl10_52
| spl10_113 ),
inference(forward_subsumption_resolution,[],[f5316,f2991]) ).
fof(f5551,plain,
( spl10_50
| ~ spl10_52
| spl10_113 ),
inference(avatar_contradiction_clause,[],[f5550]) ).
fof(f5557,plain,
( spl10_114
| ~ spl10_113 ),
inference(avatar_split_clause,[],[f5302,f2990,f2995]) ).
fof(f5795,plain,
( member(sK1(sF9,sF6),sK4)
| ~ spl10_114 ),
inference(resolution,[],[f2997,f73]) ).
fof(f5796,plain,
( member(sK1(sF9,sF6),sF9)
| ~ spl10_114 ),
inference(resolution,[],[f2997,f67]) ).
fof(f5802,plain,
( $false
| ~ spl10_114
| spl10_115 ),
inference(forward_subsumption_resolution,[],[f5796,f3001]) ).
fof(f5803,plain,
( ~ spl10_114
| spl10_115 ),
inference(avatar_contradiction_clause,[],[f5802]) ).
fof(f5804,plain,
( member(sK1(sF9,sF6),sF8)
| member(sK1(sF9,sF6),sF7)
| ~ member(sK1(sF9,sF6),sF5) ),
inference(forward_subsumption_resolution,[],[f3930,f66]) ).
fof(f5805,plain,
( member(sK1(sF9,sF6),sF8)
| ~ member(sK1(sF9,sF6),sF5)
| spl10_53 ),
inference(forward_subsumption_resolution,[],[f5804,f2112]) ).
fof(f5806,plain,
( member(sK1(sF9,sF6),sF8)
| ~ spl10_50
| spl10_53 ),
inference(forward_subsumption_resolution,[],[f5805,f2100]) ).
fof(f5807,plain,
( spl10_114
| ~ spl10_50
| spl10_53 ),
inference(avatar_split_clause,[],[f5806,f2111,f2098,f2995]) ).
fof(f5808,plain,
( $false
| spl10_113
| ~ spl10_114 ),
inference(forward_subsumption_resolution,[],[f5795,f2991]) ).
fof(f5809,plain,
( spl10_113
| ~ spl10_114 ),
inference(avatar_contradiction_clause,[],[f5808]) ).
fof(f5810,plain,
( $false
| ~ spl10_52
| ~ spl10_53 ),
inference(forward_subsumption_resolution,[],[f3372,f2109]) ).
fof(f5811,plain,
( ~ spl10_52
| ~ spl10_53 ),
inference(avatar_contradiction_clause,[],[f5810]) ).
cnf(s39,plain,
( spl10_50
| spl10_51 ),
inference(sat_conversion,[],[f2105]) ).
cnf(s40,plain,
( spl10_52
| spl10_53 ),
inference(sat_conversion,[],[f2114]) ).
cnf(s138,plain,
( ~ spl10_50
| spl10_52 ),
inference(sat_conversion,[],[f3005]) ).
cnf(s139,plain,
( ~ spl10_50
| ~ spl10_113 ),
inference(sat_conversion,[],[f3006]) ).
cnf(s152,plain,
( ~ spl10_51
| ~ spl10_115 ),
inference(sat_conversion,[],[f3210]) ).
cnf(s168,plain,
( ~ spl10_53
| spl10_115 ),
inference(sat_conversion,[],[f3376]) ).
cnf(s244,plain,
( spl10_50
| ~ spl10_52
| spl10_113 ),
inference(sat_conversion,[],[f5551]) ).
cnf(s247,plain,
( ~ spl10_113
| spl10_114 ),
inference(sat_conversion,[],[f5557]) ).
cnf(s257,plain,
( ~ spl10_114
| spl10_115 ),
inference(sat_conversion,[],[f5803]) ).
cnf(s260,plain,
( ~ spl10_50
| spl10_53
| spl10_114 ),
inference(sat_conversion,[],[f5807]) ).
cnf(s261,plain,
( spl10_113
| ~ spl10_114 ),
inference(sat_conversion,[],[f5809]) ).
cnf(s262,plain,
( ~ spl10_52
| ~ spl10_53 ),
inference(sat_conversion,[],[f5811]) ).
cnf(s263,plain,
spl10_50,
inference(rat,[],[s244,s40,s247,s168,s257,s152,s39]) ).
cnf(s265,plain,
~ spl10_113,
inference(rat,[],[s139,s263]) ).
cnf(s266,plain,
spl10_52,
inference(rat,[],[s138,s263]) ).
cnf(s270,plain,
~ spl10_114,
inference(rat,[],[s261,s265]) ).
cnf(s272,plain,
~ spl10_53,
inference(rat,[],[s262,s266]) ).
cnf(s274,plain,
$false,
inference(rat,[],[s260,s263,s270,s272]) ).
fof(f5812,plain,
$false,
inference(avatar_sat_refutation,[],[s274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET609+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37 % Computer : n003.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 02:20:26 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 Running first-order model finding
% 0.13/0.40 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
% 2.33/0.83 % (1124823)Will run a generic schedule for satisfiability detection.
% 2.33/0.83 % (1124833)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2348682228:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.33/0.83 % (1124829)% WARNING: option uhcvi not known.
% 2.33/0.83 % (1124828)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3971549610_2999 on theBenchmark for (2999ds/0Mi)
% 2.33/0.83 % (1124830)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2680038117:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.33/0.83 % (1124831)dis+10_1_sil=32000:sp=arity:random_seed=2638361279:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.33/0.83 % (1124834)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2351367081:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.33/0.83 % (1124832)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1356219143:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.33/0.83 % (1124829)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2342616604:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.33/0.83 % TRYING [1]
% 2.33/0.83 % TRYING [2]
% 2.33/0.83 % TRYING [3]
% 2.33/0.83 % TRYING [4]
% 2.33/0.83 % (1124833)Instruction limit reached!
% 2.33/0.83 % (1124833)------------------------------
% 2.33/0.83 % (1124833)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124833)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124833)Termination reason: Instruction limit
% 2.33/0.83 % (1124833)Termination phase: Saturation
% 2.33/0.83 % (1124833)Time elapsed: 0.042 s
% 2.33/0.83 % (1124833)Peak memory usage: 12 MB
% 2.33/0.83 % (1124833)Instructions burned: 133 (million)
% 2.33/0.83 % (1124842)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1757830139:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.33/0.83 % TRYING [1]
% 2.33/0.83 % TRYING [2]
% 2.33/0.83 % TRYING [3]
% 2.33/0.83 % TRYING [4]
% 2.33/0.83 % (1124831)Instruction limit reached!
% 2.33/0.83 % (1124831)------------------------------
% 2.33/0.83 % (1124831)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124831)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124831)Termination reason: Instruction limit
% 2.33/0.83 % (1124831)Termination phase: Saturation
% 2.33/0.83 % (1124831)Time elapsed: 0.062 s
% 2.33/0.83 % (1124831)Peak memory usage: 12 MB
% 2.33/0.83 % (1124831)Instructions burned: 103 (million)
% 2.33/0.83 % (1124832)Instruction limit reached!
% 2.33/0.83 % (1124832)------------------------------
% 2.33/0.83 % (1124832)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124832)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124832)Termination reason: Instruction limit
% 2.33/0.83 % (1124832)Termination phase: Saturation
% 2.33/0.83 % (1124832)Time elapsed: 0.064 s
% 2.33/0.83 % (1124832)Peak memory usage: 12 MB
% 2.33/0.83 % (1124832)Instructions burned: 116 (million)
% 2.33/0.83 % TRYING [5]
% 2.33/0.83 % TRYING [5]
% 2.33/0.83 % (1124844)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1957170252:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.33/0.83 % (1124845)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=4107105619:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.33/0.83 % (1124834)Instruction limit reached!
% 2.33/0.83 % (1124834)------------------------------
% 2.33/0.83 % (1124834)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124834)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124834)Termination reason: Instruction limit
% 2.33/0.83 % (1124834)Termination phase: Saturation
% 2.33/0.83 % (1124834)Time elapsed: 0.096 s
% 2.33/0.83 % (1124834)Peak memory usage: 12 MB
% 2.33/0.83 % (1124834)Instructions burned: 161 (million)
% 2.33/0.83 % (1124848)ott-21_1_sil=16000:fs=off:random_seed=1223423686:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.33/0.83 % (1124844)Instruction limit reached!
% 2.33/0.83 % (1124844)------------------------------
% 2.33/0.83 % (1124844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124844)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124844)Termination reason: Instruction limit
% 2.33/0.83 % (1124844)Termination phase: Saturation
% 2.33/0.83 % (1124844)Time elapsed: 0.080 s
% 2.33/0.83 % (1124844)Peak memory usage: 12 MB
% 2.33/0.83 % (1124844)Instructions burned: 132 (million)
% 2.33/0.83 % (1124850)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3585201870:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.33/0.83 % (1124848)Instruction limit reached!
% 2.33/0.83 % (1124848)------------------------------
% 2.33/0.83 % (1124848)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124848)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124848)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124848)Termination reason: Instruction limit
% 2.33/0.83 % (1124848)Termination phase: Saturation
% 2.33/0.83 % (1124848)Time elapsed: 0.088 s
% 2.33/0.83 % (1124848)Peak memory usage: 13 MB
% 2.33/0.83 % (1124848)Instructions burned: 180 (million)
% 2.33/0.83 % (1124852)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2480831010:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.33/0.83 % TRYING [1]
% 2.33/0.83 % TRYING [2]
% 2.33/0.83 % TRYING [3]
% 2.33/0.83 % TRYING [4]
% 2.33/0.83 % TRYING [5]
% 2.33/0.83 % (1124842)Instruction limit reached!
% 2.33/0.83 % (1124842)------------------------------
% 2.33/0.83 % (1124842)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124842)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124842)Termination reason: Instruction limit
% 2.33/0.83 % (1124842)Termination phase: Finite model building SAT solving
% 2.33/0.83 % (1124842)Time elapsed: 0.230 s
% 2.33/0.83 % (1124842)Peak memory usage: 13 MB
% 2.33/0.83 % (1124842)Instructions burned: 716 (million)
% 2.33/0.83 % (1124854)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3144341025:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.33/0.83 % (1124854) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1124823-1124854"...
% 2.33/0.83 % (1124854)...printing done.
% 2.33/0.83 % (1124854)Refutation found. Thanks to Tanya!
% 2.33/0.83 % SZS status Theorem for theBenchmark
% 2.33/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 2.33/0.83 % (1124854)------------------------------
% 2.33/0.83 % (1124854)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/0.83 % (1124854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/0.83 % (1124854)CaDiCaL version: 2.1.3
% 2.33/0.83 % (1124854)Termination reason: Refutation
% 2.33/0.83 % (1124854)Time elapsed: 0.094 s
% 2.33/0.83 % (1124854)Peak memory usage: 15 MB
% 2.33/0.83 % (1124854)Instructions burned: 310 (million)
% 2.33/0.83 % (1124823)Success in time 0.418 s
% 2.33/0.83 % Vampire exiting
%------------------------------------------------------------------------------