%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS233+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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 4.94s 11.56s
% Output : CNFRefutation 4.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 10 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 119 ( 47 ~; 47 |; 16 &)
% ( 4 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 79 !; 7 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(f17,axiom,
! [X0,X1] :
( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
<=> status(X0,X1,csa) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',csa) ).
fof(f23,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(f25,axiom,
! [X0,X1] :
( model(X0,X1)
<~> model(X0,not(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(f33,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(f34,negated_conjecture,
~ nevera(csa,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nevera(csa,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] :
( ( ! [X2] :
( ~ model(X2,not(X1))
| ~ model(X2,X0) )
| status(X0,X1,csa) )
& ( ~ status(X0,X1,csa)
| ? [X2] :
( model(X2,not(X1))
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f45,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) )
| status(X0,X1,csa) )
& ( ~ status(X0,X1,csa)
| ? [X2] :
( model(X2,not(X1))
& model(X2,X0) ) ) ),
inference(rectify,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) )
| status(X0,X1,csa) )
& ( ~ status(X0,X1,csa)
| ( model(sK3(X0,X1),not(X1))
& model(sK3(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f45]) ).
fof(f54,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,X1)
| ~ model(X0,not(X1)) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f55,plain,
~ nevera(csa,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f59,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X0)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f60,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X1)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f62,plain,
! [X0,X1] :
( ~ status(X0,X1,csa)
| model(sK3(X0,X1),not(X1)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f63,plain,
! [X0,X1] :
( ~ status(X0,X1,csa)
| model(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f82,plain,
! [X0,X1] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_49,negated_conjecture,
~ nevera(csa,thm),
inference(cnf_transformation,[],[f55]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( model(sK3(X0,X1),X0)
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( model(sK3(X0,X1),not(X1))
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] :
( model(sK3(X0,X1),X0)
| ~ status(X0,X1,csa) ),
inference(prop_impl_just,[status(thm)],[c_55]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( model(sK3(X0,X1),not(X1))
| ~ status(X0,X1,csa) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
tcf(c_115,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_117,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_118,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK1(X0,X1),sK2(X0,X1),X1) ),
inference(renaming,[status(thm)],[c_117]) ).
tcf(c_242,plain,
status(sK1(csa,thm),sK2(csa,thm),csa),
inference(resolution,[status(thm)],[c_49,c_115]) ).
tcf(c_246,plain,
status(sK1(csa,thm),sK2(csa,thm),thm),
inference(resolution,[status(thm)],[c_49,c_118]) ).
tcf(c_300,plain,
model(sK3(sK1(csa,thm),sK2(csa,thm)),not(sK2(csa,thm))),
inference(resolution,[status(thm)],[c_99,c_242]) ).
tcf(c_304,plain,
model(sK3(sK1(csa,thm),sK2(csa,thm)),sK1(csa,thm)),
inference(resolution,[status(thm)],[c_97,c_242]) ).
tcf(c_583,plain,
( ~ model(sK3(sK1(csa,thm),sK2(csa,thm)),sK2(csa,thm))
| ~ model(sK3(sK1(csa,thm),sK2(csa,thm)),not(sK2(csa,thm))) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_1067,plain,
! [X0: $i] :
( model(sK3(sK1(csa,thm),sK2(csa,thm)),sK2(csa,thm))
| ~ status(X0,sK2(csa,thm),thm)
| ~ model(sK3(sK1(csa,thm),sK2(csa,thm)),X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_4580,plain,
( model(sK3(sK1(csa,thm),sK2(csa,thm)),sK2(csa,thm))
| ~ status(sK1(csa,thm),sK2(csa,thm),thm)
| ~ model(sK3(sK1(csa,thm),sK2(csa,thm)),sK1(csa,thm)) ),
inference(instantiation,[status(thm)],[c_1067]) ).
tcf(c_4581,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4580,c_583,c_304,c_300,c_246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS233+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/10.46 % Computer : n004.cluster.edu
% 0.17/10.46 % Model : x86_64 x86_64
% 0.17/10.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.46 % Memory : 8046.5625MB
% 0.17/10.46 % OS : Linux 6.8.0-71-generic
% 0.17/10.46 % CPULimit : 300
% 0.17/10.46 % WCLimit : 300
% 0.17/10.46 % DateTime : Wed Sep 23 19:46:16 UTC 2026
% 0.17/10.47 % CPUTime :
% 0.17/10.47 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.24/10.53 Running first-order theorem proving
% 0.24/10.53 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.24/10.55
% 0.24/10.55 % ======== iProver multi-core TPTP/SMT =========
% 0.24/10.55
% 0.24/10.55 % Detected problem language: tptp
% 0.24/10.57 % Proving...
% 4.94/11.56 % SZS status Started for theBenchmark.p
% 4.94/11.56 % SZS status Theorem for theBenchmark.p
% 4.94/11.56
% 4.94/11.56 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.94/11.56
% 4.94/11.56 % ------ iProver source info
% 4.94/11.56
% 4.94/11.56 % git: date: 2026-07-19 20:42:38 +0200
% 4.94/11.56 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.94/11.56 % git: non_committed_changes: false
% 4.94/11.56
% 4.94/11.56 % ------ Parsing...
% 4.94/11.56 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.94/11.56
% 4.94/11.56 % ------ 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 %
% 4.94/11.56
% 4.94/11.56 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.94/11.56 % ------ Proving...
% 4.94/11.56 % ------ Problem Properties
% 4.94/11.56
% 4.94/11.56 %
% 4.94/11.56 % clauses 25
% 4.94/11.56 % conjectures 0
% 4.94/11.56 % EPR 17
% 4.94/11.56 % Horn 22
% 4.94/11.56 % unary 15
% 4.94/11.56 % binary 8
% 4.94/11.56 % lits 37
% 4.94/11.56 % lits eq 0
% 4.94/11.56 % fd_pure 0
% 4.94/11.56 % fd_pseudo 0
% 4.94/11.56 % fd_cond 0
% 4.94/11.56 % fd_pseudo_cond 0
% 4.94/11.56 % AC symbols 0
% 4.94/11.56
% 4.94/11.56 % ------ Schedule dynamic 5 is on
% 4.94/11.56
% 4.94/11.56 % ------ no conjectures: strip conj schedule
% 4.94/11.56
% 4.94/11.56 % ------ no equalities: superposition off
% 4.94/11.56
% 4.94/11.56 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 4.94/11.56
% 4.94/11.56
% 4.94/11.56 % ------
% 4.94/11.56 % Current options:
% 4.94/11.56 % ------
% 4.94/11.56
% 4.94/11.56
% 4.94/11.56 %
% 4.94/11.56
% 4.94/11.56 % ------ Proving...
% 4.94/11.56 %
% 4.94/11.56
% 4.94/11.56 % SZS status Theorem for theBenchmark.p
% 4.94/11.56
% 4.94/11.56 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.94/11.56
% 4.94/11.56
%------------------------------------------------------------------------------