%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS181+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:21 PM UTC 2026
% Result : Theorem 2.14s 1.27s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 41 ~; 33 |; 15 &)
% ( 2 <=>; 5 =>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 67 !; 12 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,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(f3,axiom,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(f14,conjecture,
! [X0,X1,X2] :
( ( nota(X0,X2)
& isa(X0,X1) )
=> nota(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_isa_nota) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( ( nota(X0,X2)
& isa(X0,X1) )
=> nota(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f17,plain,
! [X0,X1] :
( ~ isa(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X0)
| status(X2,X3,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f19,plain,
? [X0,X1,X2] :
( nota(X0,X2)
& isa(X0,X1)
& ~ nota(X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
? [X0,X1,X2] :
( nota(X0,X2)
& isa(X0,X1)
& ~ nota(X1,X2) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| nota(X0,X1) )
& ( ~ nota(X0,X1)
| ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X4,X5] :
( status(X4,X5,X1)
| ~ status(X4,X5,X0) )
| nota(X0,X1) )
& ( ~ nota(X0,X1)
| ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( ! [X4,X5] :
( status(X4,X5,X1)
| ~ status(X4,X5,X0) )
| nota(X0,X1) )
& ( ~ nota(X0,X1)
| ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
& status(sK0(X0,X1),sK1(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0,X1))],[f22]) ).
fof(f32,plain,
( nota(sK20,sK22)
& isa(sK20,sK21)
& ~ nota(sK21,sK22) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22)],[f20]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( ~ isa(X0,X1)
| ~ status(X2,X3,X0)
| status(X2,X3,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X0,X1,X4,X5] :
( status(X4,X5,X1)
| ~ status(X4,X5,X0)
| nota(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| status(sK0(X0,X1),sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f56,plain,
nota(sK20,sK22),
inference(cnf_transformation,[],[f32]) ).
fof(f57,plain,
isa(sK20,sK21),
inference(cnf_transformation,[],[f32]) ).
fof(f58,plain,
~ nota(sK21,sK22),
inference(cnf_transformation,[],[f32]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( status(X0,X1,X3)
| ~ isa(X2,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( status(sK0(X0,X1),sK1(X0,X1),X0)
| ~ nota(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( nota(X2,X3)
| status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_72,negated_conjecture,
~ nota(sK21,sK22),
inference(cnf_transformation,[],[f58]) ).
tcf(c_73,negated_conjecture,
isa(sK20,sK21),
inference(cnf_transformation,[],[f57]) ).
tcf(c_74,negated_conjecture,
nota(sK20,sK22),
inference(cnf_transformation,[],[f56]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( status(sK0(X0,X1),sK1(X0,X1),X0)
| ~ nota(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
| ~ nota(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(renaming,[status(thm)],[c_88]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,sK21)
| ~ status(X0,X1,sK20) ),
inference(resolution,[status(thm)],[c_49,c_73]) ).
tcf(c_233,plain,
~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK22),
inference(resolution,[status(thm)],[c_89,c_74]) ).
tcf(c_237,plain,
status(sK0(sK20,sK22),sK1(sK20,sK22),sK20),
inference(resolution,[status(thm)],[c_86,c_74]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,sK21)
| ~ status(X0,X1,sK20) ),
inference(prop_impl_just,[status(thm)],[c_203]) ).
tcf(c_441,plain,
( status(sK0(sK20,sK22),sK1(sK20,sK22),sK21)
| ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK20) ),
inference(instantiation,[status(thm)],[c_279]) ).
tcf(c_462,plain,
! [X0: $i] :
( nota(sK21,X0)
| status(sK0(sK20,sK22),sK1(sK20,sK22),X0)
| ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK21) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_495,plain,
( nota(sK21,sK22)
| status(sK0(sK20,sK22),sK1(sK20,sK22),sK22)
| ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK21) ),
inference(instantiation,[status(thm)],[c_462]) ).
tcf(c_496,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_495,c_441,c_237,c_233,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS181+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.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 19:36:41 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 2.14/1.27 % SZS status Started for theBenchmark.p
% 2.14/1.27 % SZS status Theorem for theBenchmark.p
% 2.14/1.27
% 2.14/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.14/1.27
% 2.14/1.27 % ------ iProver source info
% 2.14/1.27
% 2.14/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.14/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.14/1.27 % git: non_committed_changes: false
% 2.14/1.27
% 2.14/1.27 % ------ Parsing...
% 2.14/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.14/1.27
% 2.14/1.27 % ------ 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.14/1.27
% 2.14/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.14/1.27 % ------ Proving...
% 2.14/1.27 % ------ Problem Properties
% 2.14/1.27
% 2.14/1.27 %
% 2.14/1.27 % clauses 23
% 2.14/1.27 % conjectures 2
% 2.14/1.27 % EPR 19
% 2.14/1.27 % Horn 21
% 2.14/1.27 % unary 15
% 2.14/1.27 % binary 7
% 2.14/1.27 % lits 32
% 2.14/1.27 % lits eq 0
% 2.14/1.27 % fd_pure 0
% 2.14/1.27 % fd_pseudo 0
% 2.14/1.27 % fd_cond 0
% 2.14/1.27 % fd_pseudo_cond 0
% 2.14/1.27 % AC symbols 0
% 2.14/1.27
% 2.14/1.27 % ------ Schedule dynamic 5 is on
% 2.14/1.27
% 2.14/1.27 % ------ no equalities: superposition off
% 2.14/1.27
% 2.14/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.14/1.27
% 2.14/1.27
% 2.14/1.27 % ------
% 2.14/1.27 % Current options:
% 2.14/1.27 % ------
% 2.14/1.27
% 2.14/1.27
% 2.14/1.27 %
% 2.14/1.27
% 2.14/1.27 % ------ Proving...
% 2.14/1.27 %
% 2.14/1.27
% 2.14/1.27 % SZS status Theorem for theBenchmark.p
% 2.14/1.27
% 2.14/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.14/1.27
% 2.14/1.27
%------------------------------------------------------------------------------