%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS134+1 : TPTP v9.3.1. Released v3.1.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:14 PM UTC 2026
% Result : Theorem 1.18s 1.27s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 10 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 187 ( 75 ~; 81 |; 19 &)
% ( 4 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn 39 !; 8 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f2,axiom,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f3,axiom,
! [X0,X1] :
( rprop(X0,X1)
=> cA(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,conjecture,
( ! [X0] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f5,negated_conjecture,
~ ( ! [X0] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
~ ( ! [X2] :
( cowlThing(X2)
=> ! [X3] :
( rprop(X2,X3)
=> cA(X3) ) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ~ rprop(X0,X1)
| cA(X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f8,plain,
( ? [X2] :
( cowlThing(X2)
& ? [X3] :
( rprop(X2,X3)
& ~ cA(X3) ) )
| ? [X1] :
( xsd_string(X1)
<~> ~ xsd_integer(X1) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0] :
( ( ~ xsd_string(X0)
| ~ xsd_integer(X0) )
& ( xsd_integer(X0)
| xsd_string(X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f10,plain,
( ? [X2] :
( cowlThing(X2)
& ? [X3] :
( rprop(X2,X3)
& ~ cA(X3) ) )
| ? [X1] :
( ( xsd_string(X1)
| ~ xsd_integer(X1) )
& ( ~ xsd_string(X1)
| xsd_integer(X1) ) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f11,plain,
( ( cowlThing(sK2)
& rprop(sK2,sK3)
& ~ cA(sK3) )
| ( ( xsd_string(sK1)
| ~ xsd_integer(sK1) )
& ( ~ xsd_string(sK1)
| xsd_integer(sK1) ) )
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f10]) ).
fof(f12,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0,X1] :
( ~ rprop(X0,X1)
| cA(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
( rprop(sK2,sK3)
| xsd_string(sK1)
| ~ xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f19,plain,
( ~ cA(sK3)
| xsd_string(sK1)
| ~ xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f21,plain,
( rprop(sK2,sK3)
| ~ xsd_string(sK1)
| xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
( ~ cA(sK3)
| ~ xsd_string(sK1)
| xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_49,plain,
! [X0: $i] : cowlThing(X0),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,plain,
! [X0: $i] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,plain,
! [X0: $i] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_52,plain,
! [X0: $i] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( cA(X1)
| ~ rprop(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_54,negated_conjecture,
( xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cA(sK3)
| ~ xsd_string(sK1)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,negated_conjecture,
( xsd_integer(sK1)
| cowlNothing(sK0)
| rprop(sK2,sK3)
| ~ xsd_string(sK1)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_57,negated_conjecture,
( xsd_string(sK1)
| cowlNothing(sK0)
| ~ cA(sK3)
| ~ xsd_integer(sK1)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_58,negated_conjecture,
( xsd_string(sK1)
| cowlNothing(sK0)
| rprop(sK2,sK3)
| ~ xsd_integer(sK1)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_60,plain,
cowlThing(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_61,plain,
~ cowlNothing(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_69,plain,
( xsd_string(sK1)
| ~ xsd_integer(sK1)
| rprop(sK2,sK3) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_60,c_61,c_58]) ).
tcf(c_70,negated_conjecture,
( xsd_string(sK1)
| rprop(sK2,sK3)
| ~ xsd_integer(sK1) ),
inference(renaming,[status(thm)],[c_69]) ).
tcf(c_71,plain,
( xsd_string(sK1)
| ~ xsd_integer(sK1)
| ~ cA(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_60,c_61,c_57]) ).
tcf(c_72,negated_conjecture,
( xsd_string(sK1)
| ~ cA(sK3)
| ~ xsd_integer(sK1) ),
inference(renaming,[status(thm)],[c_71]) ).
tcf(c_73,plain,
( xsd_integer(sK1)
| ~ xsd_string(sK1)
| rprop(sK2,sK3) ),
inference(global_subsumption_just,[status(thm)],[c_55,c_60,c_61,c_55]) ).
tcf(c_74,negated_conjecture,
( xsd_integer(sK1)
| rprop(sK2,sK3)
| ~ xsd_string(sK1) ),
inference(renaming,[status(thm)],[c_73]) ).
tcf(c_75,plain,
( xsd_integer(sK1)
| ~ xsd_string(sK1)
| ~ cA(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_60,c_61,c_54]) ).
tcf(c_76,negated_conjecture,
( xsd_integer(sK1)
| ~ cA(sK3)
| ~ xsd_string(sK1) ),
inference(renaming,[status(thm)],[c_75]) ).
tcf(c_77,plain,
! [X0: $i] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
tcf(c_78,plain,
! [X0: $i] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(renaming,[status(thm)],[c_77]) ).
tcf(c_79,plain,
! [X0: $i] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
tcf(c_80,plain,
! [X0: $i] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(renaming,[status(thm)],[c_79]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( cA(X1)
| ~ rprop(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
tcf(c_109,plain,
( xsd_integer(sK1)
| rprop(sK2,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_74,c_80]) ).
tcf(c_110,plain,
( xsd_integer(sK1)
| ~ cA(sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_76,c_80]) ).
tcf(c_112,plain,
( xsd_string(sK1)
| rprop(sK2,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_70,c_80]) ).
tcf(c_113,plain,
( xsd_string(sK1)
| ~ cA(sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_72,c_80]) ).
tcf(c_138,plain,
! [X0: $i] :
( xsd_string(sK1)
| ~ rprop(X0,sK3) ),
inference(resolution,[status(thm)],[c_81,c_113]) ).
tcf(c_146,plain,
! [X0: $i] :
( xsd_integer(sK1)
| ~ rprop(X0,sK3) ),
inference(resolution,[status(thm)],[c_81,c_110]) ).
tcf(c_155,plain,
xsd_string(sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_112,c_138]) ).
tcf(c_158,plain,
xsd_integer(sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_109,c_146]) ).
tcf(c_161,plain,
~ xsd_integer(sK1),
inference(resolution,[status(thm)],[c_78,c_155]) ).
tcf(c_162,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_161,c_158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS134+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 19:28:26 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 1.18/1.27 % SZS status Started for theBenchmark.p
% 1.18/1.27 % SZS status Theorem for theBenchmark.p
% 1.18/1.27
% 1.18/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.18/1.27
% 1.18/1.27 % ------ iProver source info
% 1.18/1.27
% 1.18/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.18/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.18/1.27 % git: non_committed_changes: false
% 1.18/1.27
% 1.18/1.27 % ------ Parsing...
% 1.18/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.18/1.27 %
% 1.18/1.27
% 1.18/1.27 % ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s%
% 1.18/1.27
% 1.18/1.27 % SZS status Theorem for theBenchmark.p
% 1.18/1.27
% 1.18/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.18/1.27
% 1.18/1.27
%------------------------------------------------------------------------------