%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS265+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 : n013.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:29 PM UTC 2026
% Result : Theorem 2.93s 11.30s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 39 ~; 31 |; 11 &)
% ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 70 !; 10 ?; 19 :)
% 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(f13,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',cax) ).
fof(f20,axiom,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(f29,axiom,
? [X0] :
! [X1] : ~ model(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).
fof(f33,conjecture,
mighta(cax,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_cax_thm) ).
fof(f34,negated_conjecture,
~ mighta(cax,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(cax,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(f42,plain,
! [X0,X1] :
( ! [X2] : ~ model(X2,X0)
<=> status(X0,X1,cax) ),
inference(ennf_transformation,[],[f13]) ).
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(f92,plain,
! [X0,X1] :
( ( ? [X2] : model(X2,X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0,X1] :
( ( ? [X3] : model(X3,X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( model(sK28(X0),X0)
| status(X0,X1,cax) )
& ( ~ status(X0,X1,cax)
| ! [X2] : ~ model(X2,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28]),skolemize(X3,sK28(X0))],[f93]) ).
fof(f122,plain,
! [X1] : ~ model(X1,sK45),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45]),skolemize(X0,sK45)],[f29]) ).
fof(f139,plain,
! [X0,X1] :
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f64]) ).
fof(f176,plain,
! [X0,X1] :
( model(sK28(X0),X0)
| status(X0,X1,cax) ),
inference(cnf_transformation,[],[f94]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,cax)
| ~ model(X2,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| mighta(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f207,plain,
! [X1] : ~ model(X1,sK45),
inference(cnf_transformation,[],[f122]) ).
fof(f219,plain,
~ mighta(cax,thm),
inference(cnf_transformation,[],[f35]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| model(sK9(X0,X1),X0) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ model(X2,X0)
| ~ status(X0,X1,cax) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,cax)
| model(sK28(X0),X0) ),
inference(cnf_transformation,[],[f176]) ).
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_130,plain,
! [X0: $i] : ~ model(X0,sK45),
inference(cnf_transformation,[],[f207]) ).
tcf(c_142,negated_conjecture,
~ mighta(cax,thm),
inference(cnf_transformation,[],[f219]) ).
tcf(c_974,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,cax)
| ~ status(X0,X1,thm) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
tcf(c_3136,plain,
! [X0: $i,X1: $i] :
( model(sK28(X1),X1)
| ~ model(X0,X1) ),
inference(superposition,[status(thm)],[c_100,c_99]) ).
tcf(c_3429,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| model(sK28(X0),X0) ),
inference(superposition,[status(thm)],[c_64,c_3136]) ).
tcf(c_3532,plain,
! [X0: $i] : model(sK28(X0),X0),
inference(global_subsumption_just,[status(thm)],[c_3429,c_100,c_974,c_3429]) ).
tcf(c_3535,plain,
$false,
inference(superposition,[status(thm)],[c_3532,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS265+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/10.37 % Computer : n013.cluster.edu
% 0.08/10.37 % Model : x86_64 x86_64
% 0.08/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37 % Memory : 8046.5625MB
% 0.08/10.37 % OS : Linux 6.8.0-71-generic
% 0.08/10.37 % CPULimit : 300
% 0.08/10.37 % WCLimit : 300
% 0.08/10.37 % DateTime : Wed Sep 23 19:51:07 UTC 2026
% 0.08/10.38 % CPUTime :
% 0.08/10.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/10.42 Running first-order theorem proving
% 0.12/10.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.12/10.43
% 0.12/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/10.43
% 0.12/10.43 % Detected problem language: tptp
% 0.12/10.44 % Proving...
% 2.93/11.30 % SZS status Started for theBenchmark.p
% 2.93/11.30 % SZS status Theorem for theBenchmark.p
% 2.93/11.30
% 2.93/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.93/11.30
% 2.93/11.30 % ------ iProver source info
% 2.93/11.30
% 2.93/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.93/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.93/11.30 % git: non_committed_changes: false
% 2.93/11.30
% 2.93/11.30 % ------ Parsing...
% 2.93/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.93/11.30
% 2.93/11.30 % ------ 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.93/11.30
% 2.93/11.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.93/11.30 % ------ Proving...
% 2.93/11.30 % ------ Problem Properties
% 2.93/11.30
% 2.93/11.30 %
% 2.93/11.30 % clauses 91
% 2.93/11.30 % conjectures 0
% 2.93/11.30 % EPR 39
% 2.93/11.30 % Horn 72
% 2.93/11.30 % unary 13
% 2.93/11.30 % binary 47
% 2.93/11.30 % lits 220
% 2.93/11.30 % lits eq 0
% 2.93/11.30 % fd_pure 0
% 2.93/11.30 % fd_pseudo 0
% 2.93/11.30 % fd_cond 0
% 2.93/11.30 % fd_pseudo_cond 0
% 2.93/11.30 % AC symbols 0
% 2.93/11.30
% 2.93/11.30 % ------ Schedule dynamic 5 is on
% 2.93/11.30
% 2.93/11.30 % ------ no conjectures: strip conj schedule
% 2.93/11.30
% 2.93/11.30 % ------ no equalities: superposition off
% 2.93/11.30
% 2.93/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.93/11.30
% 2.93/11.30
% 2.93/11.30 % ------
% 2.93/11.30 % Current options:
% 2.93/11.30 % ------
% 2.93/11.30
% 2.93/11.30
% 2.93/11.30 %
% 2.93/11.30
% 2.93/11.30 % ------ Proving...
% 2.93/11.30 %
% 2.93/11.30
% 2.93/11.30 % SZS status Theorem for theBenchmark.p
% 2.93/11.30
% 2.93/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.97/11.30
% 2.97/11.30
%------------------------------------------------------------------------------