%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS259+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 : n008.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:28 PM UTC 2026
% Result : Theorem 2.13s 1.29s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 14 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 145 ( 62 ~; 54 |; 22 &)
% ( 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 : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn 99 !; 18 ?; 34 :)
% 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(f7,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,tac) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',tac) ).
fof(f20,axiom,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(f26,axiom,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',not) ).
fof(f27,axiom,
? [X0] :
! [X1] : model(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',tautology) ).
fof(f30,axiom,
? [X0,X1] :
( ? [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',sat_non_taut_pair) ).
fof(f33,conjecture,
mighta(tac,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_tac_thm) ).
fof(f34,negated_conjecture,
~ mighta(tac,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(tac,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
=> mighta(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
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) )
| mighta(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(f69,plain,
! [X0,X1] :
( ( ? [X3] : ~ model(X3,X1)
| ! [X2] : ~ model(X2,X0)
| status(X0,X1,tac) )
& ( ~ status(X0,X1,tac)
| ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f70,plain,
! [X0,X1] :
( ( ? [X3] : ~ model(X3,X1)
| ! [X2] : ~ model(X2,X0)
| status(X0,X1,tac) )
& ( ~ status(X0,X1,tac)
| ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) ) ) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( ? [X5] : ~ model(X5,X1)
| ! [X4] : ~ model(X4,X0)
| status(X0,X1,tac) )
& ( ~ status(X0,X1,tac)
| ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) ) ) ),
inference(rectify,[],[f70]) ).
fof(f72,plain,
! [X0,X1] :
( ( ~ model(sK13(X1),X1)
| ! [X4] : ~ model(X4,X0)
| status(X0,X1,tac) )
& ( ~ status(X0,X1,tac)
| ( ! [X3] : model(X3,X1)
& model(sK12(X0),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X2,sK12(X0)),skolemize(X5,sK13(X1))],[f71]) ).
fof(f119,plain,
! [X0,X1] :
( ( ~ model(X0,X1)
| ~ model(X0,not(X1)) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f120,plain,
! [X1] : model(X1,sK41),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41]),skolemize(X0,sK41)],[f27]) ).
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(f139,plain,
! [X0,X1] :
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f64]) ).
fof(f140,plain,
! [X0,X1] :
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f64]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f147,plain,
! [X0,X1,X4] :
( ~ model(sK13(X1),X1)
| ~ model(X4,X0)
| status(X0,X1,tac) ),
inference(cnf_transformation,[],[f72]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| mighta(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f203,plain,
! [X0,X1] :
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f204,plain,
! [X1] : model(X1,sK41),
inference(cnf_transformation,[],[f120]) ).
fof(f208,plain,
( ~ model(sK49,sK47)
| ~ model(sK49,sK46) ),
inference(cnf_transformation,[],[f123]) ).
fof(f219,plain,
~ mighta(tac,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_63,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| model(sK9(X0,X1),X0) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X2,X0,tac)
| ~ model(X1,X2)
| ~ model(sK13(X0),X0) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( mighta(X3,X2)
| ~ 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_127,plain,
! [X0: $i] : model(X0,sK41),
inference(cnf_transformation,[],[f204]) ).
tcf(c_133,plain,
( ~ model(sK49,sK47)
| ~ model(sK49,sK46) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_142,negated_conjecture,
~ mighta(tac,thm),
inference(cnf_transformation,[],[f219]) ).
tcf(c_974,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,tac)
| ~ status(X0,X1,thm) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
tcf(c_1020,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,tac)
| ~ status(X0,X1,thm) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
tcf(c_2592,plain,
! [X0: $i] : status(X0,sK41,thm),
inference(superposition,[status(thm)],[c_127,c_63]) ).
tcf(c_3350,plain,
! [X0: $i,X1: $i] :
( status(X1,sK41,tac)
| ~ model(X0,X1) ),
inference(superposition,[status(thm)],[c_127,c_72]) ).
tcf(c_3541,plain,
! [X0: $i,X1: $i] :
( status(X0,sK41,tac)
| status(X0,X1,thm) ),
inference(superposition,[status(thm)],[c_64,c_3350]) ).
tcf(c_6690,plain,
! [X0: $i] :
( ~ status(X0,sK41,tac)
| ~ status(X0,sK41,thm) ),
inference(instantiation,[status(thm)],[c_1020]) ).
tcf(c_6746,plain,
! [X0: $i,X1: $i] : status(X0,X1,thm),
inference(global_subsumption_just,[status(thm)],[c_3541,c_2592,c_3541,c_6690]) ).
tcf(c_6748,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X0,X2)
| ~ model(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_6746]) ).
tcf(c_6760,plain,
! [X0: $i,X1: $i] : model(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_125,c_6748]) ).
tcf(c_6762,plain,
~ model(sK49,sK46),
inference(backward_subsumption_resolution,[status(thm)],[c_133,c_6748]) ).
tcf(c_6763,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6762,c_6760]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS259+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.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 19:51:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 2.13/1.29 % SZS status Started for theBenchmark.p
% 2.13/1.29 % SZS status Theorem for theBenchmark.p
% 2.13/1.29
% 2.13/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.13/1.29
% 2.13/1.29 % ------ iProver source info
% 2.13/1.29
% 2.13/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.13/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.13/1.29 % git: non_committed_changes: false
% 2.13/1.29
% 2.13/1.29 % ------ Parsing...
% 2.13/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.13/1.29
% 2.13/1.29 % ------ 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.13/1.29
% 2.13/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.13/1.29 % ------ Proving...
% 2.13/1.29 % ------ Problem Properties
% 2.13/1.29
% 2.13/1.29 %
% 2.13/1.29 % clauses 91
% 2.13/1.29 % conjectures 0
% 2.13/1.29 % EPR 39
% 2.13/1.29 % Horn 72
% 2.13/1.29 % unary 13
% 2.13/1.29 % binary 47
% 2.13/1.29 % lits 220
% 2.13/1.29 % lits eq 0
% 2.13/1.29 % fd_pure 0
% 2.13/1.29 % fd_pseudo 0
% 2.13/1.29 % fd_cond 0
% 2.13/1.29 % fd_pseudo_cond 0
% 2.13/1.29 % AC symbols 0
% 2.13/1.29
% 2.13/1.29 % ------ Schedule dynamic 5 is on
% 2.13/1.29
% 2.13/1.29 % ------ no conjectures: strip conj schedule
% 2.13/1.29
% 2.13/1.29 % ------ no equalities: superposition off
% 2.13/1.29
% 2.13/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.13/1.29
% 2.13/1.29
% 2.13/1.29 % ------
% 2.13/1.29 % Current options:
% 2.13/1.29 % ------
% 2.13/1.29
% 2.13/1.29
% 2.13/1.29 %
% 2.13/1.29
% 2.13/1.29 % ------ Proving...
% 2.13/1.29 %
% 2.13/1.29
% 2.13/1.29 % SZS status Theorem for theBenchmark.p
% 2.13/1.29
% 2.13/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.13/1.29
% 2.13/1.29
%------------------------------------------------------------------------------