%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NLP267_5 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:09:47 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 45 ( 20 ~; 16 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 29 ( 29 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 21 !; 1 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_6,type,
sK0: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
price: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
dest: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
class: ( '$ki_world' * $i ) > $o ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f3,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ( dest(X0,paris)
& class(X0,second) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> dest(X0,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> class(X0,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f12]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f19,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f20,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f21,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f20]) ).
tff(f22,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f13]) ).
tff(f27,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f28,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f30,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f21]) ).
tff(f31,plain,
! [X0: '$ki_world'] : dest(X0,paris),
inference(forward_subsumption_resolution,[],[f27,f22]) ).
tff(f32,plain,
! [X0: '$ki_world'] : class(X0,second),
inference(forward_subsumption_resolution,[],[f28,f22]) ).
tff(f36,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(forward_subsumption_resolution,[],[f24,f31]) ).
tff(f37,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(forward_subsumption_resolution,[],[f36,f32]) ).
tff(f38,plain,
! [X0: '$ki_world'] : price(X0,seventy),
inference(forward_subsumption_resolution,[],[f37,f22]) ).
tff(f39,plain,
$false,
inference(resolution,[],[f38,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP267_5 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 18:39:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.44 % (3674460)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3674468)dis+10_1_sil=32000:sp=arity:random_seed=1857130713:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.44 % (3674468) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3674460-3674468"...
% 0.11/0.44 % (3674468)...printing done.
% 0.11/0.44 % (3674466)% WARNING: option uhcvi not known.
% 0.11/0.44 % (3674468)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (3674468)------------------------------
% 0.11/0.44 % (3674468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3674468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3674468)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3674468)Termination reason: Refutation
% 0.11/0.44 % (3674468)Time elapsed: 0.001 s
% 0.11/0.44 % (3674468)Peak memory usage: 11 MB
% 0.11/0.44 % (3674468)Instructions burned: 1 (million)
% 0.11/0.44 % (3674460)Success in time 0.033 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------