%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS190+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 : 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:22 PM UTC 2026
% Result : Theorem 1.93s 1.38s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 14 unt; 2 def)
% Number of atoms : 99 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 34 ~; 31 |; 15 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 63 !; 6 ?; 15 :)
% 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(f10,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X1)
& model(X2,X0) )
<=> status(X0,X1,tau) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',tau) ).
fof(f21,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(f33,conjecture,
isa(tau,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_tau_thm) ).
fof(f34,negated_conjecture,
~ isa(tau,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ isa(tau,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
=> isa(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
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) )
| isa(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(f81,plain,
! [X0,X1] :
( ( ? [X2] :
( ~ model(X2,X1)
| ~ model(X2,X0) )
| status(X0,X1,tau) )
& ( ~ status(X0,X1,tau)
| ! [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f82,plain,
! [X0,X1] :
( ( ? [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) )
| status(X0,X1,tau) )
& ( ~ status(X0,X1,tau)
| ! [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ),
inference(rectify,[],[f81]) ).
fof(f83,plain,
! [X0,X1] :
( ( ~ model(sK20(X0,X1),X1)
| ~ model(sK20(X0,X1),X0)
| status(X0,X1,tau) )
& ( ~ status(X0,X1,tau)
| ! [X2] :
( model(X2,X1)
& model(X2,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X3,sK20(X0,X1))],[f82]) ).
fof(f118,plain,
! [X0,X1] :
( ( status(sK41(X0,X1),sK42(X0,X1),X0)
& ~ status(sK41(X0,X1),sK42(X0,X1),X1) )
| isa(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41,sK42]),skolemize(X2,sK41(X0,X1)),skolemize(X3,sK42(X0,X1))],[f46]) ).
fof(f141,plain,
! [X0,X1] :
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f64]) ).
fof(f164,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,tau)
| model(X2,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f200,plain,
! [X0,X1] :
( status(sK41(X0,X1),sK42(X0,X1),X0)
| isa(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f201,plain,
! [X0,X1] :
( ~ status(sK41(X0,X1),sK42(X0,X1),X1)
| isa(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f221,plain,
~ isa(tau,thm),
inference(cnf_transformation,[],[f35]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] :
( model(X2,X1)
| ~ status(X0,X1,tau) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( isa(X0,X1)
| ~ status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( isa(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_143,negated_conjecture,
~ isa(tau,thm),
inference(cnf_transformation,[],[f221]) ).
tcf(c_326,plain,
! [X0: $i,X1: $i] :
( isa(X0,X1)
| ~ status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
tcf(c_382,plain,
! [X0: $i,X1: $i] :
( isa(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_986,plain,
status(sK41(tau,thm),sK42(tau,thm),tau),
inference(resolution,[status(thm)],[c_382,c_143]) ).
tcf(c_990,plain,
~ status(sK41(tau,thm),sK42(tau,thm),thm),
inference(resolution,[status(thm)],[c_326,c_143]) ).
tcf(c_1761,definition,
iPr_def_10 = sK41(tau,thm),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1762,definition,
iPr_def_11 = sK42(tau,thm),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1763,plain,
~ status(iPr_def_10,iPr_def_11,thm),
inference(demodulation,[status(thm)],[c_990,c_1762,c_1761]) ).
tcf(c_1764,plain,
status(iPr_def_10,iPr_def_11,tau),
inference(demodulation,[status(thm)],[c_986]) ).
tcf(c_3546,plain,
! [X0: $i] : model(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_1764,c_86]) ).
tcf(c_3574,plain,
! [X0: $i] : status(X0,iPr_def_11,thm),
inference(superposition,[status(thm)],[c_3546,c_63]) ).
tcf(c_3575,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1763,c_3574]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KRS190+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.16/0.41 % Computer : n016.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Wed Sep 23 19:43:41 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 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.16/0.50
% 0.16/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.50
% 0.16/0.50 % Detected problem language: tptp
% 0.25/0.51 % Proving...
% 1.93/1.38 % SZS status Started for theBenchmark.p
% 1.93/1.38 % SZS status Theorem for theBenchmark.p
% 1.93/1.38
% 1.93/1.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.93/1.38
% 1.93/1.38 % ------ iProver source info
% 1.93/1.38
% 1.93/1.38 % git: date: 2026-07-19 20:42:38 +0200
% 1.93/1.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.93/1.38 % git: non_committed_changes: false
% 1.93/1.38
% 1.93/1.38 % ------ Parsing...
% 1.93/1.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.93/1.38
% 1.93/1.38 % ------ 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.93/1.38
% 1.93/1.38 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.93/1.38
% 1.93/1.38 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.93/1.38 % ------ Proving...
% 1.93/1.38 % ------ Problem Properties
% 1.93/1.38
% 1.93/1.38 %
% 1.93/1.38 % clauses 94
% 1.93/1.38 % conjectures 0
% 1.93/1.38 % EPR 40
% 1.93/1.38 % Horn 75
% 1.93/1.38 % unary 17
% 1.93/1.38 % binary 46
% 1.93/1.38 % lits 222
% 1.93/1.38 % lits eq 2
% 1.93/1.38 % fd_pure 0
% 1.93/1.38 % fd_pseudo 0
% 1.93/1.38 % fd_cond 0
% 1.93/1.38 % fd_pseudo_cond 0
% 1.93/1.38 % AC symbols 0
% 1.93/1.38
% 1.93/1.38 % ------ Schedule dynamic 5 is on
% 1.93/1.38
% 1.93/1.38 % ------ no conjectures: strip conj schedule
% 1.93/1.38
% 1.93/1.38 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.93/1.38
% 1.93/1.38
% 1.93/1.38 % ------
% 1.93/1.38 % Current options:
% 1.93/1.38 % ------
% 1.93/1.38
% 1.93/1.38
% 1.93/1.38 %
% 1.93/1.38
% 1.93/1.38 % ------ Proving...
% 1.93/1.38 %
% 1.93/1.38
% 1.93/1.38 % SZS status Theorem for theBenchmark.p
% 1.93/1.38
% 1.93/1.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.93/1.38
% 1.93/1.38
%------------------------------------------------------------------------------