%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS070+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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.93s 1.29s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 6 unt; 0 def)
% Number of atoms : 167 ( 8 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 204 ( 81 ~; 72 |; 45 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 87 ( 0 sgn 70 !; 17 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cc1(X1)
& rrx3(X0,X1) )
& ~ ? [X1] :
( cc1(X1)
& cc2(X1)
& rrx3(X0,X1) )
& ? [X1] :
( cc2(X1)
& rrx4(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( rrx(X0,X2)
& rrx(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f36,axiom,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f37,axiom,
! [X0,X1] :
( rrx3(X0,X1)
=> rrx(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f44,axiom,
! [X0,X1] :
( rrx4(X0,X1)
=> rrx(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_16) ).
fof(f45,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X3] :
( cc1(X3)
& rrx3(X0,X3) )
& ~ ? [X2] :
( cc1(X2)
& cc2(X2)
& rrx3(X0,X2) )
& ? [X1] :
( cc2(X1)
& rrx4(X0,X1) ) ) ),
inference(rectify,[],[f30]) ).
fof(f100,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X3] :
( cc1(X3)
& rrx3(X0,X3) )
& ! [X2] :
( ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X0,X2) )
& ? [X1] :
( cc2(X1)
& rrx4(X0,X1) ) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ~ rrx(X0,X2)
| ~ rrx(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f31]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ~ rrx(X0,X2)
| ~ rrx(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f101]) ).
fof(f111,plain,
! [X0,X1] :
( ~ rrx3(X0,X1)
| rrx(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f118,plain,
! [X0,X1] :
( ~ rrx4(X0,X1)
| rrx(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f120,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cc1(X3)
& rrx3(X0,X3) )
& ! [X2] :
( ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X0,X2) )
& ? [X1] :
( cc2(X1)
& rrx4(X0,X1) ) ) )
& ( ! [X3] :
( ~ cc1(X3)
| ~ rrx3(X0,X3) )
| ? [X2] :
( cc1(X2)
& cc2(X2)
& rrx3(X0,X2) )
| ! [X1] :
( ~ cc2(X1)
| ~ rrx4(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f121,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cc1(X3)
& rrx3(X0,X3) )
& ! [X2] :
( ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X0,X2) )
& ? [X1] :
( cc2(X1)
& rrx4(X0,X1) ) ) )
& ( ! [X3] :
( ~ cc1(X3)
| ~ rrx3(X0,X3) )
| ? [X2] :
( cc1(X2)
& cc2(X2)
& rrx3(X0,X2) )
| ! [X1] :
( ~ cc2(X1)
| ~ rrx4(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f120]) ).
fof(f122,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X6] :
( cc1(X6)
& rrx3(X0,X6) )
& ! [X5] :
( ~ cc1(X5)
| ~ cc2(X5)
| ~ rrx3(X0,X5) )
& ? [X4] :
( cc2(X4)
& rrx4(X0,X4) ) ) )
& ( ! [X3] :
( ~ cc1(X3)
| ~ rrx3(X0,X3) )
| ? [X2] :
( cc1(X2)
& cc2(X2)
& rrx3(X0,X2) )
| ! [X1] :
( ~ cc2(X1)
| ~ rrx4(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f121]) ).
fof(f123,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cc1(sK2(X0))
& rrx3(X0,sK2(X0))
& ! [X5] :
( ~ cc1(X5)
| ~ cc2(X5)
| ~ rrx3(X0,X5) )
& cc2(sK1(X0))
& rrx4(X0,sK1(X0)) ) )
& ( ! [X3] :
( ~ cc1(X3)
| ~ rrx3(X0,X3) )
| ( cc1(sK0(X0))
& cc2(sK0(X0))
& rrx3(X0,sK0(X0)) )
| ! [X1] :
( ~ cc2(X1)
| ~ rrx4(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X6,sK2(X0))],[f122]) ).
fof(f155,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cc1(sK2(X0)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f156,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rrx3(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f157,plain,
! [X0,X5] :
( ~ cUnsatisfiable(X0)
| ~ cc1(X5)
| ~ cc2(X5)
| ~ rrx3(X0,X5) ),
inference(cnf_transformation,[],[f123]) ).
fof(f158,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cc2(sK1(X0)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f159,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rrx4(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ rrx(X0,X2)
| ~ rrx(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f102]) ).
fof(f168,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
inference(cnf_transformation,[],[f36]) ).
fof(f169,plain,
! [X0,X1] :
( ~ rrx3(X0,X1)
| rrx(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f176,plain,
! [X0,X1] :
( ~ rrx4(X0,X1)
| rrx(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_56,plain,
! [X0: $i] :
( rrx4(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_57,plain,
! [X0: $i] :
( cc2(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f158]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ~ cc1(X1)
| ~ cc2(X1)
| ~ cUnsatisfiable(X0)
| ~ rrx3(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_59,plain,
! [X0: $i] :
( rrx3(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f156]) ).
tcf(c_60,plain,
! [X0: $i] :
( cc1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rrx(X0,X2)
| ~ rrx(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_66,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
inference(cnf_transformation,[],[f168]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( rrx(X0,X1)
| ~ rrx3(X0,X1) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( rrx(X0,X1)
| ~ rrx4(X0,X1) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_79,plain,
( cc2(sK1(i2003_11_14_17_18_32242))
| ~ cUnsatisfiable(i2003_11_14_17_18_32242) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1838,plain,
! [X0: $i] :
( rrx(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_59,c_67]) ).
tcf(c_1846,plain,
! [X0: $i] :
( rrx(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_56,c_74]) ).
tcf(c_1862,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cc1(sK2(X0))
| ~ cc2(sK2(X0)) ),
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_1873,plain,
! [X0: $i,X1: $i] :
( ( sK2(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rrx(X0,X1) ),
inference(superposition,[status(thm)],[c_1838,c_61]) ).
tcf(c_1922,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cc2(sK2(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_1862,c_60,c_1862]) ).
tcf(c_1936,plain,
! [X0: $i] :
( ( sK1(X0) = sK2(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1846,c_1873]) ).
tcf(c_1944,plain,
sK1(i2003_11_14_17_18_32242) = sK2(i2003_11_14_17_18_32242),
inference(superposition,[status(thm)],[c_66,c_1936]) ).
tcf(c_1945,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_32242)
| ~ cc2(sK1(i2003_11_14_17_18_32242)) ),
inference(superposition,[status(thm)],[c_1944,c_1922]) ).
tcf(c_1952,plain,
~ cc2(sK1(i2003_11_14_17_18_32242)),
inference(forward_subsumption_resolution,[status(thm)],[c_1945,c_66]) ).
tcf(c_1953,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1952,c_79,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS070+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Sep 23 19:18:47 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 1.93/1.29 % SZS status Started for theBenchmark.p
% 1.93/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.93/1.29
% 1.93/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.93/1.29
% 1.93/1.29 % ------ iProver source info
% 1.93/1.29
% 1.93/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.93/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.93/1.29 % git: non_committed_changes: false
% 1.93/1.29
% 1.93/1.29 % ------ Parsing...
% 1.93/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.93/1.29
% 1.93/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 13 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.93/1.29
% 1.93/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.93/1.29
% 1.93/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.93/1.29 % ------ Proving...
% 1.93/1.29 % ------ Problem Properties
% 1.93/1.29
% 1.93/1.29 %
% 1.93/1.29 % clauses 14
% 1.93/1.29 % conjectures 0
% 1.93/1.29 % EPR 7
% 1.93/1.29 % Horn 11
% 1.93/1.29 % unary 1
% 1.93/1.29 % binary 6
% 1.93/1.29 % lits 44
% 1.93/1.29 % lits eq 3
% 1.93/1.29 % fd_pure 0
% 1.93/1.29 % fd_pseudo 0
% 1.93/1.29 % fd_cond 0
% 1.93/1.29 % fd_pseudo_cond 3
% 1.93/1.29 % AC symbols 0
% 1.93/1.29
% 1.93/1.29 % ------ Schedule dynamic 5 is on
% 1.93/1.29
% 1.93/1.29 % ------ no conjectures: strip conj schedule
% 1.93/1.29
% 1.93/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.93/1.29
% 1.93/1.29
% 1.93/1.29 % ------
% 1.93/1.29 % Current options:
% 1.93/1.29 % ------
% 1.93/1.29
% 1.93/1.29
% 1.93/1.29 %
% 1.93/1.29
% 1.93/1.29 % ------ Proving...
% 1.93/1.29 %
% 1.93/1.29
% 1.93/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.93/1.29
% 1.93/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.93/1.29
% 1.93/1.29
%------------------------------------------------------------------------------