%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS072+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.68s 1.27s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 6 unt; 0 def)
% Number of atoms : 175 ( 20 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 220 ( 90 ~; 79 |; 45 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 93 ( 0 sgn 75 !; 18 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X4] :
( cp1(X4)
& rr(X1,X4) )
& ! [X2,X3] :
( ( rr(X1,X3)
& rr(X1,X2) )
=> X2 = X3 )
& rinvR(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X0] :
( cp1(X0)
=> ~ ( cp5(X0)
| cp4(X0)
| cp2(X0)
| cp3(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f22,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f23,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f52,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X4] :
( cp1(X4)
& rr(X1,X4) )
& ! [X2,X3] :
( ~ rr(X1,X3)
| ~ rr(X1,X2)
| X2 = X3 )
& rinvR(X0,X1) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f53,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X4] :
( cp1(X4)
& rr(X1,X4) )
& ! [X2,X3] :
( ~ rr(X1,X3)
| ~ rr(X1,X2)
| X2 = X3 )
& rinvR(X0,X1) ) ) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ~ cp1(X0)
| ( ~ cp5(X0)
& ~ cp4(X0)
& ~ cp2(X0)
& ~ cp3(X0) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f59,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp2(X0)
& ? [X1] :
( ? [X4] :
( cp1(X4)
& rr(X1,X4) )
& ! [X2,X3] :
( ~ rr(X1,X3)
| ~ rr(X1,X2)
| X2 = X3 )
& rinvR(X0,X1) ) ) )
& ( ~ cp2(X0)
| ! [X1] :
( ! [X4] :
( ~ cp1(X4)
| ~ rr(X1,X4) )
| ? [X2,X3] :
( rr(X1,X3)
& rr(X1,X2)
& X2 != X3 )
| ~ rinvR(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f60,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp2(X0)
& ? [X1] :
( ? [X4] :
( cp1(X4)
& rr(X1,X4) )
& ! [X2,X3] :
( ~ rr(X1,X3)
| ~ rr(X1,X2)
| X2 = X3 )
& rinvR(X0,X1) ) ) )
& ( ~ cp2(X0)
| ! [X1] :
( ! [X4] :
( ~ cp1(X4)
| ~ rr(X1,X4) )
| ? [X2,X3] :
( rr(X1,X3)
& rr(X1,X2)
& X2 != X3 )
| ~ rinvR(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp2(X0)
& ? [X5] :
( ? [X8] :
( cp1(X8)
& rr(X5,X8) )
& ! [X6,X7] :
( ~ rr(X5,X7)
| ~ rr(X5,X6)
| X6 = X7 )
& rinvR(X0,X5) ) ) )
& ( ~ cp2(X0)
| ! [X1] :
( ! [X4] :
( ~ cp1(X4)
| ~ rr(X1,X4) )
| ? [X2,X3] :
( rr(X1,X3)
& rr(X1,X2)
& X2 != X3 )
| ~ rinvR(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp2(X0)
& cp1(sK3(X0))
& rr(sK2(X0),sK3(X0))
& ! [X6,X7] :
( ~ rr(sK2(X0),X7)
| ~ rr(sK2(X0),X6)
| X6 = X7 )
& rinvR(X0,sK2(X0)) ) )
& ( ~ cp2(X0)
| ! [X1] :
( ! [X4] :
( ~ cp1(X4)
| ~ rr(X1,X4) )
| ( rr(X1,sK1(X1))
& rr(X1,sK0(X1))
& sK0(X1) != sK1(X1) )
| ~ rinvR(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X2,sK0(X1)),skolemize(X3,sK1(X1)),skolemize(X5,sK2(X0)),skolemize(X8,sK3(X0))],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( ~ rinvR(X0,X1)
| rr(X1,X0) )
& ( ~ rr(X1,X0)
| rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f82,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp2(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f83,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK3(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f84,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(sK2(X0),sK3(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f85,plain,
! [X0,X6,X7] :
( ~ cUnsatisfiable(X0)
| ~ rr(sK2(X0),X7)
| ~ rr(sK2(X0),X6)
| X6 = X7 ),
inference(cnf_transformation,[],[f62]) ).
fof(f86,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rinvR(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
! [X0] :
( ~ cp1(X0)
| ~ cp2(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f100,plain,
! [X0,X1] :
( ~ rinvR(X0,X1)
| rr(X1,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f102,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnf_transformation,[],[f23]) ).
tcf(c_56,plain,
! [X0: $i] :
( rinvR(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ cUnsatisfiable(X0)
| ~ rr(sK2(X0),X2)
| ~ rr(sK2(X0),X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_58,plain,
! [X0: $i] :
( rr(sK2(X0),sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_59,plain,
! [X0: $i] :
( cp1(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_60,plain,
! [X0: $i] :
( cp2(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_62,plain,
! [X0: $i] :
( ~ cp2(X0)
| ~ cp1(X0) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( rr(X1,X0)
| ~ rinvR(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_73,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnf_transformation,[],[f102]) ).
tcf(c_99,plain,
! [X0: $i] :
( cp2(X0)
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
tcf(c_101,plain,
! [X0: $i] :
( rinvR(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
tcf(c_105,plain,
! [X0: $i] :
( cp1(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i] :
( rr(X1,X0)
| ~ rinvR(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
tcf(c_111,plain,
! [X0: $i] :
( ~ cp1(X0)
| ~ cp2(X0) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
tcf(c_112,plain,
! [X0: $i] :
( ~ cp2(X0)
| ~ cp1(X0) ),
inference(renaming,[status(thm)],[c_111]) ).
tcf(c_502,plain,
! [X0: $i,X1: $i] :
( ~ cp2(X1)
| ~ cUnsatisfiable(X0)
| ( sK3(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_105,c_112]) ).
tcf(c_503,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp2(sK3(X0)) ),
inference(unflattening,[status(thm)],[c_502]) ).
tcf(c_537,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X0)
| ( sK3(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_99,c_503]) ).
tcf(c_538,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(sK3(X0)) ),
inference(unflattening,[status(thm)],[c_537]) ).
tcf(c_550,plain,
! [X0: $i,X1: $i,X2: $i] :
( rr(X2,X0)
| ~ cUnsatisfiable(X1)
| ( X0 != X1 )
| ( sK2(X1) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_107,c_101]) ).
tcf(c_551,plain,
! [X0: $i] :
( rr(sK2(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(unflattening,[status(thm)],[c_550]) ).
tcf(c_722,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ cUnsatisfiable(X0)
| ~ rr(sK2(X0),X1) ),
inference(superposition,[status(thm)],[c_551,c_57]) ).
tcf(c_736,plain,
! [X0: $i] :
( ( sK3(X0) = X0 )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_58,c_722]) ).
tcf(c_745,plain,
sK3(i2003_11_14_17_18_50190) = i2003_11_14_17_18_50190,
inference(superposition,[status(thm)],[c_73,c_736]) ).
tcf(c_747,plain,
~ cUnsatisfiable(i2003_11_14_17_18_50190),
inference(superposition,[status(thm)],[c_745,c_538]) ).
tcf(c_748,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_747,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS072+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.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 19:24:20 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.68/1.27 % SZS status Started for theBenchmark.p
% 1.68/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.27
% 1.68/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.68/1.27
% 1.68/1.27 % ------ iProver source info
% 1.68/1.27
% 1.68/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.68/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.68/1.27 % git: non_committed_changes: false
% 1.68/1.27
% 1.68/1.27 % ------ Parsing...
% 1.68/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.68/1.27
% 1.68/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 14 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.68/1.27
% 1.68/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.68/1.27
% 1.68/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.68/1.27 % ------ Proving...
% 1.68/1.27 % ------ Problem Properties
% 1.68/1.27
% 1.68/1.27 %
% 1.68/1.27 % clauses 5
% 1.68/1.27 % conjectures 0
% 1.68/1.27 % EPR 1
% 1.68/1.27 % Horn 5
% 1.68/1.27 % unary 1
% 1.68/1.27 % binary 3
% 1.68/1.27 % lits 11
% 1.68/1.27 % lits eq 1
% 1.68/1.27 % fd_pure 0
% 1.68/1.27 % fd_pseudo 0
% 1.68/1.27 % fd_cond 0
% 1.68/1.27 % fd_pseudo_cond 1
% 1.68/1.27 % AC symbols 0
% 1.68/1.27
% 1.68/1.27 % ------ Schedule dynamic 5 is on
% 1.68/1.27
% 1.68/1.27 % ------ no conjectures: strip conj schedule
% 1.68/1.27
% 1.68/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.68/1.27
% 1.68/1.27
% 1.68/1.27 % ------
% 1.68/1.27 % Current options:
% 1.68/1.27 % ------
% 1.68/1.27
% 1.68/1.27
% 1.68/1.27 %
% 1.68/1.27
% 1.68/1.27 % ------ Proving...
% 1.68/1.27 %
% 1.68/1.27
% 1.68/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.27
% 1.68/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.68/1.27
% 1.68/1.27
%------------------------------------------------------------------------------