%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN549+1 : 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 : n006.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:17:34 PM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 108 ( 8 unt; 10 def)
% Number of atoms : 383 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 451 ( 176 ~; 202 |; 55 &)
% ( 12 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 108 ( 0 sgn 73 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X0,X1)
& reachable(X1,X2) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f3,conjecture,
? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<~> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) )
& reachable(X0,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f9,definition,
! [X1] :
( sP0(X1)
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f10,definition,
! [X1] :
( ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<~> sP0(X1) )
| ~ sP1(X1) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f11,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( sP1(X1)
& reachable(X0,X1) ) ),
inference(definition_folding,[],[f8,f10,f9]) ).
fof(f12,plain,
! [X1] :
( ( ( ~ sP0(X1)
| ! [X2] :
( ~ reachable(X1,X2)
| ( ~ p(X2)
& ! [X3] :
( ~ reachable(X2,X3)
| ~ q(X3) ) ) ) )
& ( sP0(X1)
| ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) ) ) )
| ~ sP1(X1) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ~ reachable(X0,X1)
| ( ~ p(X1)
& ! [X2] :
( ~ reachable(X1,X2)
| ~ q(X2) ) ) ) )
& ( sP0(X0)
| ? [X3] :
( reachable(X0,X3)
& ( p(X3)
| ? [X4] :
( reachable(X3,X4)
& q(X4) ) ) ) ) )
| ~ sP1(X0) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ~ reachable(X0,X1)
| ( ~ p(X1)
& ! [X2] :
( ~ reachable(X1,X2)
| ~ q(X2) ) ) ) )
& ( sP0(X0)
| ( reachable(X0,sK2(X0))
& ( p(sK2(X0))
| ( reachable(sK2(X0),sK3(X0))
& q(sK3(X0)) ) ) ) ) )
| ~ sP1(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0)),skolemize(X4,sK3(X0))],[f13]) ).
fof(f15,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ reachable(X1,X5)
| ~ q(X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) )
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ reachable(X1,X5)
| ~ q(X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) )
| ~ sP0(X1) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ reachable(X0,X2)
| ~ q(X2) ) ) )
& ( ? [X3] :
( reachable(X0,X3)
& p(X3) )
| ? [X4] :
( reachable(X0,X4)
& q(X4) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ reachable(X0,X2)
| ~ q(X2) ) ) )
& ( ( reachable(X0,sK4(X0))
& p(sK4(X0)) )
| ( reachable(X0,sK5(X0))
& q(sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X3,sK4(X0)),skolemize(X4,sK5(X0))],[f17]) ).
fof(f19,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f11]) ).
fof(f20,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ reachable(X0,X1)
| reachable(X0,X2)
| ~ reachable(X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,plain,
! [X0] :
( ~ sP1(X0)
| p(sK2(X0))
| q(sK3(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0] :
( ~ sP1(X0)
| p(sK2(X0))
| reachable(sK2(X0),sK3(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0] :
( ~ sP1(X0)
| reachable(X0,sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ sP1(X0)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| ~ q(X2)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f26,plain,
! [X0,X1] :
( ~ sP0(X0)
| ~ reachable(X0,X1)
| ~ p(X1)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0] :
( ~ sP0(X0)
| q(sK5(X0))
| p(sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X0] :
( ~ sP0(X0)
| reachable(X0,sK5(X0))
| p(sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0] :
( ~ sP0(X0)
| q(sK5(X0))
| reachable(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X0] :
( ~ sP0(X0)
| reachable(X0,sK5(X0))
| reachable(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X2,X0] :
( ~ q(X2)
| ~ reachable(X0,X2)
| sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( ~ p(X1)
| ~ reachable(X0,X1)
| sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| sP1(sK6(X0)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
! [X0,X1] :
( ~ sP1(X0)
| ~ p(X1)
| ~ reachable(X0,X1) ),
inference(forward_subsumption_resolution,[],[f26,f32]) ).
fof(f37,plain,
sP1(sK6(initial_world)),
inference(resolution,[],[f20,f34]) ).
fof(f40,plain,
! [X0] :
( ~ p(X0)
| ~ reachable(sK6(initial_world),X0) ),
inference(resolution,[],[f35,f37]) ).
fof(f42,plain,
( reachable(sK6(initial_world),sK2(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(resolution,[],[f24,f37]) ).
fof(f54,definition,
( spl7_3
<=> sP0(sK6(initial_world)) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f55,plain,
( ~ sP0(sK6(initial_world))
| spl7_3 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f56,plain,
( sP0(sK6(initial_world))
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f58,definition,
( spl7_4
<=> reachable(sK6(initial_world),sK2(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f60,plain,
( reachable(sK6(initial_world),sK2(sK6(initial_world)))
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f61,plain,
( spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f42,f58,f54]) ).
fof(f62,plain,
( q(sK5(sK6(initial_world)))
| p(sK4(sK6(initial_world)))
| ~ spl7_3 ),
inference(resolution,[],[f27,f56]) ).
fof(f64,definition,
( spl7_5
<=> p(sK4(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f65,plain,
( ~ p(sK4(sK6(initial_world)))
| spl7_5 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f66,plain,
( p(sK4(sK6(initial_world)))
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f68,definition,
( spl7_6
<=> q(sK5(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
fof(f70,plain,
( q(sK5(sK6(initial_world)))
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f71,plain,
( spl7_5
| spl7_6
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f62,f54,f68,f64]) ).
fof(f77,plain,
( ~ reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ spl7_5 ),
inference(resolution,[],[f40,f66]) ).
fof(f78,plain,
( q(sK5(sK6(initial_world)))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ spl7_3 ),
inference(resolution,[],[f29,f56]) ).
fof(f79,plain,
( q(sK5(sK6(initial_world)))
| ~ spl7_3
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f78,f77]) ).
fof(f80,plain,
( spl7_6
| ~ spl7_3
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f79,f64,f54,f68]) ).
fof(f82,plain,
( p(sK2(sK6(initial_world)))
| q(sK3(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(resolution,[],[f22,f37]) ).
fof(f94,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ spl7_3 ),
inference(resolution,[],[f30,f56]) ).
fof(f95,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ spl7_3
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f94,f77]) ).
fof(f97,plain,
( p(sK2(sK6(initial_world)))
| reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(resolution,[],[f23,f37]) ).
fof(f104,plain,
! [X0,X1] :
( ~ reachable(sK6(initial_world),X0)
| ~ reachable(X0,X1)
| ~ q(X1)
| ~ sP0(sK6(initial_world)) ),
inference(resolution,[],[f25,f37]) ).
fof(f110,plain,
( ! [X0,X1] :
( ~ q(X1)
| ~ reachable(X0,X1)
| ~ reachable(sK6(initial_world),X0) )
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f104,f56]) ).
fof(f117,plain,
( ! [X0] :
( ~ reachable(X0,sK5(sK6(initial_world)))
| ~ reachable(sK6(initial_world),X0) )
| ~ spl7_3
| ~ spl7_6 ),
inference(resolution,[],[f110,f70]) ).
fof(f344,plain,
( ~ reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ spl7_3
| ~ spl7_6 ),
inference(resolution,[],[f117,f20]) ).
fof(f349,plain,
( $false
| ~ spl7_3
| ~ spl7_5
| ~ spl7_6 ),
inference(forward_subsumption_resolution,[],[f344,f95]) ).
fof(f350,plain,
( ~ spl7_3
| ~ spl7_5
| ~ spl7_6 ),
inference(avatar_contradiction_clause,[],[f349]) ).
fof(f351,plain,
( p(sK2(sK6(initial_world)))
| q(sK3(sK6(initial_world)))
| spl7_3 ),
inference(forward_subsumption_resolution,[],[f82,f55]) ).
fof(f352,plain,
( p(sK2(sK6(initial_world)))
| reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| spl7_3 ),
inference(forward_subsumption_resolution,[],[f97,f55]) ).
fof(f354,definition,
( spl7_45
<=> q(sK3(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_45])],[avatar_definition]) ).
fof(f356,plain,
( q(sK3(sK6(initial_world)))
| ~ spl7_45 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f358,definition,
( spl7_46
<=> p(sK2(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_46])],[avatar_definition]) ).
fof(f360,plain,
( p(sK2(sK6(initial_world)))
| ~ spl7_46 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f361,plain,
( spl7_45
| spl7_46
| spl7_3 ),
inference(avatar_split_clause,[],[f351,f54,f358,f354]) ).
fof(f363,definition,
( spl7_47
<=> reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_47])],[avatar_definition]) ).
fof(f365,plain,
( reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| ~ spl7_47 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f366,plain,
( spl7_47
| spl7_46
| spl7_3 ),
inference(avatar_split_clause,[],[f352,f54,f358,f363]) ).
fof(f368,plain,
( ~ reachable(sK6(initial_world),sK2(sK6(initial_world)))
| ~ spl7_46 ),
inference(resolution,[],[f360,f40]) ).
fof(f370,plain,
( $false
| ~ spl7_4
| ~ spl7_46 ),
inference(forward_subsumption_resolution,[],[f368,f60]) ).
fof(f371,plain,
( ~ spl7_4
| ~ spl7_46 ),
inference(avatar_contradiction_clause,[],[f370]) ).
fof(f372,plain,
( ! [X0] :
( ~ reachable(X0,sK3(sK6(initial_world)))
| sP0(X0) )
| ~ spl7_45 ),
inference(resolution,[],[f356,f31]) ).
fof(f374,plain,
( ! [X0] :
( ~ reachable(sK2(sK6(initial_world)),X0)
| reachable(sK6(initial_world),X0) )
| ~ spl7_4 ),
inference(resolution,[],[f60,f21]) ).
fof(f469,plain,
( reachable(sK6(initial_world),sK3(sK6(initial_world)))
| ~ spl7_4
| ~ spl7_47 ),
inference(resolution,[],[f374,f365]) ).
fof(f584,plain,
( sP0(sK6(initial_world))
| ~ spl7_4
| ~ spl7_45
| ~ spl7_47 ),
inference(resolution,[],[f469,f372]) ).
fof(f586,plain,
( $false
| spl7_3
| ~ spl7_4
| ~ spl7_45
| ~ spl7_47 ),
inference(forward_subsumption_resolution,[],[f584,f55]) ).
fof(f587,plain,
( spl7_3
| ~ spl7_4
| ~ spl7_45
| ~ spl7_47 ),
inference(avatar_contradiction_clause,[],[f586]) ).
fof(f588,plain,
( ! [X0,X1] :
( ~ q(X1)
| ~ reachable(X0,X1)
| ~ reachable(sK6(initial_world),X0) )
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f104,f56]) ).
fof(f591,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| p(sK4(sK6(initial_world)))
| ~ spl7_3 ),
inference(resolution,[],[f56,f28]) ).
fof(f593,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ spl7_3
| spl7_5 ),
inference(forward_subsumption_resolution,[],[f591,f65]) ).
fof(f599,definition,
( spl7_81
<=> reachable(sK6(initial_world),sK5(sK6(initial_world))) ),
introduced(definition,[new_symbols(definition,[spl7_81])],[avatar_definition]) ).
fof(f601,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ spl7_81 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f603,plain,
( spl7_81
| ~ spl7_3
| spl7_5 ),
inference(avatar_split_clause,[],[f593,f64,f54,f599]) ).
fof(f604,plain,
( ! [X0] :
( ~ reachable(X0,sK5(sK6(initial_world)))
| ~ reachable(sK6(initial_world),X0) )
| ~ spl7_3
| ~ spl7_6 ),
inference(resolution,[],[f588,f70]) ).
fof(f651,plain,
( ~ reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ spl7_3
| ~ spl7_6 ),
inference(resolution,[],[f604,f20]) ).
fof(f656,plain,
( $false
| ~ spl7_3
| ~ spl7_6
| ~ spl7_81 ),
inference(forward_subsumption_resolution,[],[f651,f601]) ).
fof(f657,plain,
( ~ spl7_3
| ~ spl7_6
| ~ spl7_81 ),
inference(avatar_contradiction_clause,[],[f656]) ).
cnf(s2,plain,
( spl7_3
| spl7_4 ),
inference(sat_conversion,[],[f61]) ).
cnf(s3,plain,
( ~ spl7_3
| spl7_5
| spl7_6 ),
inference(sat_conversion,[],[f71]) ).
cnf(s4,plain,
( ~ spl7_3
| ~ spl7_5
| spl7_6 ),
inference(sat_conversion,[],[f80]) ).
cnf(s37,plain,
( ~ spl7_3
| ~ spl7_5
| ~ spl7_6 ),
inference(sat_conversion,[],[f350]) ).
cnf(s38,plain,
( spl7_3
| spl7_45
| spl7_46 ),
inference(sat_conversion,[],[f361]) ).
cnf(s39,plain,
( spl7_3
| spl7_46
| spl7_47 ),
inference(sat_conversion,[],[f366]) ).
cnf(s40,plain,
( ~ spl7_4
| ~ spl7_46 ),
inference(sat_conversion,[],[f371]) ).
cnf(s71,plain,
( spl7_3
| ~ spl7_4
| ~ spl7_45
| ~ spl7_47 ),
inference(sat_conversion,[],[f587]) ).
cnf(s73,plain,
( ~ spl7_3
| spl7_5
| spl7_81 ),
inference(sat_conversion,[],[f603]) ).
cnf(s79,plain,
( ~ spl7_3
| ~ spl7_6
| ~ spl7_81 ),
inference(sat_conversion,[],[f657]) ).
cnf(s80,plain,
spl7_3,
inference(rat,[],[s71,s38,s39,s40,s2]) ).
cnf(s81,plain,
spl7_5,
inference(rat,[],[s79,s3,s73,s80]) ).
cnf(s82,plain,
~ spl7_6,
inference(rat,[],[s37,s80,s81]) ).
cnf(s83,plain,
$false,
inference(rat,[],[s4,s80,s82,s81]) ).
fof(f658,plain,
$false,
inference(avatar_sat_refutation,[],[s83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n006.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 16:28:10 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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
% 0.20/0.29 % (4094533)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (4094543)dis+10_1_sil=32000:sp=arity:random_seed=822651347:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (4094541)% WARNING: option uhcvi not known.
% 0.20/0.29 % (4094540)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=603075384_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (4094541)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2134646123:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (4094546)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2595888314:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (4094542)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1847239053:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (4094544)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3668260160:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (4094547)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2245947114:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % TRYING [1]
% 0.20/0.29 % TRYING [2]
% 0.20/0.29 % TRYING [3]
% 0.20/0.29 % TRYING [4]
% 0.20/0.29 % (4094546) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4094533-4094546"...
% 0.20/0.29 % (4094546)...printing done.
% 0.20/0.29 % (4094546)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (4094546)------------------------------
% 0.20/0.29 % (4094546)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (4094546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (4094546)CaDiCaL version: 2.1.3
% 0.20/0.29 % (4094546)Termination reason: Refutation
% 0.20/0.29 % (4094546)Time elapsed: 0.009 s
% 0.20/0.29 % (4094546)Peak memory usage: 12 MB
% 0.20/0.29 % (4094546)Instructions burned: 10 (million)
% 0.20/0.29 % (4094533)Success in time 0.046 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------