%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS074+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 : n026.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.75s 1.48s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 111 ( 3 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 137 ( 52 ~; 44 |; 36 &)
% ( 3 <=>; 2 =>; 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn 37 !; 15 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rs(X0,X1)
=> ~ cp(X1) )
& ? [X1] :
( ? [X2] :
( cp(X2)
& rinvS(X1,X2) )
& cp(X1)
& rs(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_18_59896),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f31,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3] :
( rs(X0,X3)
=> ~ cp(X3) )
& ? [X1] :
( ? [X2] :
( cp(X2)
& rinvS(X1,X2) )
& cp(X1)
& rs(X0,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3] :
( ~ rs(X0,X3)
| ~ cp(X3) )
& ? [X1] :
( ? [X2] :
( cp(X2)
& rinvS(X1,X2) )
& cp(X1)
& rs(X0,X1) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f78,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X3] :
( ~ rs(X0,X3)
| ~ cp(X3) )
& ? [X1] :
( ? [X2] :
( cp(X2)
& rinvS(X1,X2) )
& cp(X1)
& rs(X0,X1) ) ) )
& ( ? [X3] :
( rs(X0,X3)
& cp(X3) )
| ! [X1] :
( ! [X2] :
( ~ cp(X2)
| ~ rinvS(X1,X2) )
| ~ cp(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f79,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X3] :
( ~ rs(X0,X3)
| ~ cp(X3) )
& ? [X1] :
( ? [X2] :
( cp(X2)
& rinvS(X1,X2) )
& cp(X1)
& rs(X0,X1) ) ) )
& ( ? [X3] :
( rs(X0,X3)
& cp(X3) )
| ! [X1] :
( ! [X2] :
( ~ cp(X2)
| ~ rinvS(X1,X2) )
| ~ cp(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X6] :
( ~ rs(X0,X6)
| ~ cp(X6) )
& ? [X4] :
( ? [X5] :
( cp(X5)
& rinvS(X4,X5) )
& cp(X4)
& rs(X0,X4) ) ) )
& ( ? [X3] :
( rs(X0,X3)
& cp(X3) )
| ! [X1] :
( ! [X2] :
( ~ cp(X2)
| ~ rinvS(X1,X2) )
| ~ cp(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f79]) ).
fof(f81,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X6] :
( ~ rs(X0,X6)
| ~ cp(X6) )
& cp(sK2(X0))
& rinvS(sK1(X0),sK2(X0))
& cp(sK1(X0))
& rs(X0,sK1(X0)) ) )
& ( ( rs(X0,sK0(X0))
& cp(sK0(X0)) )
| ! [X1] :
( ! [X2] :
( ~ cp(X2)
| ~ rinvS(X1,X2) )
| ~ cp(X1)
| ~ rs(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0))],[f80]) ).
fof(f107,plain,
! [X0,X6] :
( ~ cUnsatisfiable(X0)
| ~ rs(X0,X6)
| ~ cp(X6) ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp(sK1(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f111,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f123,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(cnf_transformation,[],[f28]) ).
tcf(c_55,plain,
! [X0: $i] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_56,plain,
! [X0: $i] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ cp(X1)
| ~ cUnsatisfiable(X0)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_69,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(cnf_transformation,[],[f123]) ).
tcf(c_102,plain,
! [X0: $i] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_55]) ).
tcf(c_104,plain,
! [X0: $i] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
tcf(c_402,plain,
! [X0: $i,X1: $i] :
( ~ cp(X1)
| ~ rs(X0,X1)
| ( X0 != i2003_11_14_17_18_59896 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_69]) ).
tcf(c_403,plain,
! [X0: $i] :
( ~ cp(X0)
| ~ rs(i2003_11_14_17_18_59896,X0) ),
inference(unflattening,[status(thm)],[c_402]) ).
tcf(c_421,plain,
! [X0: $i] :
( cp(sK1(X0))
| ( X0 != i2003_11_14_17_18_59896 ) ),
inference(resolution_lifted,[status(thm)],[c_104,c_69]) ).
tcf(c_422,plain,
cp(sK1(i2003_11_14_17_18_59896)),
inference(unflattening,[status(thm)],[c_421]) ).
tcf(c_426,plain,
! [X0: $i] :
( rs(X0,sK1(X0))
| ( X0 != i2003_11_14_17_18_59896 ) ),
inference(resolution_lifted,[status(thm)],[c_102,c_69]) ).
tcf(c_427,plain,
rs(i2003_11_14_17_18_59896,sK1(i2003_11_14_17_18_59896)),
inference(unflattening,[status(thm)],[c_426]) ).
tcf(c_907,plain,
~ cp(sK1(i2003_11_14_17_18_59896)),
inference(superposition,[status(thm)],[c_427,c_403]) ).
tcf(c_908,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_907,c_422]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS074+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/0.58 % Computer : n026.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Wed Sep 23 19:23:09 UTC 2026
% 0.14/0.58 % CPUTime :
% 0.14/0.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.62 Running first-order theorem proving
% 0.14/0.62 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.15/0.63
% 0.15/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.63
% 0.15/0.63 % Detected problem language: tptp
% 0.15/0.64 % Proving...
% 1.75/1.48 % SZS status Started for theBenchmark.p
% 1.75/1.48 % SZS status Unsatisfiable for theBenchmark.p
% 1.75/1.48
% 1.75/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.75/1.48
% 1.75/1.48 % ------ iProver source info
% 1.75/1.48
% 1.75/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 1.75/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.75/1.48 % git: non_committed_changes: false
% 1.75/1.48
% 1.75/1.48 % ------ Parsing...
% 1.75/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.75/1.48
% 1.75/1.48 % ------ 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 %
% 1.75/1.48
% 1.75/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.75/1.48
% 1.75/1.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.75/1.48 % ------ Proving...
% 1.75/1.48 % ------ Problem Properties
% 1.75/1.48
% 1.75/1.48 %
% 1.75/1.48 % clauses 14
% 1.75/1.48 % conjectures 0
% 1.75/1.48 % EPR 6
% 1.75/1.48 % Horn 14
% 1.75/1.48 % unary 4
% 1.75/1.48 % binary 5
% 1.75/1.48 % lits 33
% 1.75/1.49 % lits eq 3
% 1.75/1.49 % fd_pure 0
% 1.75/1.49 % fd_pseudo 0
% 1.75/1.49 % fd_cond 0
% 1.75/1.49 % fd_pseudo_cond 3
% 1.75/1.49 % AC symbols 0
% 1.75/1.49
% 1.75/1.49 % ------ Schedule dynamic 5 is on
% 1.75/1.49
% 1.75/1.49 % ------ no conjectures: strip conj schedule
% 1.75/1.49
% 1.75/1.49 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.75/1.49
% 1.75/1.49
% 1.75/1.49 % ------
% 1.75/1.49 % Current options:
% 1.75/1.49 % ------
% 1.75/1.49
% 1.75/1.49
% 1.75/1.49 %
% 1.75/1.49
% 1.75/1.49 % ------ Proving...
% 1.75/1.49 %
% 1.75/1.49
% 1.75/1.49 % SZS status Unsatisfiable for theBenchmark.p
% 1.75/1.49
% 1.75/1.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.49
% 1.75/1.49
%------------------------------------------------------------------------------