%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS257+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 3.87s 1.46s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 133 ( 54 ~; 45 |; 27 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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; 7 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 65 !; 19 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ? [X2] :
( model(X2,X1)
& model(X2,X0) )
<=> status(X0,X1,sat) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',sat) ).
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(f31,axiom,
? [X0,X1] :
( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( model(X4,X1)
& ~ model(X4,X0) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',mixed_pair) ).
fof(f33,conjecture,
mighta(sat,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_sat_thm) ).
fof(f34,negated_conjecture,
~ mighta(sat,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(sat,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(f39,plain,
? [X0,X1] :
( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( model(X4,X1)
& ~ model(X4,X0) )
& ! [X3] :
( ~ model(X3,X0)
| model(X3,X1) )
& ? [X2] : model(X2,X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f40,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ model(X2,X1)
| ~ model(X2,X0) )
| status(X0,X1,sat) )
& ( ~ status(X0,X1,sat)
| ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) )
| status(X0,X1,sat) )
& ( ~ status(X0,X1,sat)
| ? [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ),
inference(rectify,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) )
| status(X0,X1,sat) )
& ( ~ status(X0,X1,sat)
| ( model(sK0(X0,X1),X1)
& model(sK0(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f41]) ).
fof(f43,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(f44,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,[],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( ( ( model(sK1(X0,X1),X0)
& ~ model(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1))],[f44]) ).
fof(f47,plain,
( ~ model(sK10,sK7)
& model(sK9,sK7)
& ~ model(sK9,sK6)
& ! [X3] :
( ~ model(X3,sK6)
| model(X3,sK7) )
& model(sK8,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X4,sK9),skolemize(X5,sK10)],[f39]) ).
fof(f52,plain,
~ mighta(sat,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| mighta(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
! [X3,X0,X1] :
( ~ model(X3,X1)
| ~ model(X3,X0)
| status(X0,X1,sat) ),
inference(cnf_transformation,[],[f42]) ).
fof(f57,plain,
! [X0,X1] :
( model(sK1(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f45]) ).
fof(f58,plain,
! [X0,X1] :
( ~ model(sK1(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f45]) ).
fof(f66,plain,
! [X3] :
( ~ model(X3,sK6)
| model(X3,sK7) ),
inference(cnf_transformation,[],[f47]) ).
fof(f67,plain,
model(sK8,sK6),
inference(cnf_transformation,[],[f47]) ).
tcf(c_49,negated_conjecture,
~ mighta(sat,thm),
inference(cnf_transformation,[],[f52]) ).
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,[],[f53]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( status(X1,X2,sat)
| ~ model(X0,X2)
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ model(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| model(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_60,plain,
model(sK8,sK6),
inference(cnf_transformation,[],[f67]) ).
tcf(c_61,plain,
! [X0: $i] :
( model(X0,sK7)
| ~ model(X0,sK6) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,thm)
| ~ status(X0,X1,sat) ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
tcf(c_226,plain,
( model(sK8,sK7)
| ~ model(sK8,sK6) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_231,plain,
! [X0: $i] :
( status(sK6,X0,sat)
| ~ model(sK8,sK6)
| ~ model(sK8,X0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_278,plain,
( status(sK6,sK7,sat)
| ~ model(sK8,sK7)
| ~ model(sK8,sK6) ),
inference(instantiation,[status(thm)],[c_231]) ).
tcf(c_347,plain,
( ~ status(sK6,sK7,thm)
| ~ status(sK6,sK7,sat) ),
inference(instantiation,[status(thm)],[c_150]) ).
tcf(c_441,plain,
! [X0: $i] :
( status(sK6,X0,thm)
| model(sK1(sK6,X0),sK7) ),
inference(superposition,[status(thm)],[c_56,c_61]) ).
tcf(c_515,plain,
status(sK6,sK7,thm),
inference(superposition,[status(thm)],[c_441,c_55]) ).
tcf(c_516,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_515,c_347,c_278,c_226,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS257+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.38 % Computer : n016.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 19:54:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.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.16/0.46
% 0.16/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.46
% 0.16/0.47 % Detected problem language: tptp
% 0.16/0.48 % Proving...
% 3.87/1.46 % SZS status Started for theBenchmark.p
% 3.87/1.46 % SZS status Theorem for theBenchmark.p
% 3.87/1.46
% 3.87/1.46 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.87/1.46
% 3.87/1.46 % ------ iProver source info
% 3.87/1.46
% 3.87/1.46 % git: date: 2026-07-19 20:42:38 +0200
% 3.87/1.46 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.87/1.46 % git: non_committed_changes: false
% 3.87/1.46
% 3.87/1.46 % ------ Parsing...
% 3.87/1.46 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.87/1.46
% 3.87/1.46 % ------ 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 %
% 3.87/1.46
% 3.87/1.46 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.87/1.46 % ------ Proving...
% 3.87/1.46 % ------ Problem Properties
% 3.87/1.46
% 3.87/1.46 %
% 3.87/1.46 % clauses 22
% 3.87/1.46 % conjectures 0
% 3.87/1.46 % EPR 18
% 3.87/1.46 % Horn 21
% 3.87/1.46 % unary 13
% 3.87/1.46 % binary 7
% 3.87/1.46 % lits 33
% 3.87/1.46 % lits eq 0
% 3.87/1.46 % fd_pure 0
% 3.87/1.46 % fd_pseudo 0
% 3.87/1.46 % fd_cond 0
% 3.87/1.46 % fd_pseudo_cond 0
% 3.87/1.46 % AC symbols 0
% 3.87/1.46
% 3.87/1.46 % ------ Schedule dynamic 5 is on
% 3.87/1.46
% 3.87/1.46 % ------ no conjectures: strip conj schedule
% 3.87/1.46
% 3.87/1.46 % ------ no equalities: superposition off
% 3.87/1.46
% 3.87/1.46 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.87/1.46
% 3.87/1.46
% 3.87/1.46 % ------
% 3.87/1.46 % Current options:
% 3.87/1.46 % ------
% 3.87/1.46
% 3.87/1.46
% 3.87/1.46 %
% 3.87/1.46
% 3.87/1.46 % ------ Proving...
% 3.87/1.46 %
% 3.87/1.46
% 3.87/1.46 % SZS status Theorem for theBenchmark.p
% 3.87/1.46
% 3.87/1.46 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.87/1.46
% 3.87/1.46
%------------------------------------------------------------------------------