%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS110+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 : n019.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:10 PM UTC 2026
% Result : Unsatisfiable 2.58s 6.31s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 49 ( 4 unt; 0 def)
% Number of atoms : 177 ( 2 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 217 ( 89 ~; 77 |; 42 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 92 ( 0 sgn 73 !; 19 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f25,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rs(X0,X1)
=> cpxcomp(X1) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f26,axiom,
! [X0] :
( cp(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f27,axiom,
! [X0] :
( cpxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f28,axiom,
! [X0] :
( ca_Ax2(X0)
<=> ( ? [X1] :
( cp(X1)
& rinvS(X0,X1) )
& cp(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f35,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X2] :
( rs(X0,X2)
=> cpxcomp(X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) ) ),
inference(rectify,[],[f25]) ).
fof(f83,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X2] :
( ~ rs(X0,X2)
| cpxcomp(X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f84,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f94,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X2] :
( ~ rs(X0,X2)
| cpxcomp(X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) ) )
& ( ? [X2] :
( rs(X0,X2)
& ~ cpxcomp(X2) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f95,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X2] :
( ~ rs(X0,X2)
| cpxcomp(X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) ) )
& ( ? [X2] :
( rs(X0,X2)
& ~ cpxcomp(X2) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X4] :
( ~ rs(X0,X4)
| cpxcomp(X4) )
& ? [X3] :
( ca_Ax2(X3)
& rs(X0,X3) ) ) )
& ( ? [X2] :
( rs(X0,X2)
& ~ cpxcomp(X2) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X4] :
( ~ rs(X0,X4)
| cpxcomp(X4) )
& ca_Ax2(sK1(X0))
& rs(X0,sK1(X0)) ) )
& ( ( rs(X0,sK0(X0))
& ~ cpxcomp(sK0(X0)) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0)),skolemize(X3,sK1(X0))],[f96]) ).
fof(f98,plain,
! [X0] :
( ( ~ cp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| cp(X0) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f99,plain,
! [X0] :
( ( ~ cp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) )
& ( ? [X1] : ra_Px1(X0,X1)
| cp(X0) ) ),
inference(rectify,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ( ~ cp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) )
& ( ra_Px1(X0,sK2(X0))
| cp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f99]) ).
fof(f101,plain,
! [X0] :
( ( ~ cpxcomp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| cpxcomp(X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f102,plain,
! [X0] :
( ( ~ cpxcomp(X0)
| ? [X2] : ra_Px1(X0,X2) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| cpxcomp(X0) ) ),
inference(rectify,[],[f101]) ).
fof(f103,plain,
! [X0] :
( ( ~ cpxcomp(X0)
| ra_Px1(X0,sK3(X0)) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| cpxcomp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0))],[f102]) ).
fof(f104,plain,
! [X0] :
( ( ~ ca_Ax2(X0)
| ( ? [X1] :
( cp(X1)
& rinvS(X0,X1) )
& cp(X0) ) )
& ( ! [X1] :
( ~ cp(X1)
| ~ rinvS(X0,X1) )
| ~ cp(X0)
| ca_Ax2(X0) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f105,plain,
! [X0] :
( ( ~ ca_Ax2(X0)
| ( ? [X1] :
( cp(X1)
& rinvS(X0,X1) )
& cp(X0) ) )
& ( ! [X1] :
( ~ cp(X1)
| ~ rinvS(X0,X1) )
| ~ cp(X0)
| ca_Ax2(X0) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0] :
( ( ~ ca_Ax2(X0)
| ( ? [X2] :
( cp(X2)
& rinvS(X0,X2) )
& cp(X0) ) )
& ( ! [X1] :
( ~ cp(X1)
| ~ rinvS(X0,X1) )
| ~ cp(X0)
| ca_Ax2(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ~ ca_Ax2(X0)
| ( cp(sK4(X0))
& rinvS(X0,sK4(X0))
& cp(X0) ) )
& ( ! [X1] :
( ~ cp(X1)
| ~ rinvS(X0,X1) )
| ~ cp(X0)
| ca_Ax2(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0))],[f106]) ).
fof(f137,plain,
! [X0,X4] :
( ~ cUnsatisfiable(X0)
| ~ rs(X0,X4)
| cpxcomp(X4) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca_Ax2(sK1(X0)) ),
inference(cnf_transformation,[],[f97]) ).
fof(f139,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f97]) ).
fof(f142,plain,
! [X2,X0] :
( ~ cp(X0)
| ~ ra_Px1(X0,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f144,plain,
! [X0] :
( ~ cpxcomp(X0)
| ra_Px1(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f103]) ).
fof(f148,plain,
! [X0] :
( ~ ca_Ax2(X0)
| cp(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f159,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnf_transformation,[],[f35]) ).
tcf(c_55,plain,
! [X0: $i] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_56,plain,
! [X0: $i] :
( ca_Ax2(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( cpxcomp(X1)
| ~ cUnsatisfiable(X0)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ cp(X0)
| ~ ra_Px1(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_61,plain,
! [X0: $i] :
( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_63,plain,
! [X0: $i] :
( cp(X0)
| ~ ca_Ax2(X0) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_75,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnf_transformation,[],[f159]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] :
( ~ ra_Px1(X0,X1)
| ~ cp(X0) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i] :
( ~ cp(X0)
| ~ ra_Px1(X0,X1) ),
inference(renaming,[status(thm)],[c_118]) ).
tcf(c_128,plain,
! [X0: $i] :
( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_502,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ cp(X0)
| ~ cpxcomp(X1)
| ( X0 != X1 )
| ( sK3(X1) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_119,c_128]) ).
tcf(c_503,plain,
! [X0: $i] :
( ~ cp(X0)
| ~ cpxcomp(X0) ),
inference(unflattening,[status(thm)],[c_502]) ).
tcf(c_912,plain,
! [X0: $i] :
( ~ cpxcomp(X0)
| ~ cp(X0) ),
inference(prop_impl_just,[status(thm)],[c_503]) ).
tcf(c_913,plain,
! [X0: $i] :
( ~ cp(X0)
| ~ cpxcomp(X0) ),
inference(renaming,[status(thm)],[c_912]) ).
tcf(c_1917,plain,
! [X0: $i] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_56,c_63]) ).
tcf(c_1936,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cpxcomp(sK1(X0)) ),
inference(superposition,[status(thm)],[c_1917,c_913]) ).
tcf(c_1939,plain,
( ~ cUnsatisfiable(i2003_11_14_17_21_12565)
| ~ cpxcomp(sK1(i2003_11_14_17_21_12565)) ),
inference(instantiation,[status(thm)],[c_1936]) ).
tcf(c_1983,plain,
! [X0: $i] :
( cpxcomp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_55,c_57]) ).
tcf(c_1990,plain,
( cpxcomp(sK1(i2003_11_14_17_21_12565))
| ~ cUnsatisfiable(i2003_11_14_17_21_12565) ),
inference(instantiation,[status(thm)],[c_1983]) ).
tcf(c_1991,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1990,c_1939,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS110+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.12/5.39 % Computer : n019.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Wed Sep 23 19:25:00 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.43 Running first-order theorem proving
% 0.17/5.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.17/5.44
% 0.17/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.17/5.44
% 0.17/5.44 % Detected problem language: tptp
% 0.17/5.46 % Proving...
% 2.58/6.31 % SZS status Started for theBenchmark.p
% 2.58/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/6.31
% 2.58/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.58/6.31
% 2.58/6.31 % ------ iProver source info
% 2.58/6.31
% 2.58/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 2.58/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.58/6.31 % git: non_committed_changes: false
% 2.58/6.31
% 2.58/6.31 % ------ Parsing...
% 2.58/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.58/6.31
% 2.58/6.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 2.58/6.31
% 2.58/6.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.58/6.31
% 2.58/6.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.58/6.31 % ------ Proving...
% 2.58/6.31 % ------ Problem Properties
% 2.58/6.31
% 2.58/6.31 %
% 2.58/6.31 % clauses 17
% 2.58/6.31 % conjectures 0
% 2.58/6.31 % EPR 11
% 2.58/6.31 % Horn 15
% 2.58/6.31 % unary 1
% 2.58/6.31 % binary 9
% 2.58/6.31 % lits 43
% 2.58/6.31 % lits eq 3
% 2.58/6.31 % fd_pure 0
% 2.58/6.31 % fd_pseudo 0
% 2.58/6.31 % fd_cond 0
% 2.58/6.31 % fd_pseudo_cond 3
% 2.58/6.31 % AC symbols 0
% 2.58/6.31
% 2.58/6.31 % ------ Schedule dynamic 5 is on
% 2.58/6.31
% 2.58/6.31 % ------ no conjectures: strip conj schedule
% 2.58/6.31
% 2.58/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.58/6.31
% 2.58/6.31
% 2.58/6.31 % ------
% 2.58/6.31 % Current options:
% 2.58/6.31 % ------
% 2.58/6.31
% 2.58/6.31
% 2.58/6.31 %
% 2.58/6.31
% 2.58/6.31 % ------ Proving...
% 2.58/6.31 %
% 2.58/6.31
% 2.58/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/6.31
% 2.58/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.58/6.31
% 2.58/6.31
%------------------------------------------------------------------------------