%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS200+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:23 PM UTC 2026
% Result : Theorem 2.37s 1.37s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 9 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 149 ( 63 ~; 53 |; 22 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 129 ( 0 sgn 108 !; 21 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( ~ ? [X2] : model(X2,X0)
=> ~ ? [X3] : model(X3,X1) )
<=> status(X0,X1,unp) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',unp) ).
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(f13,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',cax) ).
fof(f22,axiom,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(f26,axiom,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',not) ).
fof(f28,axiom,
? [X0] :
( ? [X2] : ~ model(X2,X0)
& ? [X1] : model(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',satisfiable) ).
fof(f33,conjecture,
nota(unp,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota_unp_thm) ).
fof(f34,negated_conjecture,
~ nota(unp,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nota(unp,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
=> nota(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f37,plain,
! [X0,X1] :
( ( ? [X2] : model(X2,X0)
| ! [X3] : ~ model(X3,X1) )
<=> status(X0,X1,unp) ),
inference(ennf_transformation,[],[f1]) ).
fof(f39,plain,
! [X0,X1] :
( ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f42,plain,
! [X0,X1] :
( ! [X2] : ~ model(X2,X0)
<=> status(X0,X1,cax) ),
inference(ennf_transformation,[],[f13]) ).
fof(f46,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| nota(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f48,plain,
! [X0,X1] :
( ( ( ! [X2] : ~ model(X2,X0)
& ? [X3] : model(X3,X1) )
| status(X0,X1,unp) )
& ( ~ status(X0,X1,unp)
| ? [X2] : model(X2,X0)
| ! [X3] : ~ model(X3,X1) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f49,plain,
! [X0,X1] :
( ( ( ! [X2] : ~ model(X2,X0)
& ? [X3] : model(X3,X1) )
| status(X0,X1,unp) )
& ( ~ status(X0,X1,unp)
| ? [X2] : model(X2,X0)
| ! [X3] : ~ model(X3,X1) ) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1] :
( ( ( ! [X5] : ~ model(X5,X0)
& ? [X4] : model(X4,X1) )
| status(X0,X1,unp) )
& ( ~ status(X0,X1,unp)
| ? [X3] : model(X3,X0)
| ! [X2] : ~ model(X2,X1) ) ),
inference(rectify,[],[f49]) ).
fof(f51,plain,
! [X0,X1] :
( ( ( ! [X5] : ~ model(X5,X0)
& model(sK1(X1),X1) )
| status(X0,X1,unp) )
& ( ~ status(X0,X1,unp)
| model(sK0(X0),X0)
| ! [X2] : ~ model(X2,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X1))],[f50]) ).
fof(f62,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,X0)
& ~ model(X2,X1) )
| status(X0,X1,thm) )
& ( ~ status(X0,X1,thm)
| ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) ) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f63,plain,
! [X0,X1] :
( ( ? [X3] :
( model(X3,X0)
& ~ model(X3,X1) )
| status(X0,X1,thm) )
& ( ~ status(X0,X1,thm)
| ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) ) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( ( model(sK9(X0,X1),X0)
& ~ model(sK9(X0,X1),X1) )
| status(X0,X1,thm) )
& ( ~ status(X0,X1,thm)
| ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f63]) ).
fof(f92,plain,
! [X0,X1] :
( ( ? [X2] : model(X2,X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0,X1] :
( ( ? [X3] : model(X3,X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( model(sK28(X0),X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28]),skolemize(X3,sK28(X0))],[f93]) ).
fof(f119,plain,
! [X0,X1] :
( ( ~ model(X0,X1)
| ~ model(X0,not(X1)) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f121,plain,
( ~ model(sK44,sK42)
& model(sK43,sK42) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK42,sK43,sK44]),skolemize(X0,sK42),skolemize(X1,sK43),skolemize(X2,sK44)],[f28]) ).
fof(f126,plain,
! [X0,X1,X5] :
( ~ model(X5,X0)
| status(X0,X1,unp) ),
inference(cnf_transformation,[],[f51]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f176,plain,
! [X0,X1] :
( model(sK28(X0),X0)
| status(X0,X1,cax) ),
inference(cnf_transformation,[],[f94]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,cax)
| ~ model(X2,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0)
| nota(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f203,plain,
! [X0,X1] :
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f205,plain,
~ model(sK44,sK42),
inference(cnf_transformation,[],[f121]) ).
fof(f219,plain,
~ nota(unp,thm),
inference(cnf_transformation,[],[f35]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X1,X2,unp)
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ model(X2,X0)
| ~ status(X0,X1,cax) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,cax)
| model(sK28(X0),X0) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( nota(X2,X3)
| status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] :
( model(X0,X1)
| model(X0,not(X1)) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_129,plain,
~ model(sK44,sK42),
inference(cnf_transformation,[],[f205]) ).
tcf(c_142,negated_conjecture,
~ nota(unp,thm),
inference(cnf_transformation,[],[f219]) ).
tcf(c_973,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ status(X0,X1,unp) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
tcf(c_1851,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,unp)
| ~ model(sK28(X0),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_2656,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X1)
| ~ model(X2,X0) ),
inference(global_subsumption_just,[status(thm)],[c_62,c_100,c_99,c_62,c_973,c_1851]) ).
tcf(c_2657,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X0,X2)
| ~ model(X0,X1) ),
inference(renaming,[status(thm)],[c_2656]) ).
tcf(c_2662,plain,
! [X0: $i,X1: $i] : model(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_125,c_2657]) ).
tcf(c_2663,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_129,c_2662]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS200+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.41 % Computer : n002.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Wed Sep 23 19:42:37 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.47 Running first-order theorem proving
% 0.16/0.47 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.23/0.48
% 0.23/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.48
% 0.23/0.49 % Detected problem language: tptp
% 0.23/0.50 % Proving...
% 2.37/1.37 % SZS status Started for theBenchmark.p
% 2.37/1.37 % SZS status Theorem for theBenchmark.p
% 2.37/1.37
% 2.37/1.37 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.37/1.37
% 2.37/1.37 % ------ iProver source info
% 2.37/1.37
% 2.37/1.37 % git: date: 2026-07-19 20:42:38 +0200
% 2.37/1.37 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.37/1.37 % git: non_committed_changes: false
% 2.37/1.37
% 2.37/1.37 % ------ Parsing...
% 2.37/1.37 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.37/1.37
% 2.37/1.37 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.37/1.37
% 2.37/1.37 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.37/1.37 % ------ Proving...
% 2.37/1.37 % ------ Problem Properties
% 2.37/1.37
% 2.37/1.37 %
% 2.37/1.37 % clauses 91
% 2.37/1.37 % conjectures 0
% 2.37/1.37 % EPR 39
% 2.37/1.37 % Horn 72
% 2.37/1.37 % unary 13
% 2.37/1.37 % binary 47
% 2.37/1.37 % lits 220
% 2.37/1.37 % lits eq 0
% 2.37/1.37 % fd_pure 0
% 2.37/1.37 % fd_pseudo 0
% 2.37/1.37 % fd_cond 0
% 2.37/1.37 % fd_pseudo_cond 0
% 2.37/1.37 % AC symbols 0
% 2.37/1.37
% 2.37/1.37 % ------ Schedule dynamic 5 is on
% 2.37/1.37
% 2.37/1.37 % ------ no conjectures: strip conj schedule
% 2.37/1.37
% 2.37/1.37 % ------ no equalities: superposition off
% 2.37/1.37
% 2.37/1.37 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.37/1.37
% 2.37/1.37
% 2.37/1.37 % ------
% 2.37/1.37 % Current options:
% 2.37/1.37 % ------
% 2.37/1.37
% 2.37/1.37
% 2.37/1.37 %
% 2.37/1.37
% 2.37/1.37 % ------ Proving...
% 2.37/1.37 %
% 2.37/1.37
% 2.37/1.37 % SZS status Theorem for theBenchmark.p
% 2.37/1.37
% 2.37/1.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.37/1.38
% 2.37/1.38
%------------------------------------------------------------------------------