%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS075+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 : n006.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:05 PM UTC 2026
% Result : Unsatisfiable 1.90s 1.28s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 8 unt; 0 def)
% Number of atoms : 162 ( 16 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 187 ( 75 ~; 70 |; 36 &)
% ( 2 <=>; 4 =>; 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 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 97 ( 0 sgn 82 !; 15 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X1] :
( cowlThing(X1)
& rs(X0,X1) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f31,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X3] :
( cp(X3)
& rf(X0,X3) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f22]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f23]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f70]) ).
fof(f74,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f77,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cp(X3)
& rf(X0,X3) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) )
& ( ! [X3] :
( ~ cp(X3)
| ~ rf(X0,X3) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f78,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X3] :
( cp(X3)
& rf(X0,X3) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) )
& ( ! [X3] :
( ~ cp(X3)
| ~ rf(X0,X3) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( ? [X6] :
( cp(X6)
& rf(X0,X6) )
& ? [X5] :
( cowlThing(X5)
& rs(X0,X5) )
& ? [X4] :
( ~ cp(X4)
& rf1(X0,X4) ) ) )
& ( ! [X3] :
( ~ cp(X3)
| ~ rf(X0,X3) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp(sK2(X0))
& rf(X0,sK2(X0))
& cowlThing(sK1(X0))
& rs(X0,sK1(X0))
& ~ cp(sK0(X0))
& rf1(X0,sK0(X0)) ) )
& ( ! [X3] :
( ~ cp(X3)
| ~ rf(X0,X3) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X4,sK0(X0)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0))],[f79]) ).
fof(f106,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp(sK2(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f107,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f109,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f110,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK0(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f111,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf1(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f113,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f122,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(cnf_transformation,[],[f28]) ).
fof(f123,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f124,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_54,plain,
! [X0: $i] :
( rf1(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_55,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK0(X0)) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_56,plain,
! [X0: $i] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_58,plain,
! [X0: $i] :
( rf(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_59,plain,
! [X0: $i] :
( cp(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
tcf(c_69,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(cnf_transformation,[],[f122]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_88,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_02584)
| ~ cp(sK0(i2003_11_14_17_19_02584)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1065,plain,
! [X0: $i] :
( rf1(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_56,c_70]) ).
tcf(c_1073,plain,
! [X0: $i] :
( rf(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_56,c_71]) ).
tcf(c_1087,plain,
! [X0: $i,X1: $i] :
( ( sK2(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf(X0,X1) ),
inference(superposition,[status(thm)],[c_58,c_60]) ).
tcf(c_1098,plain,
! [X0: $i,X1: $i] :
( ( sK0(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf1(X0,X1) ),
inference(superposition,[status(thm)],[c_54,c_61]) ).
tcf(c_1149,plain,
! [X0: $i] :
( ( sK1(X0) = sK2(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1073,c_1087]) ).
tcf(c_1157,plain,
sK1(i2003_11_14_17_19_02584) = sK2(i2003_11_14_17_19_02584),
inference(superposition,[status(thm)],[c_69,c_1149]) ).
tcf(c_1159,plain,
( cp(sK1(i2003_11_14_17_19_02584))
| ~ cUnsatisfiable(i2003_11_14_17_19_02584) ),
inference(superposition,[status(thm)],[c_1157,c_59]) ).
tcf(c_1160,plain,
cp(sK1(i2003_11_14_17_19_02584)),
inference(forward_subsumption_resolution,[status(thm)],[c_1159,c_69]) ).
tcf(c_1181,plain,
! [X0: $i] :
( ( sK0(X0) = sK1(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1065,c_1098]) ).
tcf(c_1189,plain,
sK0(i2003_11_14_17_19_02584) = sK1(i2003_11_14_17_19_02584),
inference(superposition,[status(thm)],[c_69,c_1181]) ).
tcf(c_1192,plain,
cp(sK0(i2003_11_14_17_19_02584)),
inference(demodulation,[status(thm)],[c_1160,c_1189]) ).
tcf(c_1196,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1192,c_88,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS075+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.09/0.37 % Computer : n006.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 19:19:56 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.90/1.28 % SZS status Started for theBenchmark.p
% 1.90/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.90/1.28
% 1.90/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.90/1.28
% 1.90/1.28 % ------ iProver source info
% 1.90/1.28
% 1.90/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.90/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.90/1.28 % git: non_committed_changes: false
% 1.90/1.28
% 1.90/1.28 % ------ Parsing...
% 1.90/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.90/1.28
% 1.90/1.28 % ------ 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.90/1.28
% 1.90/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.90/1.28
% 1.90/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.90/1.28 % ------ Proving...
% 1.90/1.28 % ------ Problem Properties
% 1.90/1.28
% 1.90/1.28 %
% 1.90/1.28 % clauses 12
% 1.90/1.28 % conjectures 0
% 1.90/1.28 % EPR 7
% 1.90/1.28 % Horn 11
% 1.90/1.28 % unary 1
% 1.90/1.28 % binary 7
% 1.90/1.28 % lits 30
% 1.90/1.28 % lits eq 3
% 1.90/1.28 % fd_pure 0
% 1.90/1.28 % fd_pseudo 0
% 1.90/1.28 % fd_cond 0
% 1.90/1.28 % fd_pseudo_cond 3
% 1.90/1.28 % AC symbols 0
% 1.90/1.28
% 1.90/1.28 % ------ Schedule dynamic 5 is on
% 1.90/1.28
% 1.90/1.28 % ------ no conjectures: strip conj schedule
% 1.90/1.28
% 1.90/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.90/1.28
% 1.90/1.28
% 1.90/1.28 % ------
% 1.90/1.28 % Current options:
% 1.90/1.28 % ------
% 1.90/1.28
% 1.90/1.28
% 1.90/1.28 %
% 1.90/1.28
% 1.90/1.28 % ------ Proving...
% 1.90/1.28 %
% 1.90/1.28
% 1.90/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.90/1.28
% 1.90/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/1.28
% 1.90/1.28
%------------------------------------------------------------------------------