%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS076+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:06 PM UTC 2026
% Result : Unsatisfiable 1.97s 1.29s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 8 unt; 0 def)
% Number of atoms : 197 ( 16 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 228 ( 89 ~; 83 |; 46 &)
% ( 4 <=>; 6 =>; 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 : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 121 ( 0 sgn 100 !; 21 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( ! [X2] :
( rinvF1(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rs(X2,X3) ) )
& ~ cp(X1)
& rf1(X0,X1) )
& ? [X1] :
( cp(X1)
& rf(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f25,axiom,
! [X0,X1] :
( rinvF1(X0,X1)
<=> rf1(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_19_06193),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f31,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X2] :
( ! [X3] :
( rinvF1(X2,X3)
=> ? [X4] :
( cowlThing(X4)
& rs(X3,X4) ) )
& ~ cp(X2)
& rf1(X0,X2) )
& ? [X1] :
( cp(X1)
& rf(X0,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X2] :
( ! [X3] :
( ~ rinvF1(X2,X3)
| ? [X4] :
( cowlThing(X4)
& rs(X3,X4) ) )
& ~ cp(X2)
& rf1(X0,X2) )
& ? [X1] :
( cp(X1)
& rf(X0,X1) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f22]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f23]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f71]) ).
fof(f75,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f78,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X2] :
( ! [X3] :
( ~ rinvF1(X2,X3)
| ? [X4] :
( cowlThing(X4)
& rs(X3,X4) ) )
& ~ cp(X2)
& rf1(X0,X2) )
& ? [X1] :
( cp(X1)
& rf(X0,X1) ) ) )
& ( ! [X2] :
( ? [X3] :
( rinvF1(X2,X3)
& ! [X4] :
( ~ cowlThing(X4)
| ~ rs(X3,X4) ) )
| cp(X2)
| ~ rf1(X0,X2) )
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f79,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X2] :
( ! [X3] :
( ~ rinvF1(X2,X3)
| ? [X4] :
( cowlThing(X4)
& rs(X3,X4) ) )
& ~ cp(X2)
& rf1(X0,X2) )
& ? [X1] :
( cp(X1)
& rf(X0,X1) ) ) )
& ( ! [X2] :
( ? [X3] :
( rinvF1(X2,X3)
& ! [X4] :
( ~ cowlThing(X4)
| ~ rs(X3,X4) ) )
| cp(X2)
| ~ rf1(X0,X2) )
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X6] :
( ! [X7] :
( ~ rinvF1(X6,X7)
| ? [X8] :
( cowlThing(X8)
& rs(X7,X8) ) )
& ~ cp(X6)
& rf1(X0,X6) )
& ? [X5] :
( cp(X5)
& rf(X0,X5) ) ) )
& ( ! [X2] :
( ? [X3] :
( rinvF1(X2,X3)
& ! [X4] :
( ~ cowlThing(X4)
| ~ rs(X3,X4) ) )
| cp(X2)
| ~ rf1(X0,X2) )
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f79]) ).
fof(f81,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ! [X7] :
( ~ rinvF1(sK2(X0),X7)
| ( cowlThing(sK3(X7))
& rs(X7,sK3(X7)) ) )
& ~ cp(sK2(X0))
& rf1(X0,sK2(X0))
& cp(sK1(X0))
& rf(X0,sK1(X0)) ) )
& ( ! [X2] :
( ( rinvF1(X2,sK0(X2))
& ! [X4] :
( ~ cowlThing(X4)
| ~ rs(sK0(X2),X4) ) )
| cp(X2)
| ~ rf1(X0,X2) )
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X3,sK0(X2)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0)),skolemize(X8,sK3(X7))],[f80]) ).
fof(f83,plain,
! [X0,X1] :
( ( ~ rinvF1(X0,X1)
| rf1(X1,X0) )
& ( ~ rf1(X1,X0)
| rinvF1(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f108,plain,
! [X0,X7] :
( ~ cUnsatisfiable(X0)
| ~ rinvF1(sK2(X0),X7)
| rs(X7,sK3(X7)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f109,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK2(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf1(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f111,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp(sK1(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f112,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f116,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f120,plain,
! [X0,X1] :
( ~ rf1(X1,X0)
| rinvF1(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f124,plain,
cUnsatisfiable(i2003_11_14_17_19_06193),
inference(cnf_transformation,[],[f28]) ).
fof(f125,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f126,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_55,plain,
! [X0: $i] :
( rf(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_56,plain,
! [X0: $i] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_57,plain,
! [X0: $i] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_58,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK2(X0)) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( rs(X1,sK3(X1))
| ~ cUnsatisfiable(X0)
| ~ rinvF1(sK2(X0),X1) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( rinvF1(X1,X0)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_70,plain,
cUnsatisfiable(i2003_11_14_17_19_06193),
inference(cnf_transformation,[],[f124]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_86,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_06193)
| ~ cp(sK2(i2003_11_14_17_19_06193)) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1619,plain,
! [X0: $i] :
( rinvF1(sK2(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_57,c_65]) ).
tcf(c_1647,plain,
! [X0: $i,X1: $i] :
( ( sK1(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf(X0,X1) ),
inference(superposition,[status(thm)],[c_55,c_61]) ).
tcf(c_1673,plain,
! [X0: $i] :
( rs(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1619,c_59]) ).
tcf(c_1683,plain,
! [X0: $i] :
( rf(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1673,c_72]) ).
tcf(c_1684,plain,
! [X0: $i] :
( rf1(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1673,c_71]) ).
tcf(c_1729,plain,
! [X0: $i] :
( ( sK1(X0) = sK3(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1683,c_1647]) ).
tcf(c_1737,plain,
sK1(i2003_11_14_17_19_06193) = sK3(i2003_11_14_17_19_06193),
inference(superposition,[status(thm)],[c_70,c_1729]) ).
tcf(c_1739,plain,
( rf1(i2003_11_14_17_19_06193,sK1(i2003_11_14_17_19_06193))
| ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
inference(superposition,[status(thm)],[c_1737,c_1684]) ).
tcf(c_1744,plain,
rf1(i2003_11_14_17_19_06193,sK1(i2003_11_14_17_19_06193)),
inference(forward_subsumption_resolution,[status(thm)],[c_1739,c_70]) ).
tcf(c_1757,plain,
! [X0: $i] :
( ( sK1(i2003_11_14_17_19_06193) = X0 )
| ~ rf1(i2003_11_14_17_19_06193,X0) ),
inference(superposition,[status(thm)],[c_1744,c_62]) ).
tcf(c_1814,plain,
( ( sK1(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193) )
| ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
inference(superposition,[status(thm)],[c_57,c_1757]) ).
tcf(c_1817,plain,
sK1(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193),
inference(forward_subsumption_resolution,[status(thm)],[c_1814,c_70]) ).
tcf(c_1848,plain,
( cp(sK2(i2003_11_14_17_19_06193))
| ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
inference(superposition,[status(thm)],[c_1817,c_56]) ).
tcf(c_1849,plain,
cp(sK2(i2003_11_14_17_19_06193)),
inference(forward_subsumption_resolution,[status(thm)],[c_1848,c_70]) ).
tcf(c_1850,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1849,c_86,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS076+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.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 19:22:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.97/1.29 % SZS status Started for theBenchmark.p
% 1.97/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.29
% 1.97/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.97/1.29
% 1.97/1.29 % ------ iProver source info
% 1.97/1.29
% 1.97/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.97/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.97/1.29 % git: non_committed_changes: false
% 1.97/1.29
% 1.97/1.29 % ------ Parsing...
% 1.97/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.97/1.29
% 1.97/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.97/1.29
% 1.97/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.97/1.29
% 1.97/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.97/1.29 % ------ Proving...
% 1.97/1.29 % ------ Problem Properties
% 1.97/1.29
% 1.97/1.29 %
% 1.97/1.29 % clauses 15
% 1.97/1.29 % conjectures 0
% 1.97/1.29 % EPR 8
% 1.97/1.29 % Horn 13
% 1.97/1.29 % unary 1
% 1.97/1.29 % binary 8
% 1.97/1.29 % lits 41
% 1.97/1.29 % lits eq 3
% 1.97/1.29 % fd_pure 0
% 1.97/1.29 % fd_pseudo 0
% 1.97/1.29 % fd_cond 0
% 1.97/1.29 % fd_pseudo_cond 3
% 1.97/1.29 % AC symbols 0
% 1.97/1.29
% 1.97/1.29 % ------ Schedule dynamic 5 is on
% 1.97/1.29
% 1.97/1.29 % ------ no conjectures: strip conj schedule
% 1.97/1.29
% 1.97/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.97/1.29
% 1.97/1.29
% 1.97/1.29 % ------
% 1.97/1.29 % Current options:
% 1.97/1.29 % ------
% 1.97/1.29
% 1.97/1.29
% 1.97/1.29 %
% 1.97/1.29
% 1.97/1.29 % ------ Proving...
% 1.97/1.29 %
% 1.97/1.29
% 1.97/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.29
% 1.97/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.29
% 1.97/1.29
%------------------------------------------------------------------------------