%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS235+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 : n015.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:26 PM UTC 2026
% Result : Theorem 3.50s 1.19s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 153 ( 58 ~; 58 |; 28 &)
% ( 4 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 86 !; 12 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
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(f19,axiom,
! [X0,X1] :
( ( ? [X3] :
( model(X3,not(X1))
& model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) )
<=> status(X0,X1,noc) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',noc) ).
fof(f23,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(f25,axiom,
! [X0,X1] :
( model(X0,X1)
<~> model(X0,not(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(f33,conjecture,
nevera(noc,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nevera_noc_thm) ).
fof(f34,negated_conjecture,
~ nevera(noc,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nevera(noc,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
=> nevera(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f37,plain,
! [X0,X1] :
( ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f38,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X0)
& status(X2,X3,X1) )
| nevera(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f40,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,[],[f37]) ).
fof(f41,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,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ( ( model(sK0(X0,X1),X0)
& ~ model(sK0(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,[sK0]),skolemize(X3,sK0(X0,X1))],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( status(sK1(X0,X1),sK2(X0,X1),X0)
& status(sK1(X0,X1),sK2(X0,X1),X1) )
| nevera(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1))],[f38]) ).
fof(f44,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) )
| ! [X2] :
( ~ model(X2,X1)
| ~ model(X2,X0) )
| status(X0,X1,noc) )
& ( ~ status(X0,X1,noc)
| ( ? [X3] :
( model(X3,not(X1))
& model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f45,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) )
| ! [X2] :
( ~ model(X2,X1)
| ~ model(X2,X0) )
| status(X0,X1,noc) )
& ( ~ status(X0,X1,noc)
| ( ? [X3] :
( model(X3,not(X1))
& model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ model(X5,not(X1))
| ~ model(X5,X0) )
| ! [X4] :
( ~ model(X4,X1)
| ~ model(X4,X0) )
| status(X0,X1,noc) )
& ( ~ status(X0,X1,noc)
| ( ? [X3] :
( model(X3,not(X1))
& model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ) ),
inference(rectify,[],[f45]) ).
fof(f47,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ model(X5,not(X1))
| ~ model(X5,X0) )
| ! [X4] :
( ~ model(X4,X1)
| ~ model(X4,X0) )
| status(X0,X1,noc) )
& ( ~ status(X0,X1,noc)
| ( model(sK4(X0,X1),not(X1))
& model(sK4(X0,X1),X0)
& model(sK3(X0,X1),X1)
& model(sK3(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X2,sK3(X0,X1)),skolemize(X3,sK4(X0,X1))],[f46]) ).
fof(f55,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,X1)
| ~ model(X0,not(X1)) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f56,plain,
~ nevera(noc,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f59,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f60,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X0)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f61,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X1)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f63,plain,
! [X0,X1] :
( ~ status(X0,X1,noc)
| model(sK4(X0,X1),not(X1)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f64,plain,
! [X0,X1] :
( ~ status(X0,X1,noc)
| model(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f85,plain,
! [X0,X1] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_49,negated_conjecture,
~ nevera(noc,thm),
inference(cnf_transformation,[],[f56]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( model(sK4(X0,X1),X0)
| ~ status(X0,X1,noc) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( model(sK4(X0,X1),not(X1))
| ~ status(X0,X1,noc) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( model(sK4(X0,X1),X0)
| ~ status(X0,X1,noc) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] :
( model(sK4(X0,X1),not(X1))
| ~ status(X0,X1,noc) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] :
( status(sK1(X0,X1),sK2(X0,X1),X1)
| nevera(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X1) ),
inference(renaming,[status(thm)],[c_128]) ).
tcf(c_269,plain,
status(sK1(noc,thm),sK2(noc,thm),noc),
inference(resolution,[status(thm)],[c_49,c_126]) ).
tcf(c_273,plain,
status(sK1(noc,thm),sK2(noc,thm),thm),
inference(resolution,[status(thm)],[c_49,c_129]) ).
tcf(c_371,plain,
model(sK4(sK1(noc,thm),sK2(noc,thm)),not(sK2(noc,thm))),
inference(resolution,[status(thm)],[c_106,c_269]) ).
tcf(c_375,plain,
model(sK4(sK1(noc,thm),sK2(noc,thm)),sK1(noc,thm)),
inference(resolution,[status(thm)],[c_104,c_269]) ).
tcf(c_792,plain,
! [X0: $i] :
( model(sK4(sK1(noc,thm),sK2(noc,thm)),X0)
| ~ status(sK1(noc,thm),X0,thm)
| ~ model(sK4(sK1(noc,thm),sK2(noc,thm)),sK1(noc,thm)) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_944,plain,
( model(sK4(sK1(noc,thm),sK2(noc,thm)),sK2(noc,thm))
| ~ status(sK1(noc,thm),sK2(noc,thm),thm)
| ~ model(sK4(sK1(noc,thm),sK2(noc,thm)),sK1(noc,thm)) ),
inference(instantiation,[status(thm)],[c_792]) ).
tcf(c_1317,plain,
( ~ model(sK4(sK1(noc,thm),sK2(noc,thm)),sK2(noc,thm))
| ~ model(sK4(sK1(noc,thm),sK2(noc,thm)),not(sK2(noc,thm))) ),
inference(instantiation,[status(thm)],[c_77]) ).
tcf(c_1318,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1317,c_944,c_375,c_371,c_273]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS235+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 19:49:40 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.42 % Proving...
% 3.50/1.19 % SZS status Started for theBenchmark.p
% 3.50/1.19 % SZS status Theorem for theBenchmark.p
% 3.50/1.19
% 3.50/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.50/1.19
% 3.50/1.19 % ------ iProver source info
% 3.50/1.19
% 3.50/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.50/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.50/1.19 % git: non_committed_changes: false
% 3.50/1.19
% 3.50/1.19 % ------ Parsing...
% 3.50/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.50/1.19
% 3.50/1.19 % ------ 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 %
% 3.50/1.19
% 3.50/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.19 % ------ Proving...
% 3.50/1.19 % ------ Problem Properties
% 3.50/1.19
% 3.50/1.19 %
% 3.50/1.19 % clauses 27
% 3.50/1.19 % conjectures 0
% 3.50/1.19 % EPR 17
% 3.50/1.19 % Horn 24
% 3.50/1.19 % unary 15
% 3.50/1.19 % binary 10
% 3.50/1.19 % lits 43
% 3.50/1.19 % lits eq 0
% 3.50/1.19 % fd_pure 0
% 3.50/1.19 % fd_pseudo 0
% 3.50/1.19 % fd_cond 0
% 3.50/1.19 % fd_pseudo_cond 0
% 3.50/1.19 % AC symbols 0
% 3.50/1.19
% 3.50/1.19 % ------ Schedule dynamic 5 is on
% 3.50/1.19
% 3.50/1.19 % ------ no conjectures: strip conj schedule
% 3.50/1.19
% 3.50/1.19 % ------ no equalities: superposition off
% 3.50/1.19
% 3.50/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.50/1.19
% 3.50/1.19
% 3.50/1.19 % ------
% 3.50/1.19 % Current options:
% 3.50/1.19 % ------
% 3.50/1.19
% 3.50/1.19
% 3.50/1.19 %
% 3.50/1.19
% 3.50/1.19 % ------ Proving...
% 3.50/1.19 %
% 3.50/1.19
% 3.50/1.19 % SZS status Theorem for theBenchmark.p
% 3.50/1.19
% 3.50/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.19
%------------------------------------------------------------------------------