%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS215+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 : n009.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:25 PM UTC 2026
% Result : Theorem 0.31s 6.09s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 134 ( 55 ~; 52 |; 20 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 84 !; 14 ?; 31 :)
% 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(f22,axiom,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(f26,axiom,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',not) ).
fof(f29,axiom,
? [X0] :
! [X1] : ~ model(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).
fof(f30,axiom,
? [X0,X1] :
( ? [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',sat_non_taut_pair) ).
fof(f33,conjecture,
nota(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_csa_thm) ).
fof(f34,negated_conjecture,
~ nota(csa,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nota(csa,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(f39,plain,
! [X0,X1] :
( ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f46,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| nota(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
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(f107,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(f108,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,[],[f107]) ).
fof(f109,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) )
| status(X0,X1,csa) )
& ( ~ status(X0,X1,csa)
| ( model(sK36(X0,X1),not(X1))
& model(sK36(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK36]),skolemize(X2,sK36(X0,X1))],[f108]) ).
fof(f119,plain,
! [X0,X1] :
( ( ~ model(X0,X1)
| ~ model(X0,not(X1)) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f122,plain,
! [X1] : ~ model(X1,sK45),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45]),skolemize(X0,sK45)],[f29]) ).
fof(f123,plain,
( ( ~ model(sK49,sK47)
| ~ model(sK49,sK46) )
& model(sK48,sK47)
& model(sK48,sK46) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK46,sK47,sK48,sK49]),skolemize(X0,sK46),skolemize(X1,sK47),skolemize(X2,sK48),skolemize(X3,sK49)],[f30]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f188,plain,
! [X3,X0,X1] :
( ~ model(X3,not(X1))
| ~ model(X3,X0)
| status(X0,X1,csa) ),
inference(cnf_transformation,[],[f109]) ).
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(f207,plain,
! [X1] : ~ model(X1,sK45),
inference(cnf_transformation,[],[f122]) ).
fof(f209,plain,
model(sK48,sK47),
inference(cnf_transformation,[],[f123]) ).
fof(f219,plain,
~ nota(csa,thm),
inference(cnf_transformation,[],[f35]) ).
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_113,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X2,X1,csa)
| ~ model(X0,X2)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f188]) ).
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_130,plain,
! [X0: $i] : ~ model(X0,sK45),
inference(cnf_transformation,[],[f207]) ).
tcf(c_132,plain,
model(sK48,sK47),
inference(cnf_transformation,[],[f209]) ).
tcf(c_142,negated_conjecture,
~ nota(csa,thm),
inference(cnf_transformation,[],[f219]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i] :
( model(X0,not(X1))
| model(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_125]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i] :
( model(X0,X1)
| model(X0,not(X1)) ),
inference(renaming,[status(thm)],[c_203]) ).
tcf(c_527,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X0,X2)
| status(X1,X2,csa)
| ~ model(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_113,c_204]) ).
tcf(c_973,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ status(X0,X1,csa) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
tcf(c_1023,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,csa)
| status(X0,X1,thm) ),
inference(prop_impl_just,[status(thm)],[c_973]) ).
tcf(c_1024,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ status(X0,X1,csa) ),
inference(renaming,[status(thm)],[c_1023]) ).
tcf(c_2331,plain,
! [X0: $i] :
( model(sK48,X0)
| ~ model(sK48,sK47)
| ~ status(sK47,X0,thm) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_2799,plain,
! [X0: $i] :
( model(sK48,X0)
| status(sK47,X0,csa)
| ~ model(sK48,sK47) ),
inference(instantiation,[status(thm)],[c_527]) ).
tcf(c_3823,plain,
! [X0: $i] :
( model(sK48,X0)
| status(sK47,X0,csa) ),
inference(superposition,[status(thm)],[c_132,c_527]) ).
tcf(c_5423,plain,
! [X0: $i] :
( status(sK47,X0,thm)
| ~ status(sK47,X0,csa) ),
inference(instantiation,[status(thm)],[c_1024]) ).
tcf(c_5845,plain,
! [X0: $i] : model(sK48,X0),
inference(global_subsumption_just,[status(thm)],[c_3823,c_132,c_2331,c_2799,c_5423]) ).
tcf(c_5853,plain,
$false,
inference(superposition,[status(thm)],[c_5845,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS215+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n009.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 19:43:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 0.31/6.09 % SZS status Started for theBenchmark.p
% 0.31/6.09 % SZS status Theorem for theBenchmark.p
% 0.31/6.09
% 0.31/6.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.31/6.09
% 0.31/6.09 % ------ iProver source info
% 0.31/6.09
% 0.31/6.09 % git: date: 2026-07-19 20:42:38 +0200
% 0.31/6.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.31/6.09 % git: non_committed_changes: false
% 0.31/6.09
% 0.31/6.09 % ------ Parsing...
% 0.31/6.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.31/6.09
% 0.31/6.09 % ------ 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 %
% 0.31/6.09
% 0.31/6.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.31/6.09 % ------ Proving...
% 0.31/6.09 % ------ Problem Properties
% 0.31/6.09
% 0.31/6.09 %
% 0.31/6.09 % clauses 91
% 0.31/6.09 % conjectures 0
% 0.31/6.09 % EPR 39
% 0.31/6.09 % Horn 72
% 0.31/6.09 % unary 13
% 0.31/6.09 % binary 47
% 0.31/6.09 % lits 220
% 0.31/6.09 % lits eq 0
% 0.31/6.09 % fd_pure 0
% 0.31/6.09 % fd_pseudo 0
% 0.31/6.09 % fd_cond 0
% 0.31/6.09 % fd_pseudo_cond 0
% 0.31/6.09 % AC symbols 0
% 0.31/6.09
% 0.31/6.09 % ------ Schedule dynamic 5 is on
% 0.31/6.09
% 0.31/6.09 % ------ no conjectures: strip conj schedule
% 0.31/6.09
% 0.31/6.09 % ------ no equalities: superposition off
% 0.31/6.09
% 0.31/6.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.31/6.09
% 0.31/6.09
% 0.31/6.09 % ------
% 0.31/6.09 % Current options:
% 0.31/6.09 % ------
% 0.31/6.09
% 0.31/6.09
% 0.31/6.09 %
% 0.31/6.09
% 0.31/6.09 % ------ Proving...
% 0.31/6.09 %
% 0.31/6.09
% 0.31/6.09 % SZS status Theorem for theBenchmark.p
% 0.31/6.09
% 0.31/6.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.31/6.09
% 0.31/6.09
%------------------------------------------------------------------------------