%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS095+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 : n016.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.65s 1.28s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 135 ( 40 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 168 ( 67 ~; 57 |; 38 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 77 ( 0 sgn 57 !; 20 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X2)
& rr(X0,X1) )
=> X1 = X2 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_14253),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f15,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ( rr(X0,X4)
& rr(X0,X3) )
=> X3 = X4 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) ),
inference(rectify,[],[f12]) ).
fof(f34,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f35,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) ),
inference(flattening,[],[f34]) ).
fof(f38,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X3,X4] :
( ~ rr(X0,X4)
| ~ rr(X0,X3)
| X3 = X4 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ 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 )
& ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X7,X8] :
( ~ rr(X0,X8)
| ~ rr(X0,X7)
| X7 = X8 )
& ? [X5,X6] :
( X5 != X6
& rr(X0,X6)
& rr(X0,X5) ) ) )
& ( ? [X3,X4] :
( rr(X0,X4)
& rr(X0,X3)
& X3 != X4 )
| ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X7,X8] :
( ~ rr(X0,X8)
| ~ rr(X0,X7)
| X7 = X8 )
& sK2(X0) != sK3(X0)
& rr(X0,sK3(X0))
& rr(X0,sK2(X0)) ) )
& ( ( rr(X0,sK1(X0))
& rr(X0,sK0(X0))
& sK0(X0) != sK1(X0) )
| ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ 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)
| sK2(X0) != 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)
| rr(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f63,plain,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(cnf_transformation,[],[f14]) ).
tcf(c_56,plain,
! [X0: $i] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_57,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_58,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ( sK2(X0) != sK3(X0) ) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_59,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,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(cnf_transformation,[],[f63]) ).
tcf(c_84,plain,
! [X0: $i] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
tcf(c_86,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_88,plain,
! [X0: $i] :
( ( sK2(X0) != sK3(X0) )
| ~ cUnsatisfiable(X0) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_89,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ( sK2(X0) != sK3(X0) ) ),
inference(renaming,[status(thm)],[c_88]) ).
tcf(c_242,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rr(X0,X2)
| ~ rr(X0,X1)
| ( X0 != i2003_11_14_17_20_14253 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_61]) ).
tcf(c_243,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ rr(i2003_11_14_17_20_14253,X1)
| ~ rr(i2003_11_14_17_20_14253,X0) ),
inference(unflattening,[status(thm)],[c_242]) ).
tcf(c_254,plain,
! [X0: $i] :
( ( X0 != i2003_11_14_17_20_14253 )
| ( sK2(X0) != sK3(X0) ) ),
inference(resolution_lifted,[status(thm)],[c_89,c_61]) ).
tcf(c_255,plain,
sK2(i2003_11_14_17_20_14253) != sK3(i2003_11_14_17_20_14253),
inference(unflattening,[status(thm)],[c_254]) ).
tcf(c_259,plain,
! [X0: $i] :
( rr(X0,sK3(X0))
| ( X0 != i2003_11_14_17_20_14253 ) ),
inference(resolution_lifted,[status(thm)],[c_86,c_61]) ).
tcf(c_260,plain,
rr(i2003_11_14_17_20_14253,sK3(i2003_11_14_17_20_14253)),
inference(unflattening,[status(thm)],[c_259]) ).
tcf(c_264,plain,
! [X0: $i] :
( rr(X0,sK2(X0))
| ( X0 != i2003_11_14_17_20_14253 ) ),
inference(resolution_lifted,[status(thm)],[c_84,c_61]) ).
tcf(c_265,plain,
rr(i2003_11_14_17_20_14253,sK2(i2003_11_14_17_20_14253)),
inference(unflattening,[status(thm)],[c_264]) ).
tcf(c_479,plain,
! [X0: $i] :
( ( sK3(i2003_11_14_17_20_14253) = X0 )
| ~ rr(i2003_11_14_17_20_14253,X0) ),
inference(superposition,[status(thm)],[c_260,c_243]) ).
tcf(c_492,plain,
sK2(i2003_11_14_17_20_14253) = sK3(i2003_11_14_17_20_14253),
inference(superposition,[status(thm)],[c_265,c_479]) ).
tcf(c_493,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_492,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS095+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.10/0.37 % Computer : n016.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:26:57 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 1.65/1.28 % SZS status Started for theBenchmark.p
% 1.65/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.28
% 1.65/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.65/1.28
% 1.65/1.28 % ------ iProver source info
% 1.65/1.28
% 1.65/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.65/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.65/1.28 % git: non_committed_changes: false
% 1.65/1.28
% 1.65/1.28 % ------ Parsing...
% 1.65/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.65/1.28
% 1.65/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 6 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.65/1.28
% 1.65/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.65/1.28
% 1.65/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.65/1.28 % ------ Proving...
% 1.65/1.28 % ------ Problem Properties
% 1.65/1.28
% 1.65/1.28 %
% 1.65/1.28 % clauses 7
% 1.65/1.28 % conjectures 0
% 1.65/1.28 % EPR 1
% 1.65/1.28 % Horn 5
% 1.65/1.28 % unary 3
% 1.65/1.28 % binary 0
% 1.65/1.28 % lits 18
% 1.65/1.28 % lits eq 6
% 1.65/1.28 % fd_pure 0
% 1.65/1.28 % fd_pseudo 0
% 1.65/1.28 % fd_cond 0
% 1.65/1.28 % fd_pseudo_cond 4
% 1.65/1.28 % AC symbols 0
% 1.65/1.28
% 1.65/1.28 % ------ Schedule dynamic 5 is on
% 1.65/1.28
% 1.65/1.28 % ------ no conjectures: strip conj schedule
% 1.65/1.28
% 1.65/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.65/1.28
% 1.65/1.28
% 1.65/1.28 % ------
% 1.65/1.28 % Current options:
% 1.65/1.28 % ------
% 1.65/1.28
% 1.65/1.28
% 1.65/1.28 %
% 1.65/1.28
% 1.65/1.28 % ------ Proving...
% 1.65/1.28 %
% 1.65/1.28
% 1.65/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.28
% 1.65/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.28
% 1.65/1.28
%------------------------------------------------------------------------------