%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS085+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.71s 1.27s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 175 ( 71 ~; 65 |; 34 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 73 ( 0 sgn 60 !; 13 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( rinvR(X2,X3)
=> ~ cp1(X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f20,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f21,axiom,
! [X0,X1,X2] :
( ( rr(X1,X2)
& rr(X0,X1) )
=> rr(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f51,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ rinvR(X2,X3)
| ~ cp1(X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ rr(X1,X2)
| ~ rr(X0,X1)
| rr(X0,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ rr(X1,X2)
| ~ rr(X0,X1)
| rr(X0,X2) ),
inference(flattening,[],[f54]) ).
fof(f57,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ rinvR(X2,X3)
| ~ cp1(X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) )
& ( ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( rinvR(X2,X3)
& cp1(X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f58,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ rinvR(X2,X3)
| ~ cp1(X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) )
& ( ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( rinvR(X2,X3)
& cp1(X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(X0)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ~ rinvR(X5,X6)
| ~ cp1(X6) )
& cp1(X5)
& rr(X4,X5) )
& rr(X0,X4) ) ) )
& ( ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( rinvR(X2,X3)
& cp1(X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(X0)
& ! [X6] :
( ~ rinvR(sK2(X0),X6)
| ~ cp1(X6) )
& cp1(sK2(X0))
& rr(sK1(X0),sK2(X0))
& rr(X0,sK1(X0)) ) )
& ( ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ( rinvR(X2,sK0(X2))
& cp1(sK0(X2)) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X2)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0))],[f59]) ).
fof(f62,plain,
! [X0,X1] :
( ( ~ rinvR(X0,X1)
| rr(X1,X0) )
& ( ~ rr(X1,X0)
| rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f81,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f82,plain,
! [X0,X6] :
( ~ cUnsatisfiable(X0)
| ~ rinvR(sK2(X0),X6)
| ~ cp1(X6) ),
inference(cnf_transformation,[],[f60]) ).
fof(f84,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(sK1(X0),sK2(X0)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f85,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f92,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ rr(X1,X2)
| ~ rr(X0,X1)
| rr(X0,X2) ),
inference(cnf_transformation,[],[f55]) ).
fof(f94,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,plain,
! [X0: $i] :
( rr(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_56,plain,
! [X0: $i] :
( rr(sK1(X0),sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ~ cp1(X1)
| ~ cUnsatisfiable(X0)
| ~ rinvR(sK2(X0),X1) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_59,plain,
! [X0: $i] :
( cp1(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( rinvR(X1,X0)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( rr(X0,X2)
| ~ rr(X1,X2)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_66,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnf_transformation,[],[f94]) ).
tcf(c_70,plain,
( cp1(i2003_11_14_17_19_39537)
| ~ cUnsatisfiable(i2003_11_14_17_19_39537) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_77,plain,
( rr(i2003_11_14_17_19_39537,sK1(i2003_11_14_17_19_39537))
| ~ cUnsatisfiable(i2003_11_14_17_19_39537) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_78,plain,
( rr(sK1(i2003_11_14_17_19_39537),sK2(i2003_11_14_17_19_39537))
| ~ cUnsatisfiable(i2003_11_14_17_19_39537) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] :
( rinvR(X1,X0)
| ~ rr(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_368,plain,
! [X0: $i,X1: $i] :
( ~ cp1(X0)
| ~ cUnsatisfiable(X1)
| ~ rr(X0,sK2(X1)) ),
inference(resolution,[status(thm)],[c_58,c_96]) ).
tcf(c_369,plain,
( ~ cp1(i2003_11_14_17_19_39537)
| ~ cUnsatisfiable(i2003_11_14_17_19_39537)
| ~ rr(i2003_11_14_17_19_39537,sK2(i2003_11_14_17_19_39537)) ),
inference(instantiation,[status(thm)],[c_368]) ).
tcf(c_1009,plain,
! [X0: $i,X1: $i] :
( rr(X0,X1)
| ~ rr(X0,sK1(X0))
| ~ rr(sK1(X0),X1) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_1021,plain,
! [X0: $i] :
( rr(X0,sK2(X0))
| ~ rr(X0,sK1(X0))
| ~ rr(sK1(X0),sK2(X0)) ),
inference(instantiation,[status(thm)],[c_1009]) ).
tcf(c_1022,plain,
( rr(i2003_11_14_17_19_39537,sK2(i2003_11_14_17_19_39537))
| ~ rr(i2003_11_14_17_19_39537,sK1(i2003_11_14_17_19_39537))
| ~ rr(sK1(i2003_11_14_17_19_39537),sK2(i2003_11_14_17_19_39537)) ),
inference(instantiation,[status(thm)],[c_1021]) ).
tcf(c_1023,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1022,c_369,c_78,c_77,c_70,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS085+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.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 19:21:04 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.71/1.27 % SZS status Started for theBenchmark.p
% 1.71/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.27
% 1.71/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.71/1.27
% 1.71/1.27 % ------ iProver source info
% 1.71/1.27
% 1.71/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.71/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.71/1.27 % git: non_committed_changes: false
% 1.71/1.27
% 1.71/1.27 % ------ Parsing...
% 1.71/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.71/1.27
% 1.71/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.71/1.27
% 1.71/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.71/1.27 % ------ Proving...
% 1.71/1.27 % ------ Problem Properties
% 1.71/1.27
% 1.71/1.27 %
% 1.71/1.27 % clauses 11
% 1.71/1.27 % conjectures 0
% 1.71/1.27 % EPR 5
% 1.71/1.27 % Horn 9
% 1.71/1.27 % unary 1
% 1.71/1.27 % binary 6
% 1.71/1.27 % lits 31
% 1.71/1.27 % lits eq 0
% 1.71/1.27 % fd_pure 0
% 1.71/1.27 % fd_pseudo 0
% 1.71/1.27 % fd_cond 0
% 1.71/1.27 % fd_pseudo_cond 0
% 1.71/1.27 % AC symbols 0
% 1.71/1.27
% 1.71/1.27 % ------ Schedule dynamic 5 is on
% 1.71/1.27
% 1.71/1.27 % ------ no conjectures: strip conj schedule
% 1.71/1.27
% 1.71/1.27 % ------ no equalities: superposition off
% 1.71/1.27
% 1.71/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.71/1.27
% 1.71/1.27
% 1.71/1.27 % ------
% 1.71/1.27 % Current options:
% 1.71/1.27 % ------
% 1.71/1.27
% 1.71/1.27
% 1.71/1.27 %
% 1.71/1.27
% 1.71/1.27 % ------ Proving...
% 1.71/1.27 %
% 1.71/1.27
% 1.71/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.27
% 1.71/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.71/1.27
% 1.71/1.27
%------------------------------------------------------------------------------