%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS069+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 : n001.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:05 PM UTC 2026
% Result : Unsatisfiable 1.66s 1.16s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 8 unt; 0 def)
% Number of atoms : 163 ( 16 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 188 ( 76 ~; 70 |; 36 &)
% ( 2 <=>; 4 =>; 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 : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 95 ( 0 sgn 80 !; 15 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp2(X1)
& rf3(X0,X1) )
& ? [X1] :
( ~ cp1(X1)
& rf2(X0,X1) )
& ? [X1] :
( cp1(X1)
& rf1(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f17,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( rf2(X0,X2)
& rf2(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f20,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f21,axiom,
! [X0,X1] :
( rf3(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f22,axiom,
! [X0,X1] :
( rf3(X0,X1)
=> rf2(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f23,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X3] :
( cp2(X3)
& rf3(X0,X3) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X1] :
( cp1(X1)
& rf1(X0,X1) ) ) ),
inference(rectify,[],[f16]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f17]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ rf2(X0,X2)
| ~ rf2(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f18]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ rf2(X0,X2)
| ~ rf2(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf1(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f57,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf2(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f59,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cp2(X3)
& rf3(X0,X3) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X1] :
( cp1(X1)
& rf1(X0,X1) ) ) )
& ( ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X1] :
( ~ cp1(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f60,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cp2(X3)
& rf3(X0,X3) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X1] :
( cp1(X1)
& rf1(X0,X1) ) ) )
& ( ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X1] :
( ~ cp1(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X6] :
( cp2(X6)
& rf3(X0,X6) )
& ? [X5] :
( ~ cp1(X5)
& rf2(X0,X5) )
& ? [X4] :
( cp1(X4)
& rf1(X0,X4) ) ) )
& ( ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X1] :
( ~ cp1(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp2(sK2(X0))
& rf3(X0,sK2(X0))
& ~ cp1(sK1(X0))
& rf2(X0,sK1(X0))
& cp1(sK0(X0))
& rf1(X0,sK0(X0)) ) )
& ( ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X1] :
( ~ cp1(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X4,sK0(X0)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0))],[f61]) ).
fof(f81,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf3(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f82,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK1(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f83,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf2(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f84,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK0(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f85,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf1(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ rf2(X0,X2)
| ~ rf2(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f53]) ).
fof(f90,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(cnf_transformation,[],[f20]) ).
fof(f91,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f92,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf2(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_54,plain,
! [X0: $i] :
( rf1(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_55,plain,
! [X0: $i] :
( cp1(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_56,plain,
! [X0: $i] :
( rf2(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_57,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK1(X0)) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_58,plain,
! [X0: $i] :
( rf3(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_63,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(cnf_transformation,[],[f90]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_70,plain,
( cp1(sK0(i2003_11_14_17_18_2750))
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_696,plain,
! [X0: $i] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_58,c_64]) ).
tcf(c_704,plain,
! [X0: $i] :
( rf2(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_58,c_65]) ).
tcf(c_729,plain,
! [X0: $i,X1: $i] :
( ( sK0(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf1(X0,X1) ),
inference(superposition,[status(thm)],[c_54,c_60]) ).
tcf(c_781,plain,
! [X0: $i] :
( ( sK0(X0) = sK2(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_696,c_729]) ).
tcf(c_789,plain,
sK0(i2003_11_14_17_18_2750) = sK2(i2003_11_14_17_18_2750),
inference(superposition,[status(thm)],[c_63,c_781]) ).
tcf(c_790,plain,
( rf2(i2003_11_14_17_18_2750,sK0(i2003_11_14_17_18_2750))
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(superposition,[status(thm)],[c_789,c_704]) ).
tcf(c_796,plain,
rf2(i2003_11_14_17_18_2750,sK0(i2003_11_14_17_18_2750)),
inference(forward_subsumption_resolution,[status(thm)],[c_790,c_63]) ).
tcf(c_815,plain,
! [X0: $i] :
( ( sK0(i2003_11_14_17_18_2750) = X0 )
| ~ rf2(i2003_11_14_17_18_2750,X0) ),
inference(superposition,[status(thm)],[c_796,c_61]) ).
tcf(c_836,plain,
( ( sK0(i2003_11_14_17_18_2750) = sK1(i2003_11_14_17_18_2750) )
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(superposition,[status(thm)],[c_56,c_815]) ).
tcf(c_839,plain,
sK0(i2003_11_14_17_18_2750) = sK1(i2003_11_14_17_18_2750),
inference(forward_subsumption_resolution,[status(thm)],[c_836,c_63]) ).
tcf(c_840,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_2750)
| ~ cp1(sK0(i2003_11_14_17_18_2750)) ),
inference(superposition,[status(thm)],[c_839,c_57]) ).
tcf(c_842,plain,
~ cp1(sK0(i2003_11_14_17_18_2750)),
inference(forward_subsumption_resolution,[status(thm)],[c_840,c_63]) ).
tcf(c_843,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_842,c_70,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS069+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.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 19:24:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.66/1.16 % SZS status Started for theBenchmark.p
% 1.66/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.66/1.16
% 1.66/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.66/1.16
% 1.66/1.16 % ------ iProver source info
% 1.66/1.16
% 1.66/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.66/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.66/1.16 % git: non_committed_changes: false
% 1.66/1.16
% 1.66/1.16 % ------ Parsing...
% 1.66/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.66/1.16
% 1.66/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.66/1.16
% 1.66/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.66/1.16
% 1.66/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.66/1.16 % ------ Proving...
% 1.66/1.16 % ------ Problem Properties
% 1.66/1.16
% 1.66/1.16 %
% 1.66/1.16 % clauses 12
% 1.66/1.16 % conjectures 0
% 1.66/1.16 % EPR 6
% 1.66/1.16 % Horn 11
% 1.66/1.16 % unary 1
% 1.66/1.16 % binary 7
% 1.66/1.16 % lits 31
% 1.66/1.16 % lits eq 3
% 1.66/1.16 % fd_pure 0
% 1.66/1.16 % fd_pseudo 0
% 1.66/1.16 % fd_cond 0
% 1.66/1.16 % fd_pseudo_cond 3
% 1.66/1.16 % AC symbols 0
% 1.66/1.16
% 1.66/1.16 % ------ Schedule dynamic 5 is on
% 1.66/1.16
% 1.66/1.16 % ------ no conjectures: strip conj schedule
% 1.66/1.16
% 1.66/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.66/1.16
% 1.66/1.16
% 1.66/1.16 % ------
% 1.66/1.16 % Current options:
% 1.66/1.16 % ------
% 1.66/1.16
% 1.66/1.16
% 1.66/1.16 %
% 1.66/1.16
% 1.66/1.16 % ------ Proving...
% 1.66/1.16 %
% 1.66/1.16
% 1.66/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.66/1.16
% 1.66/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.17
% 1.66/1.17
%------------------------------------------------------------------------------