%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS180+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 : n004.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 1.23s 11.50s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 127 ( 50 ~; 47 |; 13 &)
% ( 4 <=>; 10 =>; 0 <=; 3 <~>)
% Maximal formula depth : 11 ( 6 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 : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn 102 !; 14 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(f4,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(f5,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) )
<=> xora(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',xora) ).
fof(f14,conjecture,
! [X0,X1] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( ( xora(X0,X1)
| nevera(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_exclusive) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( ( xora(X0,X1)
| nevera(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( xora(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f17,plain,
! [X0,X1] :
( nevera(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f18,plain,
! [X0,X1] :
( nota(X0,X1)
=> ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f20,plain,
! [X0,X1] :
( ~ isa(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X0)
| status(X2,X3,X1) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
! [X0,X1] :
( ~ nevera(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f23,plain,
! [X0,X1] :
( ~ xora(X0,X1)
| ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
? [X0,X1] :
! [X2,X3] :
( status(X2,X3,X0)
& ( xora(X0,X1)
| nevera(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f26,plain,
? [X0,X1] :
! [X2,X3] :
( status(X2,X3,X0)
& ( xora(X0,X1)
| nevera(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [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))],[f21]) ).
fof(f28,plain,
! [X0,X1] :
( ~ xora(X0,X1)
| ! [X2,X3] :
( ( status(X2,X3,X0)
| status(X2,X3,X1) )
& ( ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f37,plain,
! [X2,X3] :
( status(X2,X3,sK20)
& ( xora(sK20,sK21)
| nevera(sK20,sK21)
| nota(sK20,sK21) )
& isa(sK20,sK21) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21]),skolemize(X0,sK20),skolemize(X1,sK21)],[f26]) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( ~ isa(X0,X1)
| ~ status(X2,X3,X0)
| status(X2,X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f39,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( ~ nevera(X0,X1)
| ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ xora(X0,X1)
| ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f63,plain,
! [X2,X3] : status(X2,X3,sK20),
inference(cnf_transformation,[],[f37]) ).
fof(f64,plain,
( xora(sK20,sK21)
| nevera(sK20,sK21)
| nota(sK20,sK21) ),
inference(cnf_transformation,[],[f37]) ).
fof(f65,plain,
isa(sK20,sK21),
inference(cnf_transformation,[],[f37]) ).
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,[],[f38]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ nevera(X3,X2)
| ~ status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ xora(X3,X2)
| ~ status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_74,negated_conjecture,
isa(sK20,sK21),
inference(cnf_transformation,[],[f65]) ).
tcf(c_75,negated_conjecture,
( xora(sK20,sK21)
| nevera(sK20,sK21)
| nota(sK20,sK21) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_76,negated_conjecture,
! [X0: $i,X1: $i] : status(X0,X1,sK20),
inference(cnf_transformation,[],[f63]) ).
tcf(c_93,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_94,plain,
! [X0: $i,X1: $i] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(renaming,[status(thm)],[c_93]) ).
tcf(c_231,plain,
! [X0: $i,X1: $i] :
( status(X0,X1,sK21)
| ~ status(X0,X1,sK20) ),
inference(resolution,[status(thm)],[c_49,c_74]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i] : status(X0,X1,sK21),
inference(global_subsumption_just,[status(thm)],[c_231,c_76,c_231]) ).
tcf(c_240,plain,
! [X0: $i,X1: $i] :
( xora(sK20,sK21)
| nota(sK20,sK21)
| ~ status(X0,X1,sK21)
| ~ status(X0,X1,sK20) ),
inference(resolution,[status(thm)],[c_52,c_75]) ).
tcf(c_242,plain,
( xora(sK20,sK21)
| nota(sK20,sK21) ),
inference(global_subsumption_just,[status(thm)],[c_240,c_76,c_231,c_240]) ).
tcf(c_252,plain,
( xora(sK20,sK21)
| ~ status(sK0(sK20,sK21),sK1(sK20,sK21),sK21) ),
inference(resolution,[status(thm)],[c_94,c_242]) ).
tcf(c_257,plain,
xora(sK20,sK21),
inference(forward_subsumption_resolution,[status(thm)],[c_252,c_233]) ).
tcf(c_261,plain,
! [X0: $i,X1: $i] :
( ~ status(X0,X1,sK21)
| ~ status(X0,X1,sK20) ),
inference(resolution,[status(thm)],[c_53,c_257]) ).
tcf(c_262,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_261,c_231,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS180+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.10/10.59 % Computer : n004.cluster.edu
% 0.10/10.59 % Model : x86_64 x86_64
% 0.10/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59 % Memory : 8046.5625MB
% 0.10/10.59 % OS : Linux 6.8.0-71-generic
% 0.10/10.59 % CPULimit : 300
% 0.10/10.59 % WCLimit : 300
% 0.10/10.59 % DateTime : Wed Sep 23 19:36:48 UTC 2026
% 0.10/10.59 % CPUTime :
% 0.10/10.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.63 Running first-order theorem proving
% 0.14/10.63 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.14/10.64
% 0.14/10.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.64
% 0.14/10.65 % Detected problem language: tptp
% 0.14/10.66 % Proving...
% 1.23/11.50 % SZS status Started for theBenchmark.p
% 1.23/11.50 % SZS status Theorem for theBenchmark.p
% 1.23/11.50
% 1.23/11.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.23/11.50
% 1.23/11.50 % ------ iProver source info
% 1.23/11.50
% 1.23/11.50 % git: date: 2026-07-19 20:42:38 +0200
% 1.23/11.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.23/11.50 % git: non_committed_changes: false
% 1.23/11.50
% 1.23/11.50 % ------ Parsing...
% 1.23/11.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.23/11.50
% 1.23/11.50 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s%
% 1.23/11.50
% 1.23/11.50 % SZS status Theorem for theBenchmark.p
% 1.23/11.50
% 1.23/11.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.23/11.50
% 1.23/11.50
%------------------------------------------------------------------------------