%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM002_2 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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 09:40:04 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 22 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
state: $tType ).
tff(type_def_6,type,
label: $tType ).
tff(type_def_7,type,
statement: $tType ).
tff(type_def_8,type,
register: $tType ).
tff(type_def_9,type,
number: $tType ).
tff(type_def_10,type,
boolean: $tType ).
tff(func_def_0,type,
p1: state ).
tff(func_def_1,type,
p2: state ).
tff(func_def_2,type,
p3: state ).
tff(func_def_3,type,
p4: state ).
tff(func_def_4,type,
p5: state ).
tff(func_def_5,type,
p6: state ).
tff(func_def_6,type,
p7: state ).
tff(func_def_7,type,
p8: state ).
tff(func_def_8,type,
n: number ).
tff(func_def_9,type,
n0: number ).
tff(func_def_10,type,
n1: number ).
tff(func_def_11,type,
n2: number ).
tff(func_def_12,type,
register_j: register ).
tff(func_def_13,type,
register_k: register ).
tff(func_def_14,type,
out: label ).
tff(func_def_15,type,
loop: label ).
tff(func_def_16,type,
equal_function: ( register * number ) > boolean ).
tff(func_def_17,type,
assign: ( register * number ) > statement ).
tff(func_def_18,type,
goto: label > statement ).
tff(func_def_19,type,
ifthen: ( boolean * state ) > statement ).
tff(func_def_20,type,
plus: ( register * number ) > number ).
tff(func_def_21,type,
times: ( number * register ) > number ).
tff(pred_def_1,type,
follows: ( state * state ) > $o ).
tff(pred_def_2,type,
fails: ( state * state ) > $o ).
tff(pred_def_3,type,
labels: ( label * state ) > $o ).
tff(pred_def_4,type,
has: ( state * statement ) > $o ).
tff(f1,axiom,
! [X0: state,X1: state] :
~ ( fails(X1,X0)
& follows(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
tff(f2,axiom,
! [X0: state,X1: state,X2: state] :
( fails(X2,X1)
=> ( fails(X2,X0)
| fails(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f3,axiom,
! [X0: label,X1: state,X2: state] :
~ ( fails(X2,X1)
& has(X1,goto(X0))
& labels(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
tff(f8,axiom,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(f13,axiom,
follows(p6,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(f15,axiom,
follows(p7,p6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(f17,axiom,
follows(p8,p7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
tff(f18,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(f19,conjecture,
~ fails(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f20,negated_conjecture,
~ ~ fails(p3,p3),
inference(negated_conjecture,[status(cth)],[f19]) ).
tff(f21,plain,
fails(p3,p3),
inference(flattening,[],[f20]) ).
tff(f22,plain,
! [X0: state,X1: state] :
( ~ fails(X1,X0)
| ~ follows(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f23,plain,
! [X0: state,X1: state,X2: state] :
( fails(X2,X0)
| fails(X0,X1)
| ~ fails(X2,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f24,plain,
! [X0: state,X1: state,X2: state] :
( fails(X2,X0)
| fails(X0,X1)
| ~ fails(X2,X1) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
! [X0: label,X1: state,X2: state] :
( ~ fails(X2,X1)
| ~ has(X1,goto(X0))
| ~ labels(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
tff(f27,plain,
! [X0: state,X1: state] :
( ~ fails(X1,X0)
| ~ follows(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f28,plain,
! [X2: state,X0: state,X1: state] :
( ~ fails(X2,X1)
| fails(X0,X1)
| fails(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f29,plain,
! [X2: state,X0: label,X1: state] :
( ~ has(X1,goto(X0))
| ~ fails(X2,X1)
| ~ labels(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
tff(f34,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tff(f39,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f41,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tff(f43,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tff(f44,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tff(f45,plain,
fails(p3,p3),
inference(cnf_transformation,[],[f21]) ).
tff(f48,plain,
! [X0: state] :
( fails(X0,p3)
| fails(p3,X0) ),
inference(resolution,[],[f28,f45]) ).
tff(f52,plain,
! [X0: state,X1: state] :
( fails(X0,p3)
| fails(X1,X0)
| fails(p3,X1) ),
inference(resolution,[],[f48,f28]) ).
tff(f56,plain,
! [X0: state] :
( ~ labels(loop,X0)
| ~ fails(X0,p8) ),
inference(resolution,[],[f29,f44]) ).
tff(f59,plain,
~ fails(p3,p8),
inference(resolution,[],[f56,f34]) ).
tff(f68,plain,
! [X0: state,X1: state] :
( ~ follows(X0,X1)
| fails(p3,X0)
| fails(X1,p3) ),
inference(resolution,[],[f52,f27]) ).
tff(f94,plain,
( fails(p3,p8)
| fails(p7,p3) ),
inference(resolution,[],[f68,f43]) ).
tff(f95,plain,
fails(p7,p3),
inference(forward_subsumption_resolution,[],[f94,f59]) ).
tff(f115,plain,
! [X0: state] :
( fails(X0,p3)
| fails(p7,X0) ),
inference(resolution,[],[f95,f28]) ).
tff(f210,plain,
! [X0: state] :
( ~ follows(X0,p3)
| fails(p7,X0) ),
inference(resolution,[],[f115,f27]) ).
tff(f251,plain,
fails(p7,p6),
inference(resolution,[],[f210,f39]) ).
tff(f254,plain,
~ follows(p7,p6),
inference(resolution,[],[f251,f27]) ).
tff(f255,plain,
$false,
inference(forward_subsumption_resolution,[],[f254,f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM002_2 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n005.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 21:42:32 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.08/0.24 % (1218122)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (1218132)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1107302241:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.24 % (1218132) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1218122-1218132"...
% 0.08/0.24 % (1218132)...printing done.
% 0.08/0.24 % (1218132)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (1218132)------------------------------
% 0.08/0.24 % (1218132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (1218132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (1218132)CaDiCaL version: 2.1.3
% 0.08/0.24 % (1218132)Termination reason: Refutation
% 0.08/0.24 % (1218132)Time elapsed: 0.003 s
% 0.08/0.24 % (1218132)Peak memory usage: 11 MB
% 0.08/0.24 % (1218132)Instructions burned: 7 (million)
% 0.08/0.24 % (1218122)Success in time 0.024 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------