%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:32 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 17 unt; 0 def)
% Number of atoms : 57 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 14 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 18 ( 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] : capital(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',capital_type) ).
fof(f2,axiom,
? [X0] : city(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',city_type) ).
fof(f3,axiom,
! [X0] :
( capital(X0)
=> city(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',capital_city_type) ).
fof(f4,axiom,
? [X0] : country(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',country_type) ).
fof(f5,axiom,
capital(washington),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_type) ).
fof(f6,axiom,
country(usa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_type) ).
fof(f7,axiom,
! [X0] :
( country(X0)
=> capital(capital_city(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',country_capital_type) ).
fof(f8,axiom,
! [X0] :
( city(X0)
=> has_crime(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crime_axiom) ).
fof(f9,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_capital_axiom) ).
fof(f10,axiom,
! [X0] :
( country(X0)
=> beautiful(capital_city(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
fof(f11,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_conjecture) ).
fof(f12,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] :
( city(X0)
| ~ capital(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f14,plain,
! [X0] :
( capital(capital_city(X0))
| ~ country(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0] :
( has_crime(X0)
| ~ city(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0] :
( beautiful(capital_city(X0))
| ~ country(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f17,plain,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
capital(sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).
fof(f19,plain,
city(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f2]) ).
fof(f20,plain,
country(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f4]) ).
fof(f21,plain,
capital(sK0),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
city(sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f23,plain,
! [X0] :
( city(X0)
| ~ capital(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
country(sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f25,plain,
capital(washington),
inference(cnf_transformation,[],[f5]) ).
fof(f26,plain,
country(usa),
inference(cnf_transformation,[],[f6]) ).
fof(f27,plain,
! [X0] :
( capital(capital_city(X0))
| ~ country(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X0] :
( has_crime(X0)
| ~ city(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
washington = capital_city(usa),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
! [X0] :
( beautiful(capital_city(X0))
| ~ country(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
~ city(sK1),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f33,plain,
! [X0] :
( ~ city(X0)
| ~ capital(X0) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f34,plain,
! [X0] :
( ~ has_crime(X0)
| city(X0) ),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f35,plain,
! [X0] :
( ~ beautiful(capital_city(X0))
| ~ country(X0) ),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f36,plain,
( beautiful(washington)
| has_crime(washington) ),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f53,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f21,f32,f33,f24,f25,f26,f27,f34,f29,f35,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n017.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 22:40:20 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47 % (3020021)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3020042)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=608887590_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % TRYING [1]
% 0.18/0.47 % TRYING [2]
% 0.18/0.47 % TRYING [3]
% 0.18/0.47 % TRYING [4]
% 0.18/0.47 % TRYING [5]
% 0.18/0.47 % (3020042) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3020021-3020042"...
% 0.18/0.47 % (3020042)...printing done.
% 0.18/0.47 % (3020042)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (3020042)------------------------------
% 0.18/0.47 % (3020042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (3020042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (3020042)CaDiCaL version: 2.1.3
% 0.18/0.47 % (3020042)Termination reason: Refutation
% 0.18/0.47 % (3020042)Time elapsed: 0.001 s
% 0.18/0.47 % (3020042)Peak memory usage: 11 MB
% 0.18/0.47 % (3020042)Instructions burned: 3 (million)
% 0.18/0.47 % (3020021)Success in time 0.035 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------