%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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 : Unsatisfiable 2.11s 1.17s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 24 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ follows(X0,X1)
| ~ fails(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
fof(f2,axiom,
! [X2,X0,X1] :
( fails(X2,X1)
| fails(X0,X2)
| ~ fails(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ labels(X2,X0)
| ~ has(X1,goto(X2))
| ~ fails(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
fof(f8,axiom,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
fof(f13,axiom,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
fof(f15,axiom,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
fof(f17,axiom,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
fof(f18,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
fof(f19,negated_conjecture,
fails(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ~ follows(X0,X1)
| ~ fails(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] :
( fails(X2,X1)
| fails(X0,X2)
| ~ fails(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ labels(X1,X2)
| ~ fails(X2,X0)
| ~ has(X0,goto(X1)) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_75,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tcf(c_80,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tcf(c_82,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tcf(c_84,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tcf(c_85,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tcf(c_86,negated_conjecture,
fails(p3,p3),
inference(cnf_transformation,[],[f19]) ).
tcf(c_140,plain,
! [X0: $i] :
( ~ fails(p3,X0)
| ~ has(X0,goto(loop)) ),
inference(resolution,[status(thm)],[c_70,c_75]) ).
tcf(c_162,plain,
~ fails(p6,p3),
inference(resolution,[status(thm)],[c_68,c_80]) ).
tcf(c_166,plain,
~ fails(p7,p6),
inference(resolution,[status(thm)],[c_68,c_82]) ).
tcf(c_170,plain,
~ fails(p8,p7),
inference(resolution,[status(thm)],[c_68,c_84]) ).
tcf(c_184,plain,
~ fails(p3,p8),
inference(resolution,[status(thm)],[c_85,c_140]) ).
tcf(c_220,plain,
! [X0: $i] :
( fails(p6,p3)
| fails(X0,p6)
| ~ fails(X0,p3) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_221,plain,
( fails(p6,p3)
| fails(p3,p6)
| ~ fails(p3,p3) ),
inference(instantiation,[status(thm)],[c_220]) ).
tcf(c_222,plain,
! [X0: $i] :
( fails(p7,p6)
| fails(X0,p7)
| ~ fails(X0,p6) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_223,plain,
( fails(p7,p6)
| fails(p3,p7)
| ~ fails(p3,p6) ),
inference(instantiation,[status(thm)],[c_222]) ).
tcf(c_224,plain,
! [X0: $i] :
( fails(p8,p7)
| fails(X0,p8)
| ~ fails(X0,p7) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_225,plain,
( fails(p8,p7)
| fails(p3,p8)
| ~ fails(p3,p7) ),
inference(instantiation,[status(thm)],[c_224]) ).
tcf(c_226,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_225,c_223,c_221,c_184,c_170,c_166,c_162,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 07:41:08 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.11/1.17 % SZS status Started for theBenchmark.p
% 2.11/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.17
% 2.11/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.11/1.17
% 2.11/1.17 % ------ iProver source info
% 2.11/1.17
% 2.11/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 2.11/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.11/1.17 % git: non_committed_changes: false
% 2.11/1.17
% 2.11/1.17 % ------ Parsing...% successful
% 2.11/1.17
% 2.11/1.17
% 2.11/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.11/1.17
% 2.11/1.17 % ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.11/1.17
% 2.11/1.17 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 2.11/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.11/1.17 % ------ Proving...
% 2.11/1.17 % ------ Problem Properties
% 2.11/1.17
% 2.11/1.17 %
% 2.11/1.17 % clauses 10
% 2.11/1.17 % conjectures 1
% 2.11/1.17 % EPR 10
% 2.11/1.17 % Horn 9
% 2.11/1.17 % unary 9
% 2.11/1.17 % binary 0
% 2.11/1.17 % lits 12
% 2.11/1.17 % lits eq 0
% 2.11/1.17 % fd_pure 0
% 2.11/1.17 % fd_pseudo 0
% 2.11/1.17 % fd_cond 0
% 2.11/1.17 % fd_pseudo_cond 0
% 2.11/1.17 % AC symbols 0
% 2.11/1.17
% 2.11/1.17 % ------ Schedule EPR non Horn non eq is on
% 2.11/1.17
% 2.11/1.17 % ------ no equalities: superposition off
% 2.11/1.17
% 2.11/1.17 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.11/1.17
% 2.11/1.17
% 2.11/1.17 % ------
% 2.11/1.17 % Current options:
% 2.11/1.17 % ------
% 2.11/1.17
% 2.11/1.17
% 2.11/1.17 %
% 2.11/1.17
% 2.11/1.17 % ------ Proving...
% 2.11/1.17 %
% 2.11/1.17
% 2.11/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.17
% 2.11/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/1.17
% 2.11/1.17
%------------------------------------------------------------------------------