%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU189+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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 02:55:49 PM UTC 2026
% Result : Theorem 0.72s 1.29s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 95 ( 64 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 91 ( 36 ~; 35 |; 12 &)
% ( 2 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 13 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f69,axiom,
! [X0] :
( empty(X0)
=> ( relation(relation_rng(X0))
& empty(relation_rng(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc8_relat_1) ).
fof(f153,axiom,
( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).
fof(f156,axiom,
! [X0] :
( relation(X0)
=> ( ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
=> X0 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_relat_1) ).
fof(f157,conjecture,
! [X0] :
( relation(X0)
=> ( relation_dom(X0) = empty_set
<=> relation_rng(X0) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_relat_1) ).
fof(f158,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( relation_dom(X0) = empty_set
<=> relation_rng(X0) = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f157]) ).
fof(f220,plain,
! [X0] :
( ~ empty(X0)
| ( relation(relation_rng(X0))
& empty(relation_rng(X0)) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f295,plain,
! [X0] :
( ~ relation(X0)
| ( empty_set != relation_rng(X0)
& empty_set != relation_dom(X0) )
| X0 = empty_set ),
inference(ennf_transformation,[],[f156]) ).
fof(f296,plain,
! [X0] :
( ~ relation(X0)
| ( empty_set != relation_rng(X0)
& empty_set != relation_dom(X0) )
| X0 = empty_set ),
inference(flattening,[],[f295]) ).
fof(f297,plain,
? [X0] :
( relation(X0)
& ( relation_dom(X0) = empty_set
<~> relation_rng(X0) = empty_set ) ),
inference(ennf_transformation,[],[f158]) ).
fof(f399,plain,
? [X0] :
( relation(X0)
& ( relation_dom(X0) = empty_set
| relation_rng(X0) = empty_set )
& ( empty_set != relation_dom(X0)
| empty_set != relation_rng(X0) ) ),
inference(nnf_transformation,[],[f297]) ).
fof(f400,plain,
? [X0] :
( relation(X0)
& ( relation_dom(X0) = empty_set
| relation_rng(X0) = empty_set )
& ( empty_set != relation_dom(X0)
| empty_set != relation_rng(X0) ) ),
inference(flattening,[],[f399]) ).
fof(f401,plain,
( relation(sK49)
& ( empty_set = relation_dom(sK49)
| empty_set = relation_rng(sK49) )
& ( empty_set != relation_dom(sK49)
| empty_set != relation_rng(sK49) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK49]),skolemize(X0,sK49)],[f400]) ).
fof(f535,plain,
! [X0] :
( ~ empty(X0)
| empty(relation_rng(X0)) ),
inference(cnf_transformation,[],[f220]) ).
fof(f652,plain,
empty_set = relation_rng(empty_set),
inference(cnf_transformation,[],[f153]) ).
fof(f653,plain,
empty_set = relation_dom(empty_set),
inference(cnf_transformation,[],[f153]) ).
fof(f656,plain,
! [X0] :
( ~ relation(X0)
| empty_set != relation_rng(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f296]) ).
fof(f657,plain,
! [X0] :
( ~ relation(X0)
| empty_set != relation_dom(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f296]) ).
fof(f658,plain,
relation(sK49),
inference(cnf_transformation,[],[f401]) ).
fof(f659,plain,
( empty_set = relation_dom(sK49)
| empty_set = relation_rng(sK49) ),
inference(cnf_transformation,[],[f401]) ).
fof(f660,plain,
( empty_set != relation_dom(sK49)
| empty_set != relation_rng(sK49) ),
inference(cnf_transformation,[],[f401]) ).
tcf(c_177,plain,
! [X0: $i] :
( empty(relation_rng(X0))
| ~ empty(X0) ),
inference(cnf_transformation,[],[f535]) ).
tcf(c_294,plain,
relation_dom(empty_set) = empty_set,
inference(cnf_transformation,[],[f653]) ).
tcf(c_295,plain,
relation_rng(empty_set) = empty_set,
inference(cnf_transformation,[],[f652]) ).
tcf(c_298,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ~ relation(X0)
| ( relation_dom(X0) != empty_set ) ),
inference(cnf_transformation,[],[f657]) ).
tcf(c_299,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ~ relation(X0)
| ( relation_rng(X0) != empty_set ) ),
inference(cnf_transformation,[],[f656]) ).
tcf(c_300,negated_conjecture,
( ( relation_rng(sK49) != empty_set )
| ( relation_dom(sK49) != empty_set ) ),
inference(cnf_transformation,[],[f660]) ).
tcf(c_301,negated_conjecture,
( ( relation_rng(sK49) = empty_set )
| ( relation_dom(sK49) = empty_set ) ),
inference(cnf_transformation,[],[f659]) ).
tcf(c_302,negated_conjecture,
relation(sK49),
inference(cnf_transformation,[],[f658]) ).
tcf(c_453,plain,
( ( empty_set = sK49 )
| ( relation_dom(sK49) = empty_set )
| ~ relation(sK49) ),
inference(superposition,[status(thm)],[c_301,c_299]) ).
tcf(c_588,plain,
( ( empty_set = sK49 )
| ( relation_dom(sK49) = empty_set ) ),
inference(global_subsumption_just,[status(thm)],[c_453,c_302,c_453]) ).
tcf(c_596,plain,
( ( empty_set = sK49 )
| ~ relation(sK49) ),
inference(superposition,[status(thm)],[c_588,c_298]) ).
tcf(c_652,plain,
( empty(empty_set)
| ( relation_dom(sK49) = empty_set )
| ~ empty(sK49) ),
inference(superposition,[status(thm)],[c_301,c_177]) ).
tcf(c_712,plain,
( ( empty_set = sK49 )
| ( relation_dom(sK49) = empty_set )
| ~ relation(sK49) ),
inference(superposition,[status(thm)],[c_301,c_299]) ).
tcf(c_1020,plain,
empty_set = sK49,
inference(global_subsumption_just,[status(thm)],[c_596,c_302,c_596]) ).
tcf(c_1024,plain,
( ( relation_rng(sK49) != empty_set )
| ( relation_dom(empty_set) != empty_set ) ),
inference(superposition,[status(thm)],[c_1020,c_300]) ).
tcf(c_1104,plain,
relation_dom(sK49) = empty_set,
inference(global_subsumption_just,[status(thm)],[c_652,c_294,c_301,c_1024]) ).
tcf(c_1112,plain,
relation_rng(sK49) != empty_set,
inference(superposition,[status(thm)],[c_1104,c_300]) ).
tcf(c_1169,plain,
empty_set = sK49,
inference(global_subsumption_just,[status(thm)],[c_712,c_302,c_596]) ).
tcf(c_1715,plain,
empty_set != empty_set,
inference(light_normalisation,[status(thm)],[c_1112,c_295,c_1169]) ).
tcf(c_1716,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1715]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU189+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 13:04:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 0.72/1.29 % SZS status Started for theBenchmark.p
% 0.72/1.29 % SZS status Theorem for theBenchmark.p
% 0.72/1.29
% 0.72/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.72/1.29
% 0.72/1.29 % ------ iProver source info
% 0.72/1.29
% 0.72/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.72/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.72/1.29 % git: non_committed_changes: false
% 0.72/1.29
% 0.72/1.29 % ------ Parsing...
% 0.72/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.72/1.29 % ------ Proving...
% 0.72/1.29 % ------ Problem Properties
% 0.72/1.29
% 0.72/1.29 %
% 0.72/1.29 % clauses 272
% 0.72/1.29 % conjectures 3
% 0.72/1.29 % EPR 37
% 0.72/1.29 % Horn 217
% 0.72/1.29 % unary 55
% 0.72/1.29 % binary 101
% 0.72/1.29 % lits 661
% 0.72/1.29 % lits eq 144
% 0.72/1.29 % fd_pure 0
% 0.72/1.29 % fd_pseudo 0
% 0.72/1.29 % fd_cond 13
% 0.72/1.29 % fd_pseudo_cond 51
% 0.72/1.29 % AC symbols 0
% 0.72/1.29
% 0.72/1.29 % ------ Input Options Time Limit: Unbounded
% 0.72/1.29
% 0.72/1.29
% 0.72/1.29 % ------
% 0.72/1.29 % Current options:
% 0.72/1.29 % ------
% 0.72/1.29
% 0.72/1.29
% 0.72/1.29 %
% 0.72/1.29
% 0.72/1.29 % ------ Proving...
% 0.72/1.29 %
% 0.72/1.29
% 0.72/1.29 % SZS status Theorem for theBenchmark.p
% 0.72/1.29
% 0.72/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.72/1.30
% 0.72/1.30
%------------------------------------------------------------------------------