%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS082+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 : n011.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 0.91s 1.30s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 6 unt; 0 def)
% Number of atoms : 191 ( 0 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 222 ( 82 ~; 69 |; 38 &)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 141 ( 0 sgn 121 !; 20 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X2] :
( cowlThing(X2)
& rr(X1,X2) )
& ! [X2] :
( rp(X1,X2)
=> ! [X3] :
( rr(X2,X3)
=> cc(X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rp(X2,X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rr(X2,X3) ) )
& ! [X2] :
( rr(X1,X2)
=> cc(X2) )
& ? [X2] :
( cowlThing(X2)
& rp(X1,X2) )
& rs(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ca(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X0] :
( cc(X0)
<=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f6,axiom,
! [X0,X1] :
( rinvP(X0,X1)
<=> rp(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f7,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f10,axiom,
cUnsatisfiable(i2003_11_14_17_19_28752),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f11,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X10] :
( cowlThing(X10)
& rr(X1,X10) )
& ! [X8] :
( rp(X1,X8)
=> ! [X9] :
( rr(X8,X9)
=> cc(X9) ) )
& ! [X6] :
( rp(X1,X6)
=> ? [X7] :
( cowlThing(X7)
& rp(X6,X7) ) )
& ! [X4] :
( rp(X1,X4)
=> ? [X5] :
( cowlThing(X5)
& rr(X4,X5) ) )
& ! [X3] :
( rr(X1,X3)
=> cc(X3) )
& ? [X2] :
( cowlThing(X2)
& rp(X1,X2) )
& rs(X0,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f12,plain,
! [X0] :
( cc(X0)
=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( rs(X1,X0)
=> rinvS(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( rp(X1,X0)
=> rinvP(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f15,plain,
! [X0,X1] :
( rr(X1,X0)
=> rinvR(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f18,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X10] : rr(X1,X10)
& ! [X8] :
( rp(X1,X8)
=> ! [X9] :
( rr(X8,X9)
=> cc(X9) ) )
& ! [X6] :
( rp(X1,X6)
=> ? [X7] : rp(X6,X7) )
& ! [X4] :
( rp(X1,X4)
=> ? [X5] : rr(X4,X5) )
& ! [X3] :
( rr(X1,X3)
=> cc(X3) )
& ? [X2] : rp(X1,X2)
& rs(X0,X1) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f19,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ? [X1] :
( ? [X10] : rr(X1,X10)
& ! [X8] :
( ~ rp(X1,X8)
| ! [X9] :
( ~ rr(X8,X9)
| cc(X9) ) )
& ! [X6] :
( ~ rp(X1,X6)
| ? [X7] : rp(X6,X7) )
& ! [X4] :
( ~ rp(X1,X4)
| ? [X5] : rr(X4,X5) )
& ! [X3] :
( ~ rr(X1,X3)
| cc(X3) )
& ? [X2] : rp(X1,X2)
& rs(X0,X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] :
( ~ cc(X0)
| ! [X1] :
( ~ rinvR(X0,X1)
| ! [X2] :
( ~ rinvP(X1,X2)
| ! [X3] :
( ~ rinvS(X2,X3)
| ~ ca(X3) ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( ~ rp(X1,X0)
| rinvP(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( ~ rs(X1,X0)
| rinvS(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ( rr(sK0(X0),sK4(X0))
& ! [X8] :
( ~ rp(sK0(X0),X8)
| ! [X9] :
( ~ rr(X8,X9)
| cc(X9) ) )
& ! [X6] :
( ~ rp(sK0(X0),X6)
| rp(X6,sK3(X6)) )
& ! [X4] :
( ~ rp(sK0(X0),X4)
| rr(X4,sK2(X4)) )
& ! [X3] :
( ~ rr(sK0(X0),X3)
| cc(X3) )
& rp(sK0(X0),sK1(X0))
& rs(X0,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X1,sK0(X0)),skolemize(X2,sK1(X0)),skolemize(X5,sK2(X4)),skolemize(X7,sK3(X6)),skolemize(X10,sK4(X0))],[f19]) ).
fof(f29,plain,
! [X0,X8,X9] :
( ~ cUnsatisfiable(X0)
| ~ rp(sK0(X0),X8)
| ~ rr(X8,X9)
| cc(X9) ),
inference(cnf_transformation,[],[f27]) ).
fof(f31,plain,
! [X0,X4] :
( ~ cUnsatisfiable(X0)
| ~ rp(sK0(X0),X4)
| rr(X4,sK2(X4)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f33,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rp(sK0(X0),sK1(X0)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f34,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f35,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ cc(X0)
| ~ rinvR(X0,X1)
| ~ rinvP(X1,X2)
| ~ rinvS(X2,X3)
| ~ ca(X3) ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X0,X1] :
( ~ rp(X1,X0)
| rinvP(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( ~ rs(X1,X0)
| rinvS(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
inference(cnf_transformation,[],[f10]) ).
tcf(c_49,plain,
! [X0: $i] :
( rs(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_50,plain,
! [X0: $i] :
( rp(sK0(X0),sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( rr(X1,sK2(X1))
| ~ cUnsatisfiable(X0)
| ~ rp(sK0(X0),X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( cc(X2)
| ~ cUnsatisfiable(X0)
| ~ rr(X1,X2)
| ~ rp(sK0(X0),X1) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_56,plain,
! [X0: $i] :
( ca(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ca(X1)
| ~ cc(X3)
| ~ rinvR(X3,X2)
| ~ rinvP(X2,X0)
| ~ rinvS(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( rinvP(X1,X0)
| ~ rp(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( rinvR(X1,X0)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( rinvS(X1,X0)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_62,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
inference(cnf_transformation,[],[f41]) ).
tcf(c_147,plain,
! [X0: $i] :
( rinvS(sK0(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[status(thm)],[c_49,c_60]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ cc(X3)
| ~ cUnsatisfiable(X1)
| ~ rinvR(X3,X2)
| ~ rinvP(X2,X0)
| ~ rinvS(X0,X1) ),
inference(resolution,[status(thm)],[c_56,c_57]) ).
tcf(c_179,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ cc(X2)
| ~ cUnsatisfiable(X1)
| ~ rinvR(X2,X0)
| ~ rinvP(X0,sK0(X1)) ),
inference(resolution,[status(thm)],[c_157,c_147]) ).
tcf(c_197,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ cc(X2)
| ~ cUnsatisfiable(X0)
| ~ rinvR(X2,X1)
| ~ rp(sK0(X0),X1) ),
inference(resolution,[status(thm)],[c_58,c_179]) ).
tcf(c_215,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ cc(X2)
| ~ cUnsatisfiable(X0)
| ~ rr(X1,X2)
| ~ rp(sK0(X0),X1) ),
inference(resolution,[status(thm)],[c_59,c_197]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ rp(sK0(X0),X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X0) ),
inference(global_subsumption_just,[status(thm)],[c_215,c_54,c_215]) ).
tcf(c_218,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ cUnsatisfiable(X0)
| ~ rr(X1,X2)
| ~ rp(sK0(X0),X1) ),
inference(renaming,[status(thm)],[c_217]) ).
tcf(c_231,plain,
! [X0: $i,X1: $i] :
( ~ cUnsatisfiable(X0)
| ~ rp(sK0(X0),X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_218]) ).
tcf(c_236,plain,
! [X0: $i] : ~ rp(sK0(i2003_11_14_17_19_28752),X0),
inference(resolution,[status(thm)],[c_231,c_62]) ).
tcf(c_241,plain,
rp(sK0(i2003_11_14_17_19_28752),sK1(i2003_11_14_17_19_28752)),
inference(resolution,[status(thm)],[c_50,c_62]) ).
tcf(c_243,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS082+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.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 19:20:43 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...
% 0.91/1.30 % SZS status Started for theBenchmark.p
% 0.91/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 0.91/1.30
% 0.91/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.91/1.30
% 0.91/1.30 % ------ iProver source info
% 0.91/1.30
% 0.91/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.91/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.91/1.30 % git: non_committed_changes: false
% 0.91/1.30
% 0.91/1.30 % ------ Parsing...
% 0.91/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.91/1.30
% 0.91/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 0.91/1.30
% 0.91/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 0.91/1.30
% 0.91/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/1.30
% 1.83/1.30
%------------------------------------------------------------------------------