%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS254+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 : n016.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.33s 6.31s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 114 ( 46 ~; 44 |; 16 &)
% ( 5 <=>; 3 =>; 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 : 5 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 74 !; 15 ?; 17 :)
% 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(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(f33,conjecture,
mighta(unp,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_unp_thm) ).
fof(f34,negated_conjecture,
~ mighta(unp,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(unp,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(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(f46,plain,
! [X0,X1] :
( ! [X2,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| mighta(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(f126,plain,
! [X0,X1,X5] :
( ~ model(X5,X0)
| status(X0,X1,unp) ),
inference(cnf_transformation,[],[f51]) ).
fof(f127,plain,
! [X0,X1] :
( model(sK1(X1),X1)
| status(X0,X1,unp) ),
inference(cnf_transformation,[],[f51]) ).
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(f199,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| mighta(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f219,plain,
~ mighta(unp,thm),
inference(cnf_transformation,[],[f35]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( status(X1,X0,unp)
| model(sK1(X0),X0) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X1,X2,unp)
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
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_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_142,negated_conjecture,
~ mighta(unp,thm),
inference(cnf_transformation,[],[f219]) ).
tcf(c_156,plain,
( status(wth,wth,unp)
| model(sK1(wth),wth) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_171,plain,
( status(wth,wth,thm)
| model(sK9(wth,wth),wth) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_181,plain,
( status(wth,wth,thm)
| ~ model(sK9(wth,wth),wth) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_974,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,thm)
| ~ status(X0,X1,unp) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
tcf(c_975,plain,
( ~ status(wth,wth,thm)
| ~ status(wth,wth,unp) ),
inference(instantiation,[status(thm)],[c_974]) ).
tcf(c_1758,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,unp)
| ~ model(sK1(X0),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_1759,plain,
( status(wth,wth,unp)
| ~ model(sK1(wth),wth) ),
inference(instantiation,[status(thm)],[c_1758]) ).
tcf(c_1760,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1759,c_975,c_181,c_171,c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KRS254+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.14/5.41 % Computer : n016.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Wed Sep 23 19:54:50 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.45 Running first-order theorem proving
% 0.14/5.45 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.14/5.46
% 0.14/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.46
% 0.14/5.46 % Detected problem language: tptp
% 0.14/5.47 % Proving...
% 2.33/6.31 % SZS status Started for theBenchmark.p
% 2.33/6.31 % SZS status Theorem for theBenchmark.p
% 2.33/6.31
% 2.33/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.33/6.31
% 2.33/6.31 % ------ iProver source info
% 2.33/6.31
% 2.33/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 2.33/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.33/6.31 % git: non_committed_changes: false
% 2.33/6.31
% 2.33/6.31 % ------ Parsing...
% 2.33/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.33/6.31
% 2.33/6.31 % ------ 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.33/6.31
% 2.33/6.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.33/6.31 % ------ Proving...
% 2.33/6.31 % ------ Problem Properties
% 2.33/6.31
% 2.33/6.31 %
% 2.33/6.31 % clauses 91
% 2.33/6.31 % conjectures 0
% 2.33/6.31 % EPR 39
% 2.33/6.31 % Horn 72
% 2.33/6.31 % unary 13
% 2.33/6.31 % binary 47
% 2.33/6.31 % lits 220
% 2.33/6.31 % lits eq 0
% 2.33/6.31 % fd_pure 0
% 2.33/6.31 % fd_pseudo 0
% 2.33/6.31 % fd_cond 0
% 2.33/6.31 % fd_pseudo_cond 0
% 2.33/6.31 % AC symbols 0
% 2.33/6.31
% 2.33/6.31 % ------ Schedule dynamic 5 is on
% 2.33/6.31
% 2.33/6.31 % ------ no conjectures: strip conj schedule
% 2.33/6.31
% 2.33/6.31 % ------ no equalities: superposition off
% 2.33/6.31
% 2.33/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.33/6.31
% 2.33/6.31
% 2.33/6.31 % ------
% 2.33/6.31 % Current options:
% 2.33/6.31 % ------
% 2.33/6.31
% 2.33/6.31
% 2.33/6.31 %
% 2.33/6.31
% 2.33/6.31 % ------ Proving...
% 2.33/6.31 %
% 2.33/6.31
% 2.33/6.31 % SZS status Theorem for theBenchmark.p
% 2.33/6.31
% 2.33/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.33/6.32
% 2.33/6.32
%------------------------------------------------------------------------------