%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS088+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 : n014.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:07 PM UTC 2026
% Result : Unsatisfiable 1.84s 6.30s
% Output : CNFRefutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 114 ( 8 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 137 ( 58 ~; 51 |; 23 &)
% ( 3 <=>; 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn 57 !; 10 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( cp1(X1)
& ! [X2] :
( rinvF(X1,X2)
=> ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) ) )
& rf(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f19,axiom,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_49673),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f51,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( cp1(X1)
& ! [X2] :
( ~ rinvF(X1,X2)
| ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) ) )
& rf(X0,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f18]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f52]) ).
fof(f57,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ? [X1] :
( cp1(X1)
& ! [X2] :
( ~ rinvF(X1,X2)
| ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) ) )
& rf(X0,X1) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ? [X2] :
( rinvF(X1,X2)
& ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) ) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f58,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ? [X4] :
( cp1(X4)
& ! [X5] :
( ~ rinvF(X4,X5)
| ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) ) )
& rf(X0,X4) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ? [X2] :
( rinvF(X1,X2)
& ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) ) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(sK1(X0))
& ! [X5] :
( ~ rinvF(sK1(X0),X5)
| ( ~ cp1(sK2(X5))
& rf(X5,sK2(X5)) ) )
& rf(X0,sK1(X0)) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ( rinvF(X1,sK0(X1))
& ! [X3] :
( cp1(X3)
| ~ rf(sK0(X1),X3) ) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X1)),skolemize(X4,sK1(X0)),skolemize(X6,sK2(X5))],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ( ~ rinvF(X0,X1)
| rf(X1,X0) )
& ( ~ rf(X1,X0)
| rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f80,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK1(X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f81,plain,
! [X0,X5] :
( ~ cUnsatisfiable(X0)
| ~ rinvF(sK1(X0),X5)
| ~ cp1(sK2(X5)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f82,plain,
! [X0,X5] :
( ~ cUnsatisfiable(X0)
| ~ rinvF(sK1(X0),X5)
| rf(X5,sK2(X5)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f83,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f53]) ).
fof(f88,plain,
! [X0,X1] :
( ~ rf(X1,X0)
| rinvF(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f92,plain,
cUnsatisfiable(i2003_11_14_17_19_49673),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,plain,
! [X0: $i] :
( rf(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( rf(X1,sK2(X1))
| ~ cUnsatisfiable(X0)
| ~ rinvF(sK1(X0),X1) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK2(X1))
| ~ rinvF(sK1(X0),X1) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_58,plain,
! [X0: $i] :
( cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( rinvF(X1,X0)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_65,plain,
cUnsatisfiable(i2003_11_14_17_19_49673),
inference(cnf_transformation,[],[f92]) ).
tcf(c_69,plain,
( cp1(sK1(i2003_11_14_17_19_49673))
| ~ cUnsatisfiable(i2003_11_14_17_19_49673) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1214,plain,
! [X0: $i] :
( rinvF(sK1(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_55,c_60]) ).
tcf(c_1233,plain,
! [X0: $i] :
( rf(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1214,c_56]) ).
tcf(c_1251,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK2(X0)) ),
inference(superposition,[status(thm)],[c_1214,c_57]) ).
tcf(c_1261,plain,
! [X0: $i,X1: $i] :
( ( sK1(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf(X0,X1) ),
inference(superposition,[status(thm)],[c_55,c_59]) ).
tcf(c_1319,plain,
! [X0: $i] :
( ( sK1(X0) = sK2(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1233,c_1261]) ).
tcf(c_1327,plain,
sK1(i2003_11_14_17_19_49673) = sK2(i2003_11_14_17_19_49673),
inference(superposition,[status(thm)],[c_65,c_1319]) ).
tcf(c_1328,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_49673)
| ~ cp1(sK1(i2003_11_14_17_19_49673)) ),
inference(superposition,[status(thm)],[c_1327,c_1251]) ).
tcf(c_1333,plain,
~ cp1(sK1(i2003_11_14_17_19_49673)),
inference(forward_subsumption_resolution,[status(thm)],[c_1328,c_65]) ).
tcf(c_1334,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1333,c_69,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS088+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n014.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Wed Sep 23 19:20:54 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 1.84/6.30 % SZS status Started for theBenchmark.p
% 1.84/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.84/6.30
% 1.84/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.84/6.30
% 1.84/6.30 % ------ iProver source info
% 1.84/6.30
% 1.84/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.84/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.84/6.30 % git: non_committed_changes: false
% 1.84/6.30
% 1.84/6.30 % ------ Parsing...
% 1.84/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.84/6.30
% 1.84/6.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.84/6.30
% 1.84/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.84/6.30
% 1.84/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.84/6.30 % ------ Proving...
% 1.84/6.30 % ------ Problem Properties
% 1.84/6.30
% 1.84/6.30 %
% 1.84/6.30 % clauses 10
% 1.84/6.30 % conjectures 0
% 1.84/6.30 % EPR 4
% 1.84/6.30 % Horn 8
% 1.84/6.30 % unary 1
% 1.84/6.30 % binary 4
% 1.84/6.30 % lits 27
% 1.84/6.30 % lits eq 1
% 1.84/6.30 % fd_pure 0
% 1.84/6.30 % fd_pseudo 0
% 1.84/6.30 % fd_cond 0
% 1.84/6.30 % fd_pseudo_cond 1
% 1.84/6.30 % AC symbols 0
% 1.84/6.30
% 1.84/6.30 % ------ Schedule dynamic 5 is on
% 1.84/6.30
% 1.84/6.30 % ------ no conjectures: strip conj schedule
% 1.84/6.30
% 1.84/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.84/6.30
% 1.84/6.30
% 1.84/6.30 % ------
% 1.84/6.30 % Current options:
% 1.84/6.30 % ------
% 1.84/6.30
% 1.84/6.30
% 1.84/6.30 %
% 1.84/6.30
% 1.84/6.30 % ------ Proving...
% 1.84/6.30 %
% 1.84/6.30
% 1.84/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.84/6.30
% 1.84/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.84/6.30
% 1.84/6.30
%------------------------------------------------------------------------------