%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS128+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 : n003.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:13 PM UTC 2026
% Result : Unsatisfiable 1.37s 6.33s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 5 unt; 0 def)
% Number of atoms : 129 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 142 ( 56 ~; 49 |; 23 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 8 ( 7 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 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ca_Cx4(X1) )
& ! [X1] :
( rr(X0,X1)
=> cd(X1) )
& ? [X1] :
( cexcomp(X1)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f9,axiom,
! [X0] :
( ca_Cx4(X0)
<=> ? [X1] : ra_Px4(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f10,axiom,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ~ ? [X1] : ra_Px4(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f11,axiom,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ( cexcomp(X0)
& cd(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f12,axiom,
cUnsatisfiable(i2003_11_14_17_22_31584),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f13,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X3] :
( rr(X0,X3)
=> ca_Cx4(X3) )
& ! [X2] :
( rr(X0,X2)
=> cd(X2) )
& ? [X1] :
( cexcomp(X1)
& rr(X0,X1) ) ) ),
inference(rectify,[],[f3]) ).
fof(f15,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X3] :
( rr(X0,X3)
=> ca_Cx4(X3) )
& ! [X2] :
( rr(X0,X2)
=> cd(X2) )
& ? [X1] :
( cexcomp(X1)
& rr(X0,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f16,plain,
! [X0] :
( ca_Cx4(X0)
=> ? [X1] : ra_Px4(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f21,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ( ! [X3] :
( ~ rr(X0,X3)
| ca_Cx4(X3) )
& ! [X2] :
( ~ rr(X0,X2)
| cd(X2) )
& ? [X1] :
( cexcomp(X1)
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0] :
( ~ ca_Cx4(X0)
| ? [X1] : ra_Px4(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f23,plain,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ! [X1] : ~ ra_Px4(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ( ! [X3] :
( ~ rr(X0,X3)
| ca_Cx4(X3) )
& ! [X2] :
( ~ rr(X0,X2)
| cd(X2) )
& cexcomp(sK0(X0))
& rr(X0,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f21]) ).
fof(f31,plain,
! [X0] :
( ~ ca_Cx4(X0)
| ra_Px4(X0,sK3(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3(X0))],[f22]) ).
fof(f32,plain,
! [X0] :
( ( ~ ca_Cx4xcomp(X0)
| ! [X1] : ~ ra_Px4(X0,X1) )
& ( ? [X1] : ra_Px4(X0,X1)
| ca_Cx4xcomp(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f33,plain,
! [X0] :
( ( ~ ca_Cx4xcomp(X0)
| ! [X2] : ~ ra_Px4(X0,X2) )
& ( ? [X1] : ra_Px4(X0,X1)
| ca_Cx4xcomp(X0) ) ),
inference(rectify,[],[f32]) ).
fof(f34,plain,
! [X0] :
( ( ~ ca_Cx4xcomp(X0)
| ! [X2] : ~ ra_Px4(X0,X2) )
& ( ra_Px4(X0,sK4(X0))
| ca_Cx4xcomp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f33]) ).
fof(f35,plain,
! [X0] :
( ( ~ ca_Cx4xcomp(X0)
| ( cexcomp(X0)
& cd(X0) ) )
& ( ~ cexcomp(X0)
| ~ cd(X0)
| ca_Cx4xcomp(X0) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f36,plain,
! [X0] :
( ( ~ ca_Cx4xcomp(X0)
| ( cexcomp(X0)
& cd(X0) ) )
& ( ~ cexcomp(X0)
| ~ cd(X0)
| ca_Cx4xcomp(X0) ) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X3,X0] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X3)
| ca_Cx4(X3) ),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
! [X2,X0] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X2)
| cd(X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cexcomp(sK0(X0)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f40,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X0] :
( ~ ca_Cx4(X0)
| ra_Px4(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f46,plain,
! [X2,X0] :
( ~ ca_Cx4xcomp(X0)
| ~ ra_Px4(X0,X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
! [X0] :
( ~ cexcomp(X0)
| ~ cd(X0)
| ca_Cx4xcomp(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f51,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(cnf_transformation,[],[f12]) ).
tcf(c_49,plain,
! [X0: $i] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_50,plain,
! [X0: $i] :
( cexcomp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( cd(X1)
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( ca_Cx4(X1)
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_57,plain,
! [X0: $i] :
( ra_Px4(X0,sK3(X0))
| ~ ca_Cx4(X0) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ ca_Cx4xcomp(X0)
| ~ ra_Px4(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_60,plain,
! [X0: $i] :
( ca_Cx4xcomp(X0)
| ~ cd(X0)
| ~ cexcomp(X0) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_63,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(cnf_transformation,[],[f51]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i] :
( ra_Px4(X1,sK3(X1))
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(resolution,[status(thm)],[c_52,c_57]) ).
tcf(c_159,plain,
! [X0: $i,X1: $i] :
( ~ ca_Cx4xcomp(X1)
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(resolution,[status(thm)],[c_59,c_144]) ).
tcf(c_173,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ ca_Cx4xcomp(sK0(X0)) ),
inference(resolution,[status(thm)],[c_49,c_159]) ).
tcf(c_174,plain,
( ~ cUnsatisfiable(i2003_11_14_17_22_31584)
| ~ ca_Cx4xcomp(sK0(i2003_11_14_17_22_31584)) ),
inference(instantiation,[status(thm)],[c_173]) ).
tcf(c_181,plain,
! [X0: $i] :
( cd(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[status(thm)],[c_49,c_51]) ).
tcf(c_182,plain,
( cd(sK0(i2003_11_14_17_22_31584))
| ~ cUnsatisfiable(i2003_11_14_17_22_31584) ),
inference(instantiation,[status(thm)],[c_181]) ).
tcf(c_201,plain,
cexcomp(sK0(i2003_11_14_17_22_31584)),
inference(resolution,[status(thm)],[c_50,c_63]) ).
tcf(c_209,plain,
( ca_Cx4xcomp(sK0(i2003_11_14_17_22_31584))
| ~ cd(sK0(i2003_11_14_17_22_31584)) ),
inference(resolution,[status(thm)],[c_60,c_201]) ).
tcf(c_210,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_209,c_182,c_174,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS128+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/5.40 % Computer : n003.cluster.edu
% 0.11/5.40 % Model : x86_64 x86_64
% 0.11/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40 % Memory : 8046.5625MB
% 0.11/5.40 % OS : Linux 6.8.0-71-generic
% 0.11/5.40 % CPULimit : 300
% 0.11/5.40 % WCLimit : 300
% 0.11/5.40 % DateTime : Wed Sep 23 19:29:11 UTC 2026
% 0.11/5.40 % CPUTime :
% 0.11/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.44 Running first-order theorem proving
% 0.11/5.44 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/5.46
% 0.11/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.11/5.46
% 0.11/5.46 % Detected problem language: tptp
% 0.11/5.47 % Proving...
% 1.37/6.33 % SZS status Started for theBenchmark.p
% 1.37/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/6.33
% 1.37/6.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.37/6.33
% 1.37/6.33 % ------ iProver source info
% 1.37/6.33
% 1.37/6.33 % git: date: 2026-07-19 20:42:38 +0200
% 1.37/6.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.37/6.33 % git: non_committed_changes: false
% 1.37/6.33
% 1.37/6.33 % ------ Parsing...
% 1.37/6.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.37/6.33
% 1.37/6.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 1.37/6.33
% 1.37/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/6.33
% 1.37/6.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/6.33
% 1.37/6.33
%------------------------------------------------------------------------------