%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS097+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:54:09 PM UTC 2026
% Result : Unsatisfiable 1.89s 11.30s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 7 unt; 1 def)
% Number of atoms : 196 ( 24 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 242 ( 96 ~; 83 |; 58 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 106 ( 0 sgn 75 !; 31 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X2] :
( cc(X2)
& rr(X0,X2) )
& ~ ? [X1,X3] :
( X1 != X3
& rr(X0,X3)
& rr(X0,X1) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f30,axiom,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f32,axiom,
! [X0] :
~ ( cc(X0)
& cd(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f40,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X5] :
( cc(X5)
& rr(X0,X5) )
& ~ ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f91,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X5] :
( cc(X5)
& rr(X0,X5) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) ),
inference(ennf_transformation,[],[f40]) ).
fof(f93,plain,
! [X0] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f108,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| sP0(X0) )
& ( ~ sP0(X0)
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f149,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f154,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
inference(cnf_transformation,[],[f30]) ).
fof(f156,plain,
! [X0] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_63,plain,
! [X0: $i] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_67,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
inference(cnf_transformation,[],[f154]) ).
tcf(c_69,plain,
! [X0: $i] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f156]) ).
tcf(c_106,plain,
! [X0: $i] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_126,plain,
! [X0: $i] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(prop_impl_just,[status(thm)],[c_69]) ).
fof(f101,definition,
! [X0] :
( sP0(X0)
<=> ( ? [X5] :
( cc(X5)
& rr(X0,X5) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f102,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f91,f101]) ).
fof(f104,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X5] :
( cc(X5)
& rr(X0,X5) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) )
& ( ! [X5] :
( ~ cc(X5)
| ~ rr(X0,X5) )
| ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] : ~ rr(X0,X1)
| sP0(X0) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f105,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X5] :
( cc(X5)
& rr(X0,X5) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] : rr(X0,X1) ) )
& ( ! [X5] :
( ~ cc(X5)
| ~ rr(X0,X5) )
| ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] : ~ rr(X0,X1)
| sP0(X0) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X10] :
( cc(X10)
& rr(X0,X10) )
& ! [X8,X9] :
( X8 = X9
| ~ rr(X0,X9)
| ~ rr(X0,X8) )
& ? [X7] :
( cd(X7)
& rr(X0,X7) )
& ? [X6] : rr(X0,X6) ) )
& ( ! [X5] :
( ~ cc(X5)
| ~ rr(X0,X5) )
| ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] : ~ rr(X0,X1)
| sP0(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ~ sP0(X0)
| ( cc(sK5(X0))
& rr(X0,sK5(X0))
& ! [X8,X9] :
( X8 = X9
| ~ rr(X0,X9)
| ~ rr(X0,X8) )
& cd(sK4(X0))
& rr(X0,sK4(X0))
& rr(X0,sK3(X0)) ) )
& ( ! [X5] :
( ~ cc(X5)
| ~ rr(X0,X5) )
| ( sK1(X0) != sK2(X0)
& rr(X0,sK2(X0))
& rr(X0,sK1(X0)) )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] : ~ rr(X0,X1)
| sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X3,sK1(X0)),skolemize(X4,sK2(X0)),skolemize(X6,sK3(X0)),skolemize(X7,sK4(X0)),skolemize(X10,sK5(X0))],[f106]) ).
fof(f140,plain,
! [X0] :
( ~ sP0(X0)
| cc(sK5(X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f141,plain,
! [X0] :
( ~ sP0(X0)
| rr(X0,sK5(X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f142,plain,
! [X0,X8,X9] :
( ~ sP0(X0)
| X8 = X9
| ~ rr(X0,X9)
| ~ rr(X0,X8) ),
inference(cnf_transformation,[],[f107]) ).
fof(f143,plain,
! [X0] :
( ~ sP0(X0)
| cd(sK4(X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f144,plain,
! [X0] :
( ~ sP0(X0)
| rr(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f145,plain,
! [X0] :
( ~ sP0(X0)
| rr(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_56,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_57,plain,
! [X0: $i] :
( rr(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_58,plain,
! [X0: $i] :
( cd(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ sP0(X0)
| ~ rr(X0,X2)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_60,plain,
! [X0: $i] :
( rr(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_61,plain,
! [X0: $i] :
( cc(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_114,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63,c_56]) ).
tcf(c_116,plain,
! [X0: $i] :
( rr(X0,sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63,c_57]) ).
tcf(c_118,plain,
! [X0: $i] :
( cd(sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63,c_58]) ).
tcf(c_120,plain,
! [X0: $i] :
( rr(X0,sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63,c_60]) ).
tcf(c_122,plain,
! [X0: $i] :
( cc(sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_63,c_61]) ).
tcf(c_219,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X2)
| ~ rr(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_59,c_106]) ).
tcf(c_584,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X0)
| ~ cc(X1)
| ( sK4(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_118,c_126]) ).
tcf(c_585,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cc(sK4(X0)) ),
inference(unflattening,[status(thm)],[c_584]) ).
tcf(c_685,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X0)
| ( sK4(X0) != sK5(X1) ) ),
inference(resolution_lifted,[status(thm)],[c_122,c_585]) ).
tcf(c_686,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_21603)
| ( sK4(i2003_11_14_17_20_21603) != sK5(i2003_11_14_17_20_21603) ) ),
inference(instantiation,[status(thm)],[c_685]) ).
tcf(c_1201,plain,
! [X0: $i,X1: $i] :
( ( sK3(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(superposition,[status(thm)],[c_114,c_219]) ).
tcf(c_1223,plain,
! [X0: $i] :
( ( sK3(X0) = sK4(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_116,c_1201]) ).
tcf(c_1224,plain,
! [X0: $i] :
( ( sK3(X0) = sK5(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_120,c_1201]) ).
tcf(c_1249,plain,
sK3(i2003_11_14_17_20_21603) = sK4(i2003_11_14_17_20_21603),
inference(superposition,[status(thm)],[c_67,c_1223]) ).
tcf(c_1262,plain,
sK3(i2003_11_14_17_20_21603) = sK5(i2003_11_14_17_20_21603),
inference(superposition,[status(thm)],[c_67,c_1224]) ).
tcf(c_1263,plain,
sK4(i2003_11_14_17_20_21603) = sK5(i2003_11_14_17_20_21603),
inference(light_normalisation,[status(thm)],[c_1262,c_1249]) ).
tcf(c_1264,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1263,c_686,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS097+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/10.39 % Computer : n004.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Wed Sep 23 19:23:48 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/10.44
% 0.14/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.44
% 0.14/10.44 % Detected problem language: tptp
% 0.14/10.45 % Proving...
% 1.89/11.30 % SZS status Started for theBenchmark.p
% 1.89/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.89/11.30
% 1.89/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.89/11.30
% 1.89/11.30 % ------ iProver source info
% 1.89/11.30
% 1.89/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.89/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.89/11.30 % git: non_committed_changes: false
% 1.89/11.30
% 1.89/11.30 % ------ Parsing...
% 1.89/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.89/11.30
% 1.89/11.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 13 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.89/11.30
% 1.89/11.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.89/11.30
% 1.89/11.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.89/11.30 % ------ Proving...
% 1.89/11.30 % ------ Problem Properties
% 1.89/11.30
% 1.89/11.30 %
% 1.89/11.30 % clauses 10
% 1.89/11.30 % conjectures 0
% 1.89/11.30 % EPR 2
% 1.89/11.30 % Horn 8
% 1.89/11.30 % unary 1
% 1.89/11.30 % binary 5
% 1.89/11.30 % lits 36
% 1.89/11.30 % lits eq 2
% 1.89/11.30 % fd_pure 0
% 1.89/11.30 % fd_pseudo 0
% 1.89/11.30 % fd_cond 0
% 1.89/11.30 % fd_pseudo_cond 1
% 1.89/11.30 % AC symbols 0
% 1.89/11.30
% 1.89/11.30 % ------ Schedule dynamic 5 is on
% 1.89/11.30
% 1.89/11.30 % ------ no conjectures: strip conj schedule
% 1.89/11.30
% 1.89/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.89/11.30
% 1.89/11.30
% 1.89/11.30 % ------
% 1.89/11.30 % Current options:
% 1.89/11.30 % ------
% 1.89/11.30
% 1.89/11.30
% 1.89/11.30 %
% 1.89/11.30
% 1.89/11.30 % ------ Proving...
% 1.89/11.30 %
% 1.89/11.30
% 1.89/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.89/11.30
% 1.89/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.89/11.30
% 1.89/11.30
%------------------------------------------------------------------------------