%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS234+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 : n006.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:26 PM UTC 2026
% Result : Theorem 3.91s 1.41s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 16 unt; 2 def)
% Number of atoms : 131 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 45 ~; 44 |; 18 &)
% ( 5 <=>; 4 =>; 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 : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 92 !; 10 ?; 26 :)
% 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(f18,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) )
<=> status(X0,X1,uns) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',uns) ).
fof(f23,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(f26,axiom,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',not) ).
fof(f33,conjecture,
nevera(uns,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_uns_thm) ).
fof(f34,negated_conjecture,
~ nevera(uns,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nevera(uns,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
=> nevera(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
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,X0)
& status(X2,X3,X1) )
| nevera(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(f110,plain,
! [X0,X1] :
( ( ? [X3] : ~ model(X3,not(X1))
| ? [X2] : ~ model(X2,X0)
| status(X0,X1,uns) )
& ( ~ status(X0,X1,uns)
| ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f111,plain,
! [X0,X1] :
( ( ? [X3] : ~ model(X3,not(X1))
| ? [X2] : ~ model(X2,X0)
| status(X0,X1,uns) )
& ( ~ status(X0,X1,uns)
| ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) ) ) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( ? [X5] : ~ model(X5,not(X1))
| ? [X4] : ~ model(X4,X0)
| status(X0,X1,uns) )
& ( ~ status(X0,X1,uns)
| ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) ) ) ),
inference(rectify,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( ~ model(sK38(X1),not(X1))
| ~ model(sK37(X0),X0)
| status(X0,X1,uns) )
& ( ~ status(X0,X1,uns)
| ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK37,sK38]),skolemize(X4,sK37(X0)),skolemize(X5,sK38(X1))],[f112]) ).
fof(f118,plain,
! [X0,X1] :
( ( status(sK41(X0,X1),sK42(X0,X1),X0)
& status(sK41(X0,X1),sK42(X0,X1),X1) )
| nevera(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41,sK42]),skolemize(X2,sK41(X0,X1)),skolemize(X3,sK42(X0,X1))],[f46]) ).
fof(f120,plain,
! [X0,X1] :
( ( ~ model(X0,X1)
| ~ model(X0,not(X1)) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f193,plain,
! [X3,X0,X1] :
( ~ status(X0,X1,uns)
| model(X3,not(X1)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,uns)
| model(X2,X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f200,plain,
! [X0,X1] :
( status(sK41(X0,X1),sK42(X0,X1),X0)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f201,plain,
! [X0,X1] :
( status(sK41(X0,X1),sK42(X0,X1),X1)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f204,plain,
! [X0,X1] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f120]) ).
fof(f221,plain,
~ nevera(uns,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,[],[f142]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X0)
| ~ status(X0,X1,uns) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,not(X1))
| ~ status(X0,X1,uns) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] :
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_143,negated_conjecture,
~ nevera(uns,thm),
inference(cnf_transformation,[],[f221]) ).
tcf(c_379,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_381,plain,
! [X0: $i,X1: $i] :
( status(sK41(X0,X1),sK42(X0,X1),X1)
| nevera(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
tcf(c_382,plain,
! [X0: $i,X1: $i] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(renaming,[status(thm)],[c_381]) ).
tcf(c_985,plain,
status(sK41(uns,thm),sK42(uns,thm),uns),
inference(resolution,[status(thm)],[c_379,c_143]) ).
tcf(c_989,plain,
status(sK41(uns,thm),sK42(uns,thm),thm),
inference(resolution,[status(thm)],[c_382,c_143]) ).
tcf(c_1760,definition,
iPr_def_10 = sK41(uns,thm),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1761,definition,
iPr_def_11 = sK42(uns,thm),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1762,plain,
status(iPr_def_10,iPr_def_11,thm),
inference(demodulation,[status(thm)],[c_989,c_1761,c_1760]) ).
tcf(c_1763,plain,
status(iPr_def_10,iPr_def_11,uns),
inference(demodulation,[status(thm)],[c_985]) ).
tcf(c_3470,plain,
! [X0: $i] :
( model(X0,iPr_def_11)
| ~ model(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1762,c_62]) ).
tcf(c_3598,plain,
! [X0: $i] : model(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_1763,c_114]) ).
tcf(c_3599,plain,
! [X0: $i] : model(X0,iPr_def_11),
inference(backward_subsumption_resolution,[status(thm)],[c_3470,c_3598]) ).
tcf(c_3694,plain,
! [X0: $i] : model(X0,not(iPr_def_11)),
inference(superposition,[status(thm)],[c_1763,c_115]) ).
tcf(c_3896,plain,
! [X0: $i] : ~ model(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_3694,c_127]) ).
tcf(c_3898,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3896,c_3599]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS234+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.42 % Computer : n006.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Wed Sep 23 19:46:14 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.23/0.51
% 0.23/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.51
% 0.23/0.51 % Detected problem language: tptp
% 0.23/0.52 % Proving...
% 3.91/1.41 % SZS status Started for theBenchmark.p
% 3.91/1.41 % SZS status Theorem for theBenchmark.p
% 3.91/1.41
% 3.91/1.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.91/1.41
% 3.91/1.41 % ------ iProver source info
% 3.91/1.41
% 3.91/1.41 % git: date: 2026-07-19 20:42:38 +0200
% 3.91/1.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.91/1.41 % git: non_committed_changes: false
% 3.91/1.41
% 3.91/1.41 % ------ Parsing...
% 3.91/1.41 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.91/1.41
% 3.91/1.41 % ------ 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.91/1.41
% 3.91/1.41 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.91/1.41
% 3.91/1.41 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.91/1.41 % ------ Proving...
% 3.91/1.41 % ------ Problem Properties
% 3.91/1.41
% 3.91/1.41 %
% 3.91/1.41 % clauses 94
% 3.91/1.41 % conjectures 0
% 3.91/1.41 % EPR 40
% 3.91/1.41 % Horn 75
% 3.91/1.41 % unary 17
% 3.91/1.41 % binary 46
% 3.91/1.41 % lits 222
% 3.91/1.41 % lits eq 2
% 3.91/1.41 % fd_pure 0
% 3.91/1.41 % fd_pseudo 0
% 3.91/1.41 % fd_cond 0
% 3.91/1.41 % fd_pseudo_cond 0
% 3.91/1.41 % AC symbols 0
% 3.91/1.41
% 3.91/1.41 % ------ Schedule dynamic 5 is on
% 3.91/1.41
% 3.91/1.41 % ------ no conjectures: strip conj schedule
% 3.91/1.41
% 3.91/1.41 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.91/1.41
% 3.91/1.41
% 3.91/1.41 % ------
% 3.91/1.41 % Current options:
% 3.91/1.41 % ------
% 3.91/1.41
% 3.91/1.41
% 3.91/1.41 %
% 3.91/1.41
% 3.91/1.41 % ------ Proving...
% 3.91/1.41 %
% 3.91/1.41
% 3.91/1.41 % SZS status Theorem for theBenchmark.p
% 3.91/1.41
% 3.91/1.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.91/1.41
% 3.91/1.41
%------------------------------------------------------------------------------