%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM001_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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 : Fri Sep 25 01:04:13 PM UTC 2026
% Result : Theorem 1.51s 1.27s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 53 ( 26 ~; 22 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 10 ( 10 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
p3: state ).
tff(pred_def_1,type,
follows: ( state * state ) > $o ).
tff(pred_def_2,type,
succeeds: ( state * state ) > $o ).
tff(pred_def_3,type,
labels: ( state * label ) > $o ).
tff(pred_def_4,type,
has: ( statement * state ) > $o ).
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: ( number * register ) > boolean ).
tff(func_def_9,type,
goto: label > statement ).
tff(func_def_10,type,
ifthen: ( state * boolean ) > statement ).
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(X1,X0)
& succeeds(X2,X1) )
=> succeeds(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f3,axiom,
! [X0: state,X1: label,X2: state] :
( ( labels(X1,X0)
& has(X2,goto(X1)) )
=> succeeds(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
tff(f5,axiom,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
tff(f9,axiom,
follows(p8,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_8) ).
tff(f10,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
tff(f11,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox/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] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f15,plain,
! [X0: state,X1: state,X2: state] :
( ~ succeeds(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f16,plain,
! [X0: state,X1: state,X2: state] :
( ~ succeeds(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(flattening,[],[f15]) ).
tff(f17,plain,
! [X0: state,X1: label,X2: state] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
tff(f18,plain,
! [X0: state,X1: label,X2: state] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
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(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f22,plain,
! [X2: state,X0: state,X1: label] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
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]) ).
tcf(c_49,plain,
! [X0_state: state,X1_state: state] :
( succeeds(X0_state,X1_state)
| ~ follows(X0_state,X1_state) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_50,plain,
! [X0_state: state,X1_state: state,X2_state: state] :
( succeeds(X0_state,X2_state)
| ~ succeeds(X1_state,X2_state)
| ~ succeeds(X0_state,X1_state) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_51,plain,
! [X0_state: state,X0_label: label,X1_state: state] :
( succeeds(X1_state,X0_state)
| ~ labels(X0_label,X1_state)
| ~ has(X0_state,goto(X0_label)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_53,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f24]) ).
tcf(c_57,plain,
follows(p8,p3),
inference(cnf_transformation,[],[f28]) ).
tcf(c_58,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f29]) ).
tcf(c_59,negated_conjecture,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f30]) ).
tcf(c_101,plain,
succeeds(p8,p3),
inference(resolution,[status(thm)],[c_49,c_57]) ).
tcf(c_107,plain,
! [X0_state: state] :
( succeeds(p3,X0_state)
| ~ has(X0_state,goto(loop)) ),
inference(resolution,[status(thm)],[c_51,c_53]) ).
tcf(c_121,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_58,c_107]) ).
tcf(c_148,plain,
! [X0_state: state] :
( succeeds(p3,X0_state)
| ~ succeeds(p8,X0_state) ),
inference(resolution,[status(thm)],[c_50,c_121]) ).
tcf(c_149,plain,
( succeeds(p3,p3)
| ~ succeeds(p8,p3) ),
inference(instantiation,[status(thm)],[c_148]) ).
tcf(c_150,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_149,c_101,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM001_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n001.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.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Fri Sep 25 07:48:24 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 1.51/1.27 % SZS status Started for theBenchmark.p
% 1.51/1.27 % SZS status Theorem for theBenchmark.p
% 1.51/1.27
% 1.51/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.51/1.27
% 1.51/1.27 % ------ iProver source info
% 1.51/1.27
% 1.51/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.51/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.51/1.27 % git: non_committed_changes: false
% 1.51/1.27
% 1.51/1.27 % ------ Parsing...
% 1.51/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.51/1.27 %
% 1.51/1.27
% 1.51/1.27 % ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe_e pe_s pe_e %
% 1.51/1.27
% 1.51/1.27 % ------ Preprocessing...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.51/1.27 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.51/1.27 % ------ Proving...
% 1.51/1.27 % ------ Problem Properties
% 1.51/1.27
% 1.51/1.27 %
% 1.51/1.27 % clauses 6
% 1.51/1.27 % conjectures 1
% 1.51/1.27 % EPR 6
% 1.51/1.27 % Horn 6
% 1.51/1.27 % unary 5
% 1.51/1.27 % binary 0
% 1.51/1.27 % lits 8
% 1.51/1.27 % lits eq 0
% 1.51/1.27 % fd_pure 0
% 1.51/1.27 % fd_pseudo 0
% 1.51/1.27 % fd_cond 0
% 1.51/1.27 % fd_pseudo_cond 0
% 1.51/1.27 % AC symbols 0
% 1.51/1.27
% 1.51/1.27 % ------ Schedule EPR Horn non eq is on
% 1.51/1.27
% 1.51/1.27 % ------ no equalities: superposition off
% 1.51/1.27
% 1.51/1.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.51/1.27
% 1.51/1.27
% 1.51/1.27 % ------
% 1.51/1.27 % Current options:
% 1.51/1.27 % ------
% 1.51/1.27
% 1.51/1.27
% 1.51/1.27 %
% 1.51/1.27
% 1.51/1.27 % ------ Proving...
% 1.51/1.27 %
% 1.51/1.27
% 1.51/1.27 % SZS status Theorem for theBenchmark.p
% 1.51/1.27
% 1.51/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.51/1.27
% 1.51/1.27
%------------------------------------------------------------------------------