%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS096+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:08 PM UTC 2026
% Result : Unsatisfiable 1.70s 6.19s
% Output : CNFRefutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 4 unt; 0 def)
% Number of atoms : 157 ( 20 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 197 ( 77 ~; 67 |; 46 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 82 ( 0 sgn 62 !; 20 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X2,X3] :
( ( rr(X0,X3)
& rr(X0,X2) )
=> X2 = X3 )
& ? [X1] :
( cd(X1)
& rr(X0,X1) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f13,axiom,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f15,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ( rr(X0,X4)
& rr(X0,X3) )
=> X3 = X4 )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) ),
inference(rectify,[],[f12]) ).
fof(f34,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f35,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f38,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f39,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X2] :
( cd(X2)
& rr(X0,X2) )
& ? [X1] :
( cc(X1)
& rr(X0,X1) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X7,X8] :
( ~ rr(X0,X8)
| ~ rr(X0,X7)
| X7 = X8 )
& ? [X6] :
( cd(X6)
& rr(X0,X6) )
& ? [X5] :
( cc(X5)
& rr(X0,X5) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X7,X8] :
( ~ rr(X0,X8)
| ~ rr(X0,X7)
| X7 = X8 )
& cd(sK3(X0))
& rr(X0,sK3(X0))
& cc(sK2(X0))
& rr(X0,sK2(X0)) ) )
& ( ( rr(X0,sK1(X0))
& rr(X0,sK0(X0))
& sK0(X0) != sK1(X0) )
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0)),skolemize(X6,sK3(X0))],[f40]) ).
fof(f55,plain,
! [X0,X8,X7] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X8)
| ~ rr(X0,X7)
| X7 = X8 ),
inference(cnf_transformation,[],[f41]) ).
fof(f56,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cd(sK3(X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f57,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f58,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cc(sK2(X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f59,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f63,plain,
! [X0] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f64,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f14]) ).
tcf(c_56,plain,
! [X0: $i] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_57,plain,
! [X0: $i] :
( cc(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_58,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_59,plain,
! [X0: $i] :
( cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X2)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_61,plain,
! [X0: $i] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_62,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f64]) ).
tcf(c_79,plain,
! [X0: $i] :
( cc(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_83,plain,
! [X0: $i] :
( cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_85,plain,
! [X0: $i] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_86,plain,
! [X0: $i] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(renaming,[status(thm)],[c_85]) ).
tcf(c_337,plain,
! [X0: $i,X1: $i] :
( ~ cd(X1)
| ~ cUnsatisfiable(X0)
| ( sK2(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_79,c_86]) ).
tcf(c_338,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cd(sK2(X0)) ),
inference(unflattening,[status(thm)],[c_337]) ).
tcf(c_426,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X0)
| ( sK2(X0) != sK3(X1) ) ),
inference(resolution_lifted,[status(thm)],[c_83,c_338]) ).
tcf(c_427,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_18265)
| ( sK2(i2003_11_14_17_20_18265) != sK3(i2003_11_14_17_20_18265) ) ),
inference(instantiation,[status(thm)],[c_426]) ).
tcf(c_883,plain,
! [X0: $i,X1: $i] :
( ( sK2(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(superposition,[status(thm)],[c_56,c_60]) ).
tcf(c_900,plain,
! [X0: $i] :
( ( sK2(X0) = sK3(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_58,c_883]) ).
tcf(c_903,plain,
( ( sK2(i2003_11_14_17_20_18265) = sK3(i2003_11_14_17_20_18265) )
| ~ cUnsatisfiable(i2003_11_14_17_20_18265) ),
inference(instantiation,[status(thm)],[c_900]) ).
tcf(c_904,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_903,c_427,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS096+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/5.38 % Computer : n026.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 19:25:00 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 1.70/6.19 % SZS status Started for theBenchmark.p
% 1.70/6.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.70/6.19
% 1.70/6.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.70/6.19
% 1.70/6.19 % ------ iProver source info
% 1.70/6.19
% 1.70/6.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.70/6.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.70/6.19 % git: non_committed_changes: false
% 1.70/6.19
% 1.70/6.19 % ------ Parsing...
% 1.70/6.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.70/6.19
% 1.70/6.19 % ------ 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.70/6.19
% 1.70/6.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.70/6.19
% 1.70/6.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.70/6.19 % ------ Proving...
% 1.70/6.19 % ------ Problem Properties
% 1.70/6.19
% 1.70/6.19 %
% 1.70/6.19 % clauses 9
% 1.70/6.19 % conjectures 0
% 1.70/6.19 % EPR 2
% 1.70/6.19 % Horn 7
% 1.70/6.19 % unary 1
% 1.70/6.19 % binary 4
% 1.70/6.19 % lits 31
% 1.70/6.19 % lits eq 2
% 1.70/6.19 % fd_pure 0
% 1.70/6.19 % fd_pseudo 0
% 1.70/6.19 % fd_cond 0
% 1.70/6.19 % fd_pseudo_cond 1
% 1.70/6.19 % AC symbols 0
% 1.70/6.19
% 1.70/6.19 % ------ Schedule dynamic 5 is on
% 1.70/6.19
% 1.70/6.19 % ------ no conjectures: strip conj schedule
% 1.70/6.19
% 1.70/6.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.70/6.19
% 1.70/6.19
% 1.70/6.19 % ------
% 1.70/6.19 % Current options:
% 1.70/6.19 % ------
% 1.70/6.19
% 1.70/6.19
% 1.70/6.19 %
% 1.70/6.19
% 1.70/6.19 % ------ Proving...
% 1.70/6.19 %
% 1.70/6.19
% 1.70/6.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.70/6.19
% 1.70/6.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.70/6.19
% 1.70/6.19
%------------------------------------------------------------------------------