%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM001_1 : 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 : n010.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.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 19 ~; 16 |; 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 : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 32 ( 32 !; 0 ?; 32 :)
% 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,
p3: state ).
tff(func_def_1,type,
p4: state ).
tff(func_def_2,type,
p5: state ).
tff(func_def_3,type,
p8: state ).
tff(func_def_4,type,
n: number ).
tff(func_def_5,type,
register_j: register ).
tff(func_def_6,type,
out: label ).
tff(func_def_7,type,
loop: label ).
tff(func_def_8,type,
equal_function: ( register * number ) > boolean ).
tff(func_def_9,type,
goto: label > statement ).
tff(func_def_10,type,
ifthen: ( boolean * state ) > statement ).
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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',goto_success) ).
tff(f5,axiom,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(f9,axiom,
follows(p8,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
tff(f10,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(f11,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f12,negated_conjecture,
~ succeeds(p3,p3),
inference(negated_conjecture,[status(cth)],[f11]) ).
tff(f13,plain,
~ succeeds(p3,p3),
inference(flattening,[],[f12]) ).
tff(f14,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f15,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X2,X1)
| ~ succeeds(X1,X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f16,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X2,X1)
| ~ succeeds(X1,X0) ),
inference(flattening,[],[f15]) ).
tff(f17,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ has(X2,goto(X1))
| ~ labels(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f18,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ has(X2,goto(X1))
| ~ labels(X1,X0) ),
inference(flattening,[],[f17]) ).
tff(f20,plain,
! [X0: state,X1: state] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f14]) ).
tff(f21,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X2,X1)
| succeeds(X2,X0)
| ~ succeeds(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f22,plain,
! [X2: state,X0: state,X1: label] :
( ~ has(X2,goto(X1))
| succeeds(X0,X2)
| ~ labels(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f24,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f5]) ).
tff(f28,plain,
follows(p8,p3),
inference(cnf_transformation,[],[f9]) ).
tff(f29,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f10]) ).
tff(f30,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f32,plain,
succeeds(p8,p3),
inference(resolution,[],[f20,f28]) ).
tff(f38,plain,
! [X0: state] :
( ~ labels(loop,X0)
| succeeds(X0,p8) ),
inference(resolution,[],[f22,f29]) ).
tff(f39,plain,
succeeds(p3,p8),
inference(resolution,[],[f38,f24]) ).
tff(f40,plain,
! [X0: state] :
( ~ succeeds(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[],[f39,f21]) ).
tff(f48,plain,
succeeds(p3,p3),
inference(resolution,[],[f40,f32]) ).
tff(f50,plain,
$false,
inference(forward_subsumption_resolution,[],[f48,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM001_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n010.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 21:42:48 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.24 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.09/0.26 % (2387616)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2387624)dis+10_1_sil=32000:sp=arity:random_seed=1384844051:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.09/0.26 % (2387624) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2387616-2387624"...
% 0.09/0.26 % (2387624)...printing done.
% 0.09/0.26 % (2387624)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (2387624)------------------------------
% 0.09/0.26 % (2387624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (2387624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (2387624)CaDiCaL version: 2.1.3
% 0.09/0.26 % (2387624)Termination reason: Refutation
% 0.09/0.26 % (2387624)Time elapsed: 0.001 s
% 0.09/0.26 % (2387624)Peak memory usage: 11 MB
% 0.09/0.26 % (2387624)Instructions burned: 1 (million)
% 0.09/0.26 % (2387616)Success in time 0.015 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------