%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM002_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 21 ~; 18 |; 2 &)
% ( 0 <=>; 3 =>; 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 : 34 ( 34 !; 0 ?; 34 :)
% 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,
succeeds: ( 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] :
( follows(X1,X0)
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
tff(f2,axiom,
! [X0: state,X1: state,X2: state] :
( ( succeeds(X2,X1)
& succeeds(X1,X0) )
=> succeeds(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f3,axiom,
! [X0: state,X1: label,X2: state] :
( ( has(X2,goto(X1))
& labels(X1,X0) )
=> succeeds(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
tff(f8,axiom,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
tff(f13,axiom,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(f15,axiom,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(f17,axiom,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
tff(f18,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
tff(f19,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f20,negated_conjecture,
~ succeeds(p3,p3),
inference(negated_conjecture,[status(cth)],[f19]) ).
tff(f21,plain,
~ succeeds(p3,p3),
inference(flattening,[],[f20]) ).
tff(f22,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f23,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X2,X1)
| ~ succeeds(X1,X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f24,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X2,X1)
| ~ succeeds(X1,X0) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ has(X2,goto(X1))
| ~ labels(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f26,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ has(X2,goto(X1))
| ~ labels(X1,X0) ),
inference(flattening,[],[f25]) ).
tff(f28,plain,
! [X0: state,X1: state] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f29,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X2,X1)
| succeeds(X2,X0)
| ~ succeeds(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f30,plain,
! [X2: state,X0: state,X1: label] :
( ~ has(X2,goto(X1))
| succeeds(X0,X2)
| ~ labels(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
tff(f35,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tff(f40,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f42,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tff(f44,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tff(f45,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tff(f46,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f21]) ).
tff(f50,plain,
succeeds(p6,p3),
inference(resolution,[],[f28,f40]) ).
tff(f51,plain,
succeeds(p7,p6),
inference(resolution,[],[f28,f42]) ).
tff(f52,plain,
succeeds(p8,p7),
inference(resolution,[],[f28,f44]) ).
tff(f58,plain,
! [X0: state] :
( ~ succeeds(p6,X0)
| succeeds(p7,X0) ),
inference(resolution,[],[f51,f29]) ).
tff(f60,plain,
! [X0: state] :
( ~ labels(loop,X0)
| succeeds(X0,p8) ),
inference(resolution,[],[f30,f45]) ).
tff(f61,plain,
! [X0: state] :
( ~ succeeds(p7,X0)
| succeeds(p8,X0) ),
inference(resolution,[],[f52,f29]) ).
tff(f63,plain,
succeeds(p3,p8),
inference(resolution,[],[f60,f35]) ).
tff(f64,plain,
! [X0: state] :
( ~ succeeds(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[],[f63,f29]) ).
tff(f72,plain,
succeeds(p7,p3),
inference(resolution,[],[f58,f50]) ).
tff(f81,plain,
succeeds(p8,p3),
inference(resolution,[],[f72,f61]) ).
tff(f98,plain,
succeeds(p3,p3),
inference(resolution,[],[f81,f64]) ).
tff(f100,plain,
$false,
inference(forward_subsumption_resolution,[],[f98,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM002_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n018.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 21:44:41 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.10/0.25 % (3821896)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (3821905)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2782051261:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (3821901)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4269036168_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25 % (3821907)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1483545705:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25 % (3821903)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3159666614:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25 % (3821904)dis+10_1_sil=32000:sp=arity:random_seed=2647604314:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25 % (3821906)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=939682195:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25 % TRYING [1]
% 0.10/0.25 % (3821904) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3821896-3821904"...
% 0.10/0.25 % (3821906) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3821896-3821906"...
% 0.10/0.25 % TRYING [2]
% 0.10/0.25 % TRYING [3]
% 0.10/0.25 % (3821904)...printing done.
% 0.10/0.25 % TRYING [4]
% 0.10/0.25 % (3821906)...printing done.
% 0.10/0.25 % (3821903) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3821896-3821903"...
% 0.10/0.25 % (3821904)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (3821904)------------------------------
% 0.10/0.25 % (3821904)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (3821904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (3821904)CaDiCaL version: 2.1.3
% 0.10/0.25 % (3821904)Termination reason: Refutation
% 0.10/0.25 % (3821904)Time elapsed: 0.002 s
% 0.10/0.25 % (3821904)Peak memory usage: 11 MB
% 0.10/0.25 % (3821904)Instructions burned: 2 (million)
% 0.10/0.25 % (3821896)Success in time 0.037 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------