%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS258+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 : n010.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 1.59s 6.39s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 145 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 166 ( 63 ~; 67 |; 29 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 78 !; 17 ?; 22 :)
% 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(f6,axiom,
! [X0,X1] :
( ( ! [X3] :
( model(X3,X0)
<=> model(X3,X1) )
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,eqv) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',eqv) ).
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(f32,axiom,
? [X0,X1,X2] :
( ? [X3] : model(X3,X2)
& ~ model(X0,X2)
& model(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).
fof(f33,conjecture,
mighta(eqv,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_eqv_thm) ).
fof(f34,negated_conjecture,
~ mighta(eqv,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(eqv,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,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| mighta(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f38,plain,
! [X0,X1] :
( ! [X2] :
( ~ model(X2,X0)
| model(X2,X1) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
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,[],[f38]) ).
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] :
( ( ? [X3] :
( ( model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X0)
| ~ model(X3,X1) ) )
| ! [X2] : ~ model(X2,X0)
| status(X0,X1,eqv) )
& ( ~ status(X0,X1,eqv)
| ( ! [X3] :
( ( ~ model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X1)
| model(X3,X0) ) )
& ? [X2] : model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f44,plain,
! [X0,X1] :
( ( ? [X3] :
( ( model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X0)
| ~ model(X3,X1) ) )
| ! [X2] : ~ model(X2,X0)
| status(X0,X1,eqv) )
& ( ~ status(X0,X1,eqv)
| ( ! [X3] :
( ( ~ model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X1)
| model(X3,X0) ) )
& ? [X2] : model(X2,X0) ) ) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( ( ? [X5] :
( ( model(X5,X0)
| model(X5,X1) )
& ( ~ model(X5,X0)
| ~ model(X5,X1) ) )
| ! [X4] : ~ model(X4,X0)
| status(X0,X1,eqv) )
& ( ~ status(X0,X1,eqv)
| ( ! [X3] :
( ( ~ model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X1)
| model(X3,X0) ) )
& ? [X2] : model(X2,X0) ) ) ),
inference(rectify,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ( ( ( model(sK2(X0,X1),X0)
| model(sK2(X0,X1),X1) )
& ( ~ model(sK2(X0,X1),X0)
| ~ model(sK2(X0,X1),X1) ) )
| ! [X4] : ~ model(X4,X0)
| status(X0,X1,eqv) )
& ( ~ status(X0,X1,eqv)
| ( ! [X3] :
( ( ~ model(X3,X0)
| model(X3,X1) )
& ( ~ model(X3,X1)
| model(X3,X0) ) )
& model(sK1(X0),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X2,sK1(X0)),skolemize(X5,sK2(X0,X1))],[f45]) ).
fof(f47,plain,
( model(sK6,sK5)
& ~ model(sK3,sK5)
& model(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f32]) ).
fof(f53,plain,
~ mighta(eqv,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| mighta(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f55,plain,
! [X0,X1] :
( model(sK0(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f42]) ).
fof(f56,plain,
! [X0,X1] :
( ~ model(sK0(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f42]) ).
fof(f58,plain,
! [X0,X1,X4] :
( model(sK2(X0,X1),X0)
| model(sK2(X0,X1),X1)
| ~ model(X4,X0)
| status(X0,X1,eqv) ),
inference(cnf_transformation,[],[f46]) ).
fof(f59,plain,
! [X0,X1,X4] :
( ~ model(sK2(X0,X1),X0)
| ~ model(sK2(X0,X1),X1)
| ~ model(X4,X0)
| status(X0,X1,eqv) ),
inference(cnf_transformation,[],[f46]) ).
fof(f65,plain,
model(sK3,sK4),
inference(cnf_transformation,[],[f47]) ).
tcf(c_49,negated_conjecture,
~ mighta(eqv,thm),
inference(cnf_transformation,[],[f53]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( mighta(X2,X3)
| ~ status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ model(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| model(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X0,X1,eqv)
| ~ model(X2,X0)
| ~ model(sK2(X0,X1),X1)
| ~ model(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X1,X2,eqv)
| model(sK2(X1,X2),X2)
| model(sK2(X1,X2),X1)
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_59,plain,
model(sK3,sK4),
inference(cnf_transformation,[],[f65]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,thm)
| ~ status(X0,X1,eqv) ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
tcf(c_552,plain,
! [X0: $i] : status(X0,X0,thm),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_576,plain,
! [X0: $i] : ~ status(X0,X0,eqv),
inference(superposition,[status(thm)],[c_552,c_171]) ).
tcf(c_634,plain,
! [X0: $i] :
( status(sK4,X0,eqv)
| model(sK2(sK4,X0),sK4)
| model(sK2(sK4,X0),X0) ),
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_847,plain,
( status(sK4,sK4,eqv)
| model(sK2(sK4,sK4),sK4) ),
inference(equality_factoring,[status(thm)],[c_634]) ).
tcf(c_849,plain,
model(sK2(sK4,sK4),sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_847,c_576]) ).
tcf(c_938,plain,
! [X0: $i] :
( status(sK4,sK4,eqv)
| ~ model(X0,sK4)
| ~ model(sK2(sK4,sK4),sK4) ),
inference(superposition,[status(thm)],[c_849,c_57]) ).
tcf(c_940,plain,
! [X0: $i] :
( status(sK4,sK4,eqv)
| ~ model(X0,sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_938,c_849]) ).
tcf(c_941,plain,
! [X0: $i] : ~ model(X0,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_940,c_576]) ).
tcf(c_942,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_849,c_941]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS258+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.12/5.58 % Computer : n010.cluster.edu
% 0.12/5.58 % Model : x86_64 x86_64
% 0.12/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.58 % Memory : 8046.5625MB
% 0.12/5.58 % OS : Linux 6.8.0-71-generic
% 0.12/5.58 % CPULimit : 300
% 0.12/5.58 % WCLimit : 300
% 0.12/5.58 % DateTime : Wed Sep 23 19:51:04 UTC 2026
% 0.12/5.58 % CPUTime :
% 0.12/5.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.62 Running first-order theorem proving
% 0.15/5.62 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.15/5.63
% 0.15/5.63 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.63
% 0.15/5.63 % Detected problem language: tptp
% 0.15/5.64 % Proving...
% 1.59/6.39 % SZS status Started for theBenchmark.p
% 1.59/6.39 % SZS status Theorem for theBenchmark.p
% 1.59/6.39
% 1.59/6.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/6.39
% 1.59/6.39 % ------ iProver source info
% 1.59/6.39
% 1.59/6.39 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/6.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/6.39 % git: non_committed_changes: false
% 1.59/6.39
% 1.59/6.39 % ------ Parsing...
% 1.59/6.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/6.39
% 1.59/6.39 % ------ 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 %
% 1.59/6.39
% 1.59/6.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.59/6.39 % ------ Proving...
% 1.59/6.39 % ------ Problem Properties
% 1.59/6.39
% 1.59/6.39 %
% 1.59/6.39 % clauses 24
% 1.59/6.39 % conjectures 0
% 1.59/6.39 % EPR 19
% 1.59/6.39 % Horn 22
% 1.59/6.39 % unary 13
% 1.59/6.39 % binary 6
% 1.59/6.39 % lits 42
% 1.59/6.39 % lits eq 0
% 1.59/6.39 % fd_pure 0
% 1.59/6.39 % fd_pseudo 0
% 1.59/6.39 % fd_cond 0
% 1.59/6.39 % fd_pseudo_cond 0
% 1.59/6.39 % AC symbols 0
% 1.59/6.39
% 1.59/6.39 % ------ Schedule dynamic 5 is on
% 1.59/6.39
% 1.59/6.39 % ------ no conjectures: strip conj schedule
% 1.59/6.39
% 1.59/6.39 % ------ no equalities: superposition off
% 1.59/6.39
% 1.59/6.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.59/6.39
% 1.59/6.39
% 1.59/6.39 % ------
% 1.59/6.39 % Current options:
% 1.59/6.39 % ------
% 1.59/6.39
% 1.59/6.39
% 1.59/6.39 %
% 1.59/6.39
% 1.59/6.39 % ------ Proving...
% 1.59/6.39 %
% 1.59/6.39
% 1.59/6.39 % SZS status Theorem for theBenchmark.p
% 1.59/6.39
% 1.59/6.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/6.40
%------------------------------------------------------------------------------