%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT114+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:04:40 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of formulae : 82 ( 27 unt; 4 def)
% Number of atoms : 356 ( 48 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 459 ( 185 ~; 191 |; 72 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 113 ( 0 sgn 97 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( odrl_rel(X0)
=> ( ? [X3] :
( permission(X3)
& part_of(X3,X0)
& cnt(X3,X1,X2)
& ! [X4] :
( ( permission(X4)
& part_of(X4,X0)
& cnt(X4,X1,X2) )
=> X4 = X3 ) )
<=> ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X1,X2)
& ! [X6] :
( ( no_right(X6)
& part_of(X6,X0)
& cnt(X6,X1,X2) )
=> X6 = X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_correlativity_permission) ).
fof(f6,axiom,
odrl_rel(rho1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl_rho1) ).
fof(f7,axiom,
permission(l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permission_l) ).
fof(f8,axiom,
no_right(n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_right_n1) ).
fof(f9,axiom,
no_right(n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_right_n2) ).
fof(f10,axiom,
part_of(l,rho1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partof_l) ).
fof(f11,axiom,
part_of(n1,rho1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partof_n1) ).
fof(f12,axiom,
part_of(n2,rho1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partof_n2) ).
fof(f13,axiom,
cnt(l,some_action,some_target),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cnt_l) ).
fof(f14,axiom,
cnt(n1,some_action,some_target),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cnt_n1) ).
fof(f15,axiom,
cnt(n2,some_action,some_target),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cnt_n2) ).
fof(f18,axiom,
n1 != n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n1_neq_n2) ).
fof(f19,axiom,
! [X0] :
( ( permission(X0)
& part_of(X0,rho1)
& cnt(X0,some_action,some_target) )
=> X0 = l ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',perm_l_unique) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( permission(X3)
& part_of(X3,X0)
& cnt(X3,X1,X2)
& ! [X4] :
( X4 = X3
| ~ permission(X4)
| ~ part_of(X4,X0)
| ~ cnt(X4,X1,X2) ) )
<=> ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X1,X2)
& ! [X6] :
( X6 = X5
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X1,X2) ) ) )
| ~ odrl_rel(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( permission(X3)
& part_of(X3,X0)
& cnt(X3,X1,X2)
& ! [X4] :
( X4 = X3
| ~ permission(X4)
| ~ part_of(X4,X0)
| ~ cnt(X4,X1,X2) ) )
<=> ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X1,X2)
& ! [X6] :
( X6 = X5
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X1,X2) ) ) )
| ~ odrl_rel(X0) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0] :
( X0 = l
| ~ permission(X0)
| ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target) ),
inference(ennf_transformation,[],[f19]) ).
fof(f29,plain,
! [X0] :
( X0 = l
| ~ permission(X0)
| ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target) ),
inference(flattening,[],[f28]) ).
fof(f30,definition,
! [X0,X2,X1] :
( sP0(X0,X2,X1)
<=> ? [X3] :
( permission(X3)
& part_of(X3,X0)
& cnt(X3,X1,X2)
& ! [X4] :
( X4 = X3
| ~ permission(X4)
| ~ part_of(X4,X0)
| ~ cnt(X4,X1,X2) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f31,definition,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
<=> ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X1,X2)
& ! [X6] :
( X6 = X5
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X1,X2) ) ) )
| ~ sP1(X0,X2,X1) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f32,plain,
! [X0,X1,X2] :
( sP1(X0,X2,X1)
| ~ odrl_rel(X0) ),
inference(definition_folding,[],[f27,f31,f30]) ).
fof(f33,plain,
! [X0,X2,X1] :
( ( ( sP0(X0,X2,X1)
| ! [X5] :
( ~ no_right(X5)
| ~ part_of(X5,X0)
| ~ cnt(X5,X1,X2)
| ? [X6] :
( X5 != X6
& no_right(X6)
& part_of(X6,X0)
& cnt(X6,X1,X2) ) ) )
& ( ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X1,X2)
& ! [X6] :
( X6 = X5
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X1,X2) ) )
| ~ sP0(X0,X2,X1) ) )
| ~ sP1(X0,X2,X1) ),
inference(nnf_transformation,[],[f31]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( ( sP0(X0,X1,X2)
| ! [X3] :
( ~ no_right(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| ? [X4] :
( X3 != X4
& no_right(X4)
& part_of(X4,X0)
& cnt(X4,X2,X1) ) ) )
& ( ? [X5] :
( no_right(X5)
& part_of(X5,X0)
& cnt(X5,X2,X1)
& ! [X6] :
( X6 = X5
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X2,X1) ) )
| ~ sP0(X0,X1,X2) ) )
| ~ sP1(X0,X1,X2) ),
inference(rectify,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( ( sP0(X0,X1,X2)
| ! [X3] :
( ~ no_right(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| ( sK2(X0,X1,X2,X3) != X3
& no_right(sK2(X0,X1,X2,X3))
& part_of(sK2(X0,X1,X2,X3),X0)
& cnt(sK2(X0,X1,X2,X3),X2,X1) ) ) )
& ( ( no_right(sK3(X0,X1,X2))
& part_of(sK3(X0,X1,X2),X0)
& cnt(sK3(X0,X1,X2),X2,X1)
& ! [X6] :
( sK3(X0,X1,X2) = X6
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X2,X1) ) )
| ~ sP0(X0,X1,X2) ) )
| ~ sP1(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X4,sK2(X0,X1,X2,X3)),skolemize(X5,sK3(X0,X1,X2))],[f34]) ).
fof(f36,plain,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
| ! [X3] :
( ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X1,X2)
| ? [X4] :
( X3 != X4
& permission(X4)
& part_of(X4,X0)
& cnt(X4,X1,X2) ) ) )
& ( ? [X3] :
( permission(X3)
& part_of(X3,X0)
& cnt(X3,X1,X2)
& ! [X4] :
( X4 = X3
| ~ permission(X4)
| ~ part_of(X4,X0)
| ~ cnt(X4,X1,X2) ) )
| ~ sP0(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ! [X3] :
( ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| ? [X4] :
( X3 != X4
& permission(X4)
& part_of(X4,X0)
& cnt(X4,X2,X1) ) ) )
& ( ? [X5] :
( permission(X5)
& part_of(X5,X0)
& cnt(X5,X2,X1)
& ! [X6] :
( X5 = X6
| ~ permission(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X2,X1) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ! [X3] :
( ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| ( sK4(X0,X1,X2,X3) != X3
& permission(sK4(X0,X1,X2,X3))
& part_of(sK4(X0,X1,X2,X3),X0)
& cnt(sK4(X0,X1,X2,X3),X2,X1) ) ) )
& ( ( permission(sK5(X0,X1,X2))
& part_of(sK5(X0,X1,X2),X0)
& cnt(sK5(X0,X1,X2),X2,X1)
& ! [X6] :
( sK5(X0,X1,X2) = X6
| ~ permission(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X2,X1) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X4,sK4(X0,X1,X2,X3)),skolemize(X5,sK5(X0,X1,X2))],[f37]) ).
fof(f39,plain,
! [X2,X0,X1,X6] :
( ~ sP1(X0,X1,X2)
| ~ no_right(X6)
| ~ part_of(X6,X0)
| ~ cnt(X6,X2,X1)
| ~ sP0(X0,X1,X2)
| sK3(X0,X1,X2) = X6 ),
inference(cnf_transformation,[],[f35]) ).
fof(f51,plain,
! [X2,X3,X0,X1] :
( cnt(sK4(X0,X1,X2,X3),X2,X1)
| ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f52,plain,
! [X2,X3,X0,X1] :
( part_of(sK4(X0,X1,X2,X3),X0)
| ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( permission(sK4(X0,X1,X2,X3))
| ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( sK4(X0,X1,X2,X3) != X3
| ~ permission(X3)
| ~ part_of(X3,X0)
| ~ cnt(X3,X2,X1)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f55,plain,
! [X2,X0,X1] :
( sP1(X0,X2,X1)
| ~ odrl_rel(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f56,plain,
odrl_rel(rho1),
inference(cnf_transformation,[],[f6]) ).
fof(f57,plain,
permission(l),
inference(cnf_transformation,[],[f7]) ).
fof(f58,plain,
no_right(n1),
inference(cnf_transformation,[],[f8]) ).
fof(f59,plain,
no_right(n2),
inference(cnf_transformation,[],[f9]) ).
fof(f60,plain,
part_of(l,rho1),
inference(cnf_transformation,[],[f10]) ).
fof(f61,plain,
part_of(n1,rho1),
inference(cnf_transformation,[],[f11]) ).
fof(f62,plain,
part_of(n2,rho1),
inference(cnf_transformation,[],[f12]) ).
fof(f63,plain,
cnt(l,some_action,some_target),
inference(cnf_transformation,[],[f13]) ).
fof(f64,plain,
cnt(n1,some_action,some_target),
inference(cnf_transformation,[],[f14]) ).
fof(f65,plain,
cnt(n2,some_action,some_target),
inference(cnf_transformation,[],[f15]) ).
fof(f66,plain,
n1 != n2,
inference(cnf_transformation,[],[f18]) ).
fof(f67,plain,
! [X0] :
( ~ cnt(X0,some_action,some_target)
| ~ permission(X0)
| ~ part_of(X0,rho1)
| l = X0 ),
inference(cnf_transformation,[],[f29]) ).
fof(f97,definition,
( spl6_5
<=> sP0(rho1,some_target,some_action) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f98,plain,
( sP0(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f99,plain,
( ~ sP0(rho1,some_target,some_action)
| spl6_5 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f105,plain,
! [X0,X1] :
( ~ permission(X0)
| ~ part_of(X0,X1)
| ~ cnt(X0,some_action,some_target)
| sP0(X1,some_target,some_action)
| ~ permission(sK4(X1,some_target,some_action,X0))
| ~ part_of(sK4(X1,some_target,some_action,X0),rho1)
| l = sK4(X1,some_target,some_action,X0) ),
inference(resolution,[],[f51,f67]) ).
fof(f106,plain,
! [X0,X1] :
( ~ part_of(sK4(X1,some_target,some_action,X0),rho1)
| ~ part_of(X0,X1)
| ~ cnt(X0,some_action,some_target)
| sP0(X1,some_target,some_action)
| ~ permission(X0)
| l = sK4(X1,some_target,some_action,X0) ),
inference(forward_subsumption_resolution,[],[f105,f53]) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X1,X3,X2)
| ~ part_of(X0,X1)
| ~ cnt(X0,X2,X3)
| ~ no_right(X0)
| sK3(X1,X3,X2) = X0
| ~ odrl_rel(X1) ),
inference(resolution,[],[f39,f55]) ).
fof(f111,plain,
! [X0] :
( ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ permission(X0)
| l = sK4(rho1,some_target,some_action,X0)
| ~ permission(X0)
| ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target)
| sP0(rho1,some_target,some_action) ),
inference(resolution,[],[f106,f52]) ).
fof(f112,plain,
! [X0] :
( ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ permission(X0)
| l = sK4(rho1,some_target,some_action,X0) ),
inference(duplicate_literal_removal,[],[f111]) ).
fof(f149,definition,
( spl6_11
<=> ! [X0] :
( ~ part_of(X0,rho1)
| l = sK4(rho1,some_target,some_action,X0)
| ~ permission(X0)
| ~ cnt(X0,some_action,some_target) ) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f150,plain,
( ! [X0] :
( ~ cnt(X0,some_action,some_target)
| l = sK4(rho1,some_target,some_action,X0)
| ~ permission(X0)
| ~ part_of(X0,rho1) )
| ~ spl6_11 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f151,plain,
( spl6_5
| spl6_11 ),
inference(avatar_split_clause,[],[f112,f149,f97]) ).
fof(f153,plain,
( ! [X0] :
( ~ part_of(X0,rho1)
| ~ cnt(X0,some_action,some_target)
| ~ no_right(X0)
| sK3(rho1,some_target,some_action) = X0
| ~ odrl_rel(rho1) )
| ~ spl6_5 ),
inference(resolution,[],[f98,f107]) ).
fof(f155,plain,
( ! [X0] :
( ~ cnt(X0,some_action,some_target)
| ~ part_of(X0,rho1)
| ~ no_right(X0)
| sK3(rho1,some_target,some_action) = X0 )
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f153,f56]) ).
fof(f163,plain,
( ~ part_of(n1,rho1)
| ~ no_right(n1)
| n1 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(resolution,[],[f155,f64]) ).
fof(f164,plain,
( ~ part_of(n2,rho1)
| ~ no_right(n2)
| n2 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(resolution,[],[f155,f65]) ).
fof(f171,plain,
( ~ no_right(n2)
| n2 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f164,f62]) ).
fof(f172,plain,
( ~ no_right(n1)
| n1 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f163,f61]) ).
fof(f174,plain,
( n2 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f171,f59]) ).
fof(f175,plain,
( n1 = sK3(rho1,some_target,some_action)
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f172,f58]) ).
fof(f186,plain,
( n1 = n2
| ~ spl6_5 ),
inference(superposition,[],[f175,f174]) ).
fof(f195,plain,
( $false
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f186,f66]) ).
fof(f196,plain,
~ spl6_5,
inference(avatar_contradiction_clause,[],[f195]) ).
fof(f201,plain,
( l = sK4(rho1,some_target,some_action,l)
| ~ permission(l)
| ~ part_of(l,rho1)
| ~ spl6_11 ),
inference(resolution,[],[f150,f63]) ).
fof(f210,plain,
( l = sK4(rho1,some_target,some_action,l)
| ~ part_of(l,rho1)
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f201,f57]) ).
fof(f211,plain,
( l = sK4(rho1,some_target,some_action,l)
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f210,f60]) ).
fof(f213,plain,
( l != l
| ~ permission(l)
| ~ part_of(l,rho1)
| ~ cnt(l,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ spl6_11 ),
inference(superposition,[],[f54,f211]) ).
fof(f216,plain,
( ~ permission(l)
| ~ part_of(l,rho1)
| ~ cnt(l,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ spl6_11 ),
inference(trivial_inequality_removal,[],[f213]) ).
fof(f217,plain,
( ~ part_of(l,rho1)
| ~ cnt(l,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f216,f57]) ).
fof(f218,plain,
( ~ cnt(l,some_action,some_target)
| sP0(rho1,some_target,some_action)
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f217,f60]) ).
fof(f219,plain,
( sP0(rho1,some_target,some_action)
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f218,f63]) ).
fof(f220,plain,
( $false
| spl6_5
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f219,f99]) ).
fof(f221,plain,
( spl6_5
| ~ spl6_11 ),
inference(avatar_contradiction_clause,[],[f220]) ).
cnf(s7,plain,
( spl6_5
| spl6_11 ),
inference(sat_conversion,[],[f151]) ).
cnf(s11,plain,
~ spl6_5,
inference(sat_conversion,[],[f196]) ).
cnf(s13,plain,
( spl6_5
| ~ spl6_11 ),
inference(sat_conversion,[],[f221]) ).
cnf(s14,plain,
~ spl6_11,
inference(rat,[],[s13,s11]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s7,s14,s11]) ).
fof(f222,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT114+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 17:39:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/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
% 0.11/0.45 % (1054088)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1054095)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=787323138:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (1054094)% WARNING: option uhcvi not known.
% 0.11/0.45 % (1054093)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1759189100_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (1054099)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1039114878:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (1054096)dis+10_1_sil=32000:sp=arity:random_seed=2018116125:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (1054097)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3421794413:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (1054098)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3186065826:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % (1054094)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2302904529:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (1054096) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1054088-1054096"...
% 0.11/0.45 % TRYING [5]
% 0.11/0.45 % (1054098) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1054088-1054098"...
% 0.11/0.45 % (1054096)...printing done.
% 0.11/0.45 % (1054098)...printing done.
% 0.11/0.45 % (1054096)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1054096)------------------------------
% 0.11/0.45 % (1054096)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1054096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1054096)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1054096)Termination reason: Refutation
% 0.11/0.45 % (1054096)Time elapsed: 0.007 s
% 0.11/0.45 % (1054096)Peak memory usage: 12 MB
% 0.11/0.45 % (1054096)Instructions burned: 9 (million)
% 0.11/0.45 % (1054088)Success in time 0.045 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------