%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS139+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 : n005.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:15 PM UTC 2026
% Result : Theorem 0.26s 1.04s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 183 ( 81 ~; 77 |; 19 &)
% ( 4 <=>; 1 =>; 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 33 ( 0 sgn 29 !; 4 ?; 10 :)
% 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] :
( rpath(X0,X1)
=> rpath(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
cowlThing(iAntwerp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
cowlThing(iGhent),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f6,axiom,
rpath(iGhent,iAntwerp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f7,conjecture,
( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f8,negated_conjecture,
~ ( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
~ ( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(rectify,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ rpath(X0,X1)
| rpath(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ? [X1] :
( xsd_string(X1)
<~> ~ xsd_integer(X1) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0] :
( ( ~ xsd_string(X0)
| ~ xsd_integer(X0) )
& ( xsd_integer(X0)
| xsd_string(X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f13,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ? [X1] :
( ( xsd_string(X1)
| ~ xsd_integer(X1) )
& ( ~ xsd_string(X1)
| xsd_integer(X1) ) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f14,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ( ( 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]),skolemize(X0,sK0),skolemize(X1,sK1)],[f13]) ).
fof(f15,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( ~ rpath(X0,X1)
| rpath(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f20,plain,
cowlThing(iAntwerp),
inference(cnf_transformation,[],[f4]) ).
fof(f21,plain,
cowlThing(iGhent),
inference(cnf_transformation,[],[f5]) ).
fof(f22,plain,
rpath(iGhent,iAntwerp),
inference(cnf_transformation,[],[f6]) ).
fof(f23,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| xsd_string(sK1)
| ~ xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ~ xsd_string(sK1)
| xsd_integer(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_49,plain,
! [X0: $i] : cowlThing(X0),
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,plain,
! [X0: $i] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
! [X0: $i] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,plain,
! [X0: $i] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( rpath(X1,X0)
| ~ rpath(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_54,plain,
cowlThing(iAntwerp),
inference(cnf_transformation,[],[f20]) ).
tcf(c_55,plain,
cowlThing(iGhent),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,plain,
rpath(iGhent,iAntwerp),
inference(cnf_transformation,[],[f22]) ).
tcf(c_57,negated_conjecture,
( xsd_integer(sK1)
| cowlNothing(sK0)
| ~ xsd_string(sK1)
| ~ cowlThing(sK0)
| ~ cowlThing(iGhent)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_58,negated_conjecture,
( xsd_string(sK1)
| cowlNothing(sK0)
| ~ xsd_integer(sK1)
| ~ cowlThing(sK0)
| ~ cowlThing(iGhent)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_62,negated_conjecture,
( xsd_string(sK1)
| cowlNothing(sK0)
| ~ xsd_integer(sK1)
| ~ cowlThing(sK0)
| ~ rpath(iAntwerp,iGhent) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_55,c_54,c_58]) ).
tcf(c_64,negated_conjecture,
( xsd_integer(sK1)
| cowlNothing(sK0)
| ~ xsd_string(sK1)
| ~ cowlThing(sK0)
| ~ rpath(iAntwerp,iGhent) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_55,c_54,c_57]) ).
tcf(c_66,plain,
! [X0: $i] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
tcf(c_67,plain,
! [X0: $i] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(renaming,[status(thm)],[c_66]) ).
tcf(c_68,plain,
! [X0: $i] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
tcf(c_69,plain,
! [X0: $i] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(renaming,[status(thm)],[c_68]) ).
tcf(c_96,plain,
( xsd_integer(sK1)
| cowlNothing(sK0)
| ~ xsd_string(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_49]) ).
tcf(c_97,plain,
( xsd_string(sK1)
| cowlNothing(sK0)
| ~ xsd_integer(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_49]) ).
tcf(c_100,plain,
( xsd_string(sK1)
| ~ xsd_integer(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_50]) ).
tcf(c_101,plain,
( xsd_integer(sK1)
| ~ xsd_string(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_50]) ).
tcf(c_107,plain,
( xsd_integer(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_101,c_69]) ).
tcf(c_109,plain,
( xsd_string(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(backward_subsumption_resolution,[status(thm)],[c_100,c_69]) ).
tcf(c_127,plain,
( ~ xsd_integer(sK1)
| ~ rpath(iAntwerp,iGhent) ),
inference(resolution,[status(thm)],[c_67,c_109]) ).
tcf(c_128,plain,
~ rpath(iAntwerp,iGhent),
inference(global_subsumption_just,[status(thm)],[c_127,c_107,c_127]) ).
tcf(c_143,plain,
rpath(iAntwerp,iGhent),
inference(resolution,[status(thm)],[c_53,c_56]) ).
tcf(c_144,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_143,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS139+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.07/0.35 % Computer : n005.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Wed Sep 23 19:29:17 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 0.26/1.04 % SZS status Started for theBenchmark.p
% 0.26/1.04 % SZS status Theorem for theBenchmark.p
% 0.26/1.04
% 0.26/1.04 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.26/1.04
% 0.26/1.04 % ------ iProver source info
% 0.26/1.04
% 0.26/1.04 % git: date: 2026-07-19 20:42:38 +0200
% 0.26/1.04 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.26/1.04 % git: non_committed_changes: false
% 0.26/1.04
% 0.26/1.04 % ------ Parsing...
% 0.26/1.04 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.26/1.04 %
% 0.26/1.04
% 0.26/1.04 % ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.26/1.04
% 0.26/1.04 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.26/1.04 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.26/1.04 % ------ Proving...
% 0.26/1.04 % ------ Problem Properties
% 0.26/1.04
% 0.26/1.04 %
% 0.26/1.04 % clauses 3
% 0.26/1.04 % conjectures 0
% 0.26/1.04 % EPR 3
% 0.26/1.04 % Horn 3
% 0.26/1.04 % unary 2
% 0.26/1.04 % binary 1
% 0.26/1.04 % lits 4
% 0.26/1.04 % lits eq 0
% 0.26/1.04 % fd_pure 0
% 0.26/1.04 % fd_pseudo 0
% 0.26/1.04 % fd_cond 0
% 0.26/1.04 % fd_pseudo_cond 0
% 0.26/1.04 % AC symbols 0
% 0.26/1.04
% 0.26/1.04 % ------ Schedule EPR Horn non eq is on
% 0.26/1.04
% 0.26/1.04 % ------ no conjectures: strip conj schedule
% 0.26/1.04
% 0.26/1.04 % ------ no equalities: superposition off
% 0.26/1.04
% 0.26/1.04 % ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.26/1.04
% 0.26/1.04
% 0.26/1.04 % ------
% 0.26/1.04 % Current options:
% 0.26/1.04 % ------
% 0.26/1.04
% 0.26/1.04
% 0.26/1.04 %
% 0.26/1.04
% 0.26/1.04 % ------ Proving...
% 0.26/1.04 %
% 0.26/1.04
% 0.26/1.04 % SZS status Theorem for theBenchmark.p
% 0.26/1.04
% 0.26/1.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.26/1.05
% 0.26/1.05
%------------------------------------------------------------------------------