%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS078+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 : n006.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:06 PM UTC 2026
% Result : Unsatisfiable 1.95s 6.34s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 6 unt; 1 def)
% Number of atoms : 234 ( 21 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 300 ( 115 ~; 100 |; 74 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 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 : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 132 ( 0 sgn 99 !; 33 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( ~ cp(X1)
& ~ cq(X1)
& rs(X0,X1) )
& ? [X1] :
( ! [X4,X5] :
( ( rinvR(X1,X5)
& rinvR(X1,X4) )
=> X4 = X5 )
& ? [X2] :
( ! [X3] :
( rs(X2,X3)
=> cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f17,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
cUnsatisfiable(i2003_11_14_17_19_13721),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f19,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ( rinvR(X1,X5)
& rinvR(X1,X4) )
=> X4 = X5 )
& ? [X2] :
( ! [X3] :
( rs(X2,X3)
=> cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) ),
inference(rectify,[],[f16]) ).
fof(f46,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ~ rinvR(X1,X5)
| ~ rinvR(X1,X4)
| X4 = X5 )
& ? [X2] :
( ! [X3] :
( ~ rs(X2,X3)
| cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f47,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ~ rinvR(X1,X5)
| ~ rinvR(X1,X4)
| X4 = X5 )
& ? [X2] :
( ! [X3] :
( ~ rs(X2,X3)
| cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) ),
inference(flattening,[],[f46]) ).
fof(f55,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| sP0(X0) )
& ( ~ sP0(X0)
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f49]) ).
fof(f56,plain,
! [X0,X1] :
( ( ~ rinvR(X0,X1)
| rr(X1,X0) )
& ( ~ rr(X1,X0)
| rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f87,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f90,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f91,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(cnf_transformation,[],[f18]) ).
tcf(c_67,plain,
! [X0: $i] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( rinvR(X1,X0)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_70,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(cnf_transformation,[],[f91]) ).
tcf(c_97,plain,
! [X0: $i] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_67]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( rinvR(X1,X0)
| ~ rr(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_68]) ).
fof(f48,definition,
! [X0] :
( sP0(X0)
<=> ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ~ rinvR(X1,X5)
| ~ rinvR(X1,X4)
| X4 = X5 )
& ? [X2] :
( ! [X3] :
( ~ rs(X2,X3)
| cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f49,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f47,f48]) ).
fof(f51,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ~ rinvR(X1,X5)
| ~ rinvR(X1,X4)
| X4 = X5 )
& ? [X2] :
( ! [X3] :
( ~ rs(X2,X3)
| cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) )
& ( ! [X6] :
( cp(X6)
| cq(X6)
| ~ rs(X0,X6) )
| ! [X1] :
( ? [X4,X5] :
( rinvR(X1,X5)
& rinvR(X1,X4)
& X4 != X5 )
| ! [X2] :
( ? [X3] :
( rs(X2,X3)
& ~ cp(X3) )
| ~ rinvR(X1,X2) )
| ~ rr(X0,X1) )
| sP0(X0) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f52,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X6] :
( ~ cp(X6)
& ~ cq(X6)
& rs(X0,X6) )
& ? [X1] :
( ! [X4,X5] :
( ~ rinvR(X1,X5)
| ~ rinvR(X1,X4)
| X4 = X5 )
& ? [X2] :
( ! [X3] :
( ~ rs(X2,X3)
| cp(X3) )
& rinvR(X1,X2) )
& rr(X0,X1) ) ) )
& ( ! [X6] :
( cp(X6)
| cq(X6)
| ~ rs(X0,X6) )
| ! [X1] :
( ? [X4,X5] :
( rinvR(X1,X5)
& rinvR(X1,X4)
& X4 != X5 )
| ! [X2] :
( ? [X3] :
( rs(X2,X3)
& ~ cp(X3) )
| ~ rinvR(X1,X2) )
| ~ rr(X0,X1) )
| sP0(X0) ) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ? [X12] :
( ~ cp(X12)
& ~ cq(X12)
& rs(X0,X12) )
& ? [X7] :
( ! [X10,X11] :
( ~ rinvR(X7,X11)
| ~ rinvR(X7,X10)
| X10 = X11 )
& ? [X8] :
( ! [X9] :
( ~ rs(X8,X9)
| cp(X9) )
& rinvR(X7,X8) )
& rr(X0,X7) ) ) )
& ( ! [X6] :
( cp(X6)
| cq(X6)
| ~ rs(X0,X6) )
| ! [X1] :
( ? [X4,X5] :
( rinvR(X1,X5)
& rinvR(X1,X4)
& X4 != X5 )
| ! [X2] :
( ? [X3] :
( rs(X2,X3)
& ~ cp(X3) )
| ~ rinvR(X1,X2) )
| ~ rr(X0,X1) )
| sP0(X0) ) ),
inference(rectify,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ( ~ sP0(X0)
| ( ~ cp(sK6(X0))
& ~ cq(sK6(X0))
& rs(X0,sK6(X0))
& ! [X10,X11] :
( ~ rinvR(sK4(X0),X11)
| ~ rinvR(sK4(X0),X10)
| X10 = X11 )
& ! [X9] :
( ~ rs(sK5(X0),X9)
| cp(X9) )
& rinvR(sK4(X0),sK5(X0))
& rr(X0,sK4(X0)) ) )
& ( ! [X6] :
( cp(X6)
| cq(X6)
| ~ rs(X0,X6) )
| ! [X1] :
( ( rinvR(X1,sK3(X1))
& rinvR(X1,sK2(X1))
& sK2(X1) != sK3(X1) )
| ! [X2] :
( ( rs(X2,sK1(X2))
& ~ cp(sK1(X2)) )
| ~ rinvR(X1,X2) )
| ~ rr(X0,X1) )
| sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X3,sK1(X2)),skolemize(X4,sK2(X1)),skolemize(X5,sK3(X1)),skolemize(X7,sK4(X0)),skolemize(X8,sK5(X0)),skolemize(X12,sK6(X0))],[f53]) ).
fof(f74,plain,
! [X0] :
( ~ sP0(X0)
| ~ cp(sK6(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f76,plain,
! [X0] :
( ~ sP0(X0)
| rs(X0,sK6(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f77,plain,
! [X10,X0,X11] :
( ~ sP0(X0)
| ~ rinvR(sK4(X0),X11)
| ~ rinvR(sK4(X0),X10)
| X10 = X11 ),
inference(cnf_transformation,[],[f54]) ).
fof(f78,plain,
! [X0,X9] :
( ~ sP0(X0)
| ~ rs(sK5(X0),X9)
| cp(X9) ),
inference(cnf_transformation,[],[f54]) ).
fof(f79,plain,
! [X0] :
( ~ sP0(X0)
| rinvR(sK4(X0),sK5(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f80,plain,
! [X0] :
( ~ sP0(X0)
| rr(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_59,plain,
! [X0: $i] :
( rr(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_60,plain,
! [X0: $i] :
( rinvR(sK4(X0),sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( cp(X1)
| ~ sP0(X0)
| ~ rs(sK5(X0),X1) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ sP0(X0)
| ~ rinvR(sK4(X0),X2)
| ~ rinvR(sK4(X0),X1) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_63,plain,
! [X0: $i] :
( rs(X0,sK6(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_65,plain,
! [X0: $i] :
( ~ sP0(X0)
| ~ cp(sK6(X0)) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_105,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK6(X0)) ),
inference(prop_impl_just,[status(thm)],[c_67,c_65]) ).
tcf(c_107,plain,
! [X0: $i] :
( rr(X0,sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_67,c_59]) ).
tcf(c_109,plain,
! [X0: $i] :
( rinvR(sK4(X0),sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_67,c_60]) ).
tcf(c_111,plain,
! [X0: $i] :
( rs(X0,sK6(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_67,c_63]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] :
( cp(X1)
| ~ cUnsatisfiable(X0)
| ~ rs(sK5(X0),X1) ),
inference(bin_hyper_res,[status(thm)],[c_61,c_97]) ).
tcf(c_174,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ cUnsatisfiable(X0)
| ~ rinvR(sK4(X0),X2)
| ~ rinvR(sK4(X0),X1) ),
inference(bin_hyper_res,[status(thm)],[c_62,c_97]) ).
tcf(c_936,plain,
! [X0: $i,X1: $i,X2: $i] :
( rinvR(X2,X0)
| ~ cUnsatisfiable(X1)
| ( X0 != X1 )
| ( sK4(X1) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_99,c_107]) ).
tcf(c_937,plain,
! [X0: $i] :
( rinvR(sK4(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(unflattening,[status(thm)],[c_936]) ).
tcf(c_1895,plain,
! [X0: $i] :
( cp(sK6(sK5(X0)))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(sK5(X0)) ),
inference(superposition,[status(thm)],[c_111,c_173]) ).
tcf(c_1903,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(sK5(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1895,c_105]) ).
tcf(c_1918,plain,
! [X0: $i,X1: $i] :
( ( sK5(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rinvR(sK4(X0),X1) ),
inference(superposition,[status(thm)],[c_109,c_174]) ).
tcf(c_1948,plain,
! [X0: $i] :
( ( sK5(X0) = X0 )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_937,c_1918]) ).
tcf(c_1956,plain,
sK5(i2003_11_14_17_19_13721) = i2003_11_14_17_19_13721,
inference(superposition,[status(thm)],[c_70,c_1948]) ).
tcf(c_1957,plain,
~ cUnsatisfiable(i2003_11_14_17_19_13721),
inference(superposition,[status(thm)],[c_1956,c_1903]) ).
tcf(c_1960,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1957,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS078+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.42 % Computer : n006.cluster.edu
% 0.16/5.42 % Model : x86_64 x86_64
% 0.16/5.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.42 % Memory : 8046.5625MB
% 0.16/5.42 % OS : Linux 6.8.0-71-generic
% 0.16/5.42 % CPULimit : 300
% 0.16/5.42 % WCLimit : 300
% 0.16/5.43 % DateTime : Wed Sep 23 19:19:49 UTC 2026
% 0.16/5.43 % CPUTime :
% 0.16/5.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.47 Running first-order theorem proving
% 0.16/5.47 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.16/5.48
% 0.16/5.48 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.48
% 0.16/5.48 % Detected problem language: tptp
% 0.16/5.49 % Proving...
% 1.95/6.34 % SZS status Started for theBenchmark.p
% 1.95/6.34 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/6.34
% 1.95/6.34 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.95/6.34
% 1.95/6.34 % ------ iProver source info
% 1.95/6.34
% 1.95/6.34 % git: date: 2026-07-19 20:42:38 +0200
% 1.95/6.34 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.95/6.34 % git: non_committed_changes: false
% 1.95/6.34
% 1.95/6.34 % ------ Parsing...
% 1.95/6.34 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.95/6.34
% 1.95/6.34 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 1.95/6.34
% 1.95/6.34 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.95/6.34
% 1.95/6.34 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.95/6.34 % ------ Proving...
% 1.95/6.34 % ------ Problem Properties
% 1.95/6.34
% 1.95/6.34 %
% 1.95/6.34 % clauses 13
% 1.95/6.34 % conjectures 0
% 1.95/6.34 % EPR 1
% 1.95/6.34 % Horn 8
% 1.95/6.34 % unary 1
% 1.95/6.34 % binary 4
% 1.95/6.34 % lits 58
% 1.95/6.34 % lits eq 3
% 1.95/6.34 % fd_pure 0
% 1.95/6.34 % fd_pseudo 0
% 1.95/6.34 % fd_cond 0
% 1.95/6.34 % fd_pseudo_cond 1
% 1.95/6.34 % AC symbols 0
% 1.95/6.34
% 1.95/6.34 % ------ Schedule dynamic 5 is on
% 1.95/6.34
% 1.95/6.34 % ------ no conjectures: strip conj schedule
% 1.95/6.34
% 1.95/6.34 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.95/6.34
% 1.95/6.34
% 1.95/6.34 % ------
% 1.95/6.34 % Current options:
% 1.95/6.34 % ------
% 1.95/6.34
% 1.95/6.34
% 1.95/6.34 %
% 1.95/6.34
% 1.95/6.34 % ------ Proving...
% 1.95/6.34 %
% 1.95/6.34
% 1.95/6.34 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/6.34
% 1.95/6.34 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.95/6.34
% 1.95/6.34
%------------------------------------------------------------------------------