%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM002_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 : n011.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:14 PM UTC 2026
% Result : Theorem 2.05s 1.28s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 61 ( 30 ~; 26 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 27 ( 27 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 : 18 ( 18 usr; 12 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
p1: 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,
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: ( number * register ) > boolean ).
tff(func_def_17,type,
assign: ( number * register ) > statement ).
tff(func_def_18,type,
goto: label > statement ).
tff(func_def_19,type,
ifthen: ( state * boolean ) > statement ).
tff(func_def_20,type,
plus: ( number * register ) > number ).
tff(func_def_21,type,
times: ( register * number ) > number ).
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(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] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f23,plain,
! [X0: state,X1: state,X2: state] :
( ~ succeeds(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f24,plain,
! [X0: state,X1: state,X2: state] :
( ~ succeeds(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
! [X0: state,X1: label,X2: state] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
tff(f26,plain,
! [X0: state,X1: label,X2: state] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
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(X1,X0)
| ~ succeeds(X2,X1)
| succeeds(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f30,plain,
! [X2: state,X0: state,X1: label] :
( ~ labels(X1,X0)
| ~ has(X2,goto(X1))
| succeeds(X0,X2) ),
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]) ).
tcf(c_49,plain,
! [X0_state: state,X1_state: state] :
( succeeds(X0_state,X1_state)
| ~ follows(X0_state,X1_state) ),
inference(cnf_transformation,[],[f28]) ).
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,[],[f29]) ).
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,[],[f30]) ).
tcf(c_56,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f35]) ).
tcf(c_61,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f40]) ).
tcf(c_63,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f42]) ).
tcf(c_65,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f44]) ).
tcf(c_66,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f45]) ).
tcf(c_67,negated_conjecture,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f46]) ).
tcf(c_121,plain,
! [X0_state: state] :
( succeeds(p3,X0_state)
| ~ has(X0_state,goto(loop)) ),
inference(resolution,[status(thm)],[c_51,c_56]) ).
tcf(c_143,plain,
succeeds(p6,p3),
inference(resolution,[status(thm)],[c_49,c_61]) ).
tcf(c_147,plain,
succeeds(p7,p6),
inference(resolution,[status(thm)],[c_49,c_63]) ).
tcf(c_151,plain,
succeeds(p8,p7),
inference(resolution,[status(thm)],[c_49,c_65]) ).
tcf(c_165,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_66,c_121]) ).
tcf(c_203,plain,
! [X0_state: state] :
( succeeds(p7,X0_state)
| ~ succeeds(p6,X0_state) ),
inference(resolution,[status(thm)],[c_50,c_147]) ).
tcf(c_204,plain,
( succeeds(p7,p3)
| ~ succeeds(p6,p3) ),
inference(instantiation,[status(thm)],[c_203]) ).
tcf(c_205,plain,
! [X0_state: state] :
( succeeds(p8,X0_state)
| ~ succeeds(p7,X0_state) ),
inference(resolution,[status(thm)],[c_50,c_151]) ).
tcf(c_206,plain,
( succeeds(p8,p3)
| ~ succeeds(p7,p3) ),
inference(instantiation,[status(thm)],[c_205]) ).
tcf(c_208,plain,
! [X0_state: state] :
( succeeds(p3,X0_state)
| ~ succeeds(p8,X0_state) ),
inference(resolution,[status(thm)],[c_50,c_165]) ).
tcf(c_209,plain,
( succeeds(p3,p3)
| ~ succeeds(p8,p3) ),
inference(instantiation,[status(thm)],[c_208]) ).
tcf(c_210,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_209,c_206,c_204,c_143,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM002_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.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 07:42:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.42
% 0.15/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42
% 0.15/0.42 % Detected problem language: tptp
% 0.15/0.43 % Proving...
% 2.05/1.28 % SZS status Started for theBenchmark.p
% 2.05/1.28 % SZS status Theorem for theBenchmark.p
% 2.05/1.28
% 2.05/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.05/1.28
% 2.05/1.28 % ------ iProver source info
% 2.05/1.28
% 2.05/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.05/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.05/1.28 % git: non_committed_changes: false
% 2.05/1.28
% 2.05/1.28 % ------ Parsing...
% 2.05/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 2.05/1.28 %
% 2.05/1.28
% 2.05/1.28 % ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe_e pe_s pe_e %
% 2.05/1.28
% 2.05/1.28 % ------ Preprocessing...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 2.05/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.05/1.28 % ------ Proving...
% 2.05/1.28 % ------ Problem Properties
% 2.05/1.28
% 2.05/1.28 %
% 2.05/1.28 % clauses 10
% 2.05/1.28 % conjectures 1
% 2.05/1.28 % EPR 10
% 2.05/1.28 % Horn 10
% 2.05/1.28 % unary 9
% 2.05/1.28 % binary 0
% 2.05/1.28 % lits 12
% 2.05/1.28 % lits eq 0
% 2.05/1.28 % fd_pure 0
% 2.05/1.28 % fd_pseudo 0
% 2.05/1.28 % fd_cond 0
% 2.05/1.28 % fd_pseudo_cond 0
% 2.05/1.28 % AC symbols 0
% 2.05/1.28
% 2.05/1.28 % ------ Schedule EPR Horn non eq is on
% 2.05/1.28
% 2.05/1.28 % ------ no equalities: superposition off
% 2.05/1.28
% 2.05/1.28 % ------ Option_epr_horn Time Limit: Unbounded
% 2.05/1.28
% 2.05/1.28
% 2.05/1.28 % ------
% 2.05/1.28 % Current options:
% 2.05/1.28 % ------
% 2.05/1.28
% 2.05/1.28
% 2.05/1.28 %
% 2.05/1.28
% 2.05/1.28 % ------ Proving...
% 2.05/1.28 %
% 2.05/1.28
% 2.05/1.28 % SZS status Theorem for theBenchmark.p
% 2.05/1.28
% 2.05/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.05/1.28
% 2.05/1.28
%------------------------------------------------------------------------------