%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:32:31 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 50 ( 15 unt; 2 def)
% Number of atoms : 302 ( 74 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 395 ( 143 ~; 112 |; 116 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 124 ( 0 sgn 80 !; 44 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X0] :
( ( person(X0)
& property1(X0,honest,pos)
& property1(X0,industrious,pos) )
=> ? [X1] :
( property1(X1,healthy,pos)
& X0 = X1 ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( property1(X3,healthy,pos)
& X2 = X3 ) )
& ! [X4] :
( ( grocer(X4)
& property1(X4,industrious,pos) )
=> ? [X5] :
( property1(X5,honest,pos)
& X4 = X5 ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( property1(X7,industrious,pos)
& X6 = X7 ) )
& ! [X8] :
( ( cyclist(X8)
& property1(X8,unhealthy,pos) )
=> ? [X9] :
( property1(X9,dishonest,pos)
& X8 = X9 ) )
& ! [X10] :
( ( person(X10)
& property1(X10,healthy,pos) )
=> ~ ? [X11] :
( property1(X11,unhealthy,pos)
& X10 = X11 ) )
& ! [X12] :
( ( person(X12)
& property1(X12,honest,pos) )
=> ~ ? [X13] :
( property1(X13,dishonest,pos)
& X12 = X13 ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( person(X15)
& X14 = X15 ) )
& ! [X16] :
( cyclist(X16)
=> ? [X17] :
( person(X17)
& X16 = X17 ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( cyclist(X19)
& X18 = X19 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0] :
( ( person(X0)
& property1(X0,honest,pos)
& property1(X0,industrious,pos) )
=> ? [X1] :
( property1(X1,healthy,pos)
& X0 = X1 ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( property1(X3,healthy,pos)
& X2 = X3 ) )
& ! [X4] :
( ( grocer(X4)
& property1(X4,industrious,pos) )
=> ? [X5] :
( property1(X5,honest,pos)
& X4 = X5 ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( property1(X7,industrious,pos)
& X6 = X7 ) )
& ! [X8] :
( ( cyclist(X8)
& property1(X8,unhealthy,pos) )
=> ? [X9] :
( property1(X9,dishonest,pos)
& X8 = X9 ) )
& ! [X10] :
( ( person(X10)
& property1(X10,healthy,pos) )
=> ~ ? [X11] :
( property1(X11,unhealthy,pos)
& X10 = X11 ) )
& ! [X12] :
( ( person(X12)
& property1(X12,honest,pos) )
=> ~ ? [X13] :
( property1(X13,dishonest,pos)
& X12 = X13 ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( person(X15)
& X14 = X15 ) )
& ! [X16] :
( cyclist(X16)
=> ? [X17] :
( person(X17)
& X16 = X17 ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( cyclist(X19)
& X18 = X19 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [X18] :
( ? [X19] :
( cyclist(X19)
& X18 = X19 )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( property1(X1,healthy,pos)
& X0 = X1 )
| ~ person(X0)
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos) )
& ! [X2] :
( ! [X3] :
( ~ property1(X3,healthy,pos)
| X2 != X3 )
| ~ grocer(X2) )
& ! [X4] :
( ? [X5] :
( property1(X5,honest,pos)
& X4 = X5 )
| ~ grocer(X4)
| ~ property1(X4,industrious,pos) )
& ! [X6] :
( ? [X7] :
( property1(X7,industrious,pos)
& X6 = X7 )
| ~ cyclist(X6) )
& ! [X8] :
( ? [X9] :
( property1(X9,dishonest,pos)
& X8 = X9 )
| ~ cyclist(X8)
| ~ property1(X8,unhealthy,pos) )
& ! [X10] :
( ! [X11] :
( ~ property1(X11,unhealthy,pos)
| X10 != X11 )
| ~ person(X10)
| ~ property1(X10,healthy,pos) )
& ! [X12] :
( ! [X13] :
( ~ property1(X13,dishonest,pos)
| X12 != X13 )
| ~ person(X12)
| ~ property1(X12,honest,pos) )
& ! [X14] :
( ? [X15] :
( person(X15)
& X14 = X15 )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( person(X17)
& X16 = X17 )
| ~ cyclist(X16) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X18] :
( ? [X19] :
( cyclist(X19)
& X18 = X19 )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( property1(X1,healthy,pos)
& X0 = X1 )
| ~ person(X0)
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos) )
& ! [X2] :
( ! [X3] :
( ~ property1(X3,healthy,pos)
| X2 != X3 )
| ~ grocer(X2) )
& ! [X4] :
( ? [X5] :
( property1(X5,honest,pos)
& X4 = X5 )
| ~ grocer(X4)
| ~ property1(X4,industrious,pos) )
& ! [X6] :
( ? [X7] :
( property1(X7,industrious,pos)
& X6 = X7 )
| ~ cyclist(X6) )
& ! [X8] :
( ? [X9] :
( property1(X9,dishonest,pos)
& X8 = X9 )
| ~ cyclist(X8)
| ~ property1(X8,unhealthy,pos) )
& ! [X10] :
( ! [X11] :
( ~ property1(X11,unhealthy,pos)
| X10 != X11 )
| ~ person(X10)
| ~ property1(X10,healthy,pos) )
& ! [X12] :
( ! [X13] :
( ~ property1(X13,dishonest,pos)
| X12 != X13 )
| ~ person(X12)
| ~ property1(X12,honest,pos) )
& ! [X14] :
( ? [X15] :
( person(X15)
& X14 = X15 )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( person(X17)
& X16 = X17 )
| ~ cyclist(X16) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
( ? [X0] :
( ? [X1] :
( cyclist(X1)
& X0 = X1 )
& grocer(X0) )
& ! [X2] :
( ? [X3] :
( property1(X3,healthy,pos)
& X2 = X3 )
| ~ person(X2)
| ~ property1(X2,honest,pos)
| ~ property1(X2,industrious,pos) )
& ! [X4] :
( ! [X5] :
( ~ property1(X5,healthy,pos)
| X4 != X5 )
| ~ grocer(X4) )
& ! [X6] :
( ? [X7] :
( property1(X7,honest,pos)
& X6 = X7 )
| ~ grocer(X6)
| ~ property1(X6,industrious,pos) )
& ! [X8] :
( ? [X9] :
( property1(X9,industrious,pos)
& X8 = X9 )
| ~ cyclist(X8) )
& ! [X10] :
( ? [X11] :
( property1(X11,dishonest,pos)
& X10 = X11 )
| ~ cyclist(X10)
| ~ property1(X10,unhealthy,pos) )
& ! [X12] :
( ! [X13] :
( ~ property1(X13,unhealthy,pos)
| X12 != X13 )
| ~ person(X12)
| ~ property1(X12,healthy,pos) )
& ! [X14] :
( ! [X15] :
( ~ property1(X15,dishonest,pos)
| X14 != X15 )
| ~ person(X14)
| ~ property1(X14,honest,pos) )
& ! [X16] :
( ? [X17] :
( person(X17)
& X16 = X17 )
| ~ grocer(X16) )
& ! [X18] :
( ? [X19] :
( person(X19)
& X18 = X19 )
| ~ cyclist(X18) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( cyclist(sK1)
& sK0 = sK1
& grocer(sK0)
& ! [X2] :
( ( property1(sK2(X2),healthy,pos)
& sK2(X2) = X2 )
| ~ person(X2)
| ~ property1(X2,honest,pos)
| ~ property1(X2,industrious,pos) )
& ! [X4] :
( ! [X5] :
( ~ property1(X5,healthy,pos)
| X4 != X5 )
| ~ grocer(X4) )
& ! [X6] :
( ( property1(sK3(X6),honest,pos)
& sK3(X6) = X6 )
| ~ grocer(X6)
| ~ property1(X6,industrious,pos) )
& ! [X8] :
( ( property1(sK4(X8),industrious,pos)
& sK4(X8) = X8 )
| ~ cyclist(X8) )
& ! [X10] :
( ( property1(sK5(X10),dishonest,pos)
& sK5(X10) = X10 )
| ~ cyclist(X10)
| ~ property1(X10,unhealthy,pos) )
& ! [X12] :
( ! [X13] :
( ~ property1(X13,unhealthy,pos)
| X12 != X13 )
| ~ person(X12)
| ~ property1(X12,healthy,pos) )
& ! [X14] :
( ! [X15] :
( ~ property1(X15,dishonest,pos)
| X14 != X15 )
| ~ person(X14)
| ~ property1(X14,honest,pos) )
& ! [X16] :
( ( person(sK6(X16))
& sK6(X16) = X16 )
| ~ grocer(X16) )
& ! [X18] :
( ( person(sK7(X18))
& sK7(X18) = X18 )
| ~ cyclist(X18) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X3,sK2(X2)),skolemize(X7,sK3(X6)),skolemize(X9,sK4(X8)),skolemize(X11,sK5(X10)),skolemize(X17,sK6(X16)),skolemize(X19,sK7(X18))],[f5]) ).
fof(f7,plain,
! [X18] :
( ~ cyclist(X18)
| sK7(X18) = X18 ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X18] :
( person(sK7(X18))
| ~ cyclist(X18) ),
inference(cnf_transformation,[],[f6]) ).
fof(f15,plain,
! [X8] :
( ~ cyclist(X8)
| sK4(X8) = X8 ),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X8] :
( property1(sK4(X8),industrious,pos)
| ~ cyclist(X8) ),
inference(cnf_transformation,[],[f6]) ).
fof(f17,plain,
! [X6] :
( ~ property1(X6,industrious,pos)
| ~ grocer(X6)
| sK3(X6) = X6 ),
inference(cnf_transformation,[],[f6]) ).
fof(f18,plain,
! [X6] :
( property1(sK3(X6),honest,pos)
| ~ grocer(X6)
| ~ property1(X6,industrious,pos) ),
inference(cnf_transformation,[],[f6]) ).
fof(f19,plain,
! [X4,X5] :
( ~ property1(X5,healthy,pos)
| X4 != X5
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f6]) ).
fof(f20,plain,
! [X2] :
( ~ property1(X2,industrious,pos)
| ~ person(X2)
| ~ property1(X2,honest,pos)
| sK2(X2) = X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f21,plain,
! [X2] :
( property1(sK2(X2),healthy,pos)
| ~ person(X2)
| ~ property1(X2,honest,pos)
| ~ property1(X2,industrious,pos) ),
inference(cnf_transformation,[],[f6]) ).
fof(f22,plain,
grocer(sK0),
inference(cnf_transformation,[],[f6]) ).
fof(f23,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f6]) ).
fof(f24,plain,
cyclist(sK1),
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
grocer(sK1),
inference(definition_unfolding,[],[f22,f23]) ).
fof(f26,plain,
! [X5] :
( ~ property1(X5,healthy,pos)
| ~ grocer(X5) ),
inference(equality_resolution,[],[f19]) ).
fof(f29,plain,
sK1 = sK7(sK1),
inference(resolution,[],[f7,f24]) ).
fof(f31,plain,
( person(sK1)
| ~ cyclist(sK1) ),
inference(superposition,[],[f8,f29]) ).
fof(f32,plain,
person(sK1),
inference(forward_subsumption_resolution,[],[f31,f24]) ).
fof(f33,plain,
sK1 = sK4(sK1),
inference(resolution,[],[f15,f24]) ).
fof(f35,plain,
( property1(sK1,industrious,pos)
| ~ cyclist(sK1) ),
inference(superposition,[],[f16,f33]) ).
fof(f36,plain,
property1(sK1,industrious,pos),
inference(forward_subsumption_resolution,[],[f35,f24]) ).
fof(f38,plain,
( ~ grocer(sK1)
| sK1 = sK3(sK1) ),
inference(resolution,[],[f17,f36]) ).
fof(f39,plain,
sK1 = sK3(sK1),
inference(forward_subsumption_resolution,[],[f38,f25]) ).
fof(f41,plain,
( property1(sK1,honest,pos)
| ~ grocer(sK1)
| ~ property1(sK1,industrious,pos) ),
inference(superposition,[],[f18,f39]) ).
fof(f42,plain,
( property1(sK1,honest,pos)
| ~ property1(sK1,industrious,pos) ),
inference(forward_subsumption_resolution,[],[f41,f25]) ).
fof(f43,plain,
property1(sK1,honest,pos),
inference(forward_subsumption_resolution,[],[f42,f36]) ).
fof(f45,plain,
( ~ person(sK1)
| ~ property1(sK1,honest,pos)
| sK1 = sK2(sK1) ),
inference(resolution,[],[f20,f36]) ).
fof(f46,plain,
( ~ property1(sK1,honest,pos)
| sK1 = sK2(sK1) ),
inference(forward_subsumption_resolution,[],[f45,f32]) ).
fof(f48,definition,
( spl8_1
<=> sK1 = sK2(sK1) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f50,plain,
( sK1 = sK2(sK1)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f52,definition,
( spl8_2
<=> property1(sK1,honest,pos) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f55,plain,
( spl8_1
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f46,f52,f48]) ).
fof(f56,plain,
! [X0] :
( ~ property1(X0,industrious,pos)
| ~ property1(X0,honest,pos)
| ~ person(X0)
| ~ grocer(sK2(X0)) ),
inference(resolution,[],[f21,f26]) ).
fof(f59,plain,
spl8_2,
inference(avatar_split_clause,[],[f43,f52]) ).
fof(f70,plain,
( ~ property1(sK1,honest,pos)
| ~ person(sK1)
| ~ grocer(sK2(sK1)) ),
inference(resolution,[],[f56,f36]) ).
fof(f71,plain,
( ~ property1(sK1,honest,pos)
| ~ grocer(sK2(sK1)) ),
inference(forward_subsumption_resolution,[],[f70,f32]) ).
fof(f72,plain,
( ~ grocer(sK1)
| ~ property1(sK1,honest,pos)
| ~ spl8_1 ),
inference(forward_demodulation,[],[f71,f50]) ).
fof(f73,plain,
( ~ property1(sK1,honest,pos)
| ~ spl8_1 ),
inference(forward_subsumption_resolution,[],[f72,f25]) ).
fof(f74,plain,
( ~ spl8_2
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f73,f48,f52]) ).
cnf(s1,plain,
( spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s3,plain,
spl8_2,
inference(sat_conversion,[],[f59]) ).
cnf(s5,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f74]) ).
cnf(s6,plain,
~ spl8_1,
inference(rat,[],[s5,s3]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s3,s6]) ).
fof(f75,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n002.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 22:47:37 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.12/0.45 % (3963704)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (3963712)dis+10_1_sil=32000:sp=arity:random_seed=493462614:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.12/0.45 % (3963712) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3963704-3963712"...
% 0.12/0.45 % (3963712)...printing done.
% 0.12/0.45 % (3963710)% WARNING: option uhcvi not known.
% 0.12/0.45 % (3963712)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (3963712)------------------------------
% 0.12/0.45 % (3963712)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (3963712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (3963712)CaDiCaL version: 2.1.3
% 0.12/0.45 % (3963712)Termination reason: Refutation
% 0.12/0.45 % (3963712)Time elapsed: 0.002 s
% 0.12/0.45 % (3963712)Peak memory usage: 12 MB
% 0.12/0.45 % (3963712)Instructions burned: 4 (million)
% 0.12/0.45 % (3963704)Success in time 0.019 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------