%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n016.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:38:58 AM UTC 2026
% Result : Theorem 3.45s 1.25s
% Output : Refutation 3.45s
% 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 : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 24 ~; 21 |; 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: label,X1: state,X2: state] :
( ~ fails(X2,X1)
| ~ has(X1,goto(X0))
| ~ labels(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
tff(f24,plain,
! [X0: state,X1: state,X2: state] :
( fails(X2,X0)
| fails(X0,X1)
| ~ fails(X2,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f25,plain,
! [X0: state,X1: state,X2: state] :
( fails(X2,X0)
| fails(X0,X1)
| ~ fails(X2,X1) ),
inference(flattening,[],[f24]) ).
tff(f26,plain,
! [X0: state,X1: state] :
( ~ fails(X1,X0)
| ~ follows(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f30,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tff(f35,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f37,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tff(f39,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tff(f40,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tff(f41,plain,
fails(p3,p3),
inference(cnf_transformation,[],[f21]) ).
tff(f42,plain,
! [X2: state,X0: label,X1: state] :
( ~ has(X1,goto(X0))
| ~ fails(X2,X1)
| ~ labels(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
tff(f44,plain,
! [X2: state,X0: state,X1: state] :
( ~ fails(X2,X1)
| fails(X0,X1)
| fails(X2,X0) ),
inference(cnf_transformation,[],[f25]) ).
tff(f45,plain,
! [X0: state,X1: state] :
( ~ fails(X1,X0)
| ~ follows(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
tff(f47,plain,
! [X0: state] :
( fails(p3,X0)
| fails(X0,p3) ),
inference(resolution,[],[f41,f44]) ).
tff(f49,plain,
! [X0: state,X1: state] :
( fails(p3,X1)
| fails(X1,X0)
| fails(X0,p3) ),
inference(resolution,[],[f47,f44]) ).
tff(f60,plain,
! [X0: state] :
( ~ labels(loop,X0)
| ~ fails(X0,p8) ),
inference(resolution,[],[f40,f42]) ).
tff(f70,plain,
~ fails(p3,p8),
inference(resolution,[],[f60,f30]) ).
tff(f72,plain,
! [X0: state] :
( fails(p8,X0)
| fails(X0,p3) ),
inference(resolution,[],[f70,f49]) ).
tff(f76,plain,
! [X0: state] :
( ~ follows(p8,X0)
| fails(X0,p3) ),
inference(resolution,[],[f72,f45]) ).
tff(f87,plain,
fails(p7,p3),
inference(resolution,[],[f76,f39]) ).
tff(f93,plain,
! [X0: state] :
( fails(p7,X0)
| fails(X0,p3) ),
inference(resolution,[],[f87,f44]) ).
tff(f104,plain,
! [X0: state] :
( ~ follows(p7,X0)
| fails(X0,p3) ),
inference(resolution,[],[f93,f45]) ).
tff(f110,plain,
fails(p6,p3),
inference(resolution,[],[f104,f37]) ).
tff(f112,plain,
~ follows(p6,p3),
inference(resolution,[],[f110,f45]) ).
tff(f114,plain,
$false,
inference(forward_subsumption_resolution,[],[f112,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM002_2 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n016.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 21:47:34 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/1.25 % (4061540)Detected formulas, will run a generic FOF schedule.
% 3.45/1.25 % (4061545)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2706556141:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.45/1.25 % (4061549)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3583215765:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.45/1.25 % (4061550)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3843947942:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.45/1.25 % (4061551)dis-21_1_sil=8000:lcm=predicate:random_seed=3149438709:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.45/1.25 % (4061548)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1171760678:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.45/1.25 % (4061546)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2435594121:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.45/1.25 % (4061547)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1806040849:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.45/1.25 % (4061548)First to succeed.
% 3.45/1.25 % (4061548)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4061540"
% 3.45/1.25 % (4061549)Also succeeded, but the first one will report.
% 3.45/1.25 % (4061550)Also succeeded, but the first one will report.
% 3.45/1.25 % (4061551)Also succeeded, but the first one will report.
% 3.45/1.25 % (4061548)Refutation found. Thanks to Tanya!
% 3.45/1.25 % SZS status Theorem for theBenchmark
% 3.45/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.45/1.25 % (4061548)------------------------------
% 3.45/1.25 % (4061548)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.25 % (4061548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.25 % (4061548)CaDiCaL version: 2.1.3
% 3.45/1.25 % (4061548)Termination reason: Refutation
% 3.45/1.25 % (4061548)Time elapsed: 0.003 s
% 3.45/1.25 % (4061548)Peak memory usage: 88 MB
% 3.45/1.25 % (4061548)Instructions burned: 3 (million)
% 3.45/1.25 % (4061548)------------------------------
% 3.45/1.25 % (4061548)------------------------------
% 3.45/1.25 % (4061540)Success in time 0.401 s
% 3.45/1.25 % Vampire exiting
%------------------------------------------------------------------------------