%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU188+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 : 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 02:55:49 PM UTC 2026
% Result : Theorem 5.07s 1.79s
% Output : CNFRefutation 5.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 16 unt; 2 def)
% Number of atoms : 117 ( 38 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 91 ( 38 ~; 37 |; 9 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 17 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f64,axiom,
( relation(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(f66,axiom,
! [X0] :
( ( relation(X0)
& ~ empty(X0) )
=> ~ empty(relation_dom(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_relat_1) ).
fof(f67,axiom,
! [X0] :
( ( relation(X0)
& ~ empty(X0) )
=> ~ empty(relation_rng(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_relat_1) ).
fof(f156,conjecture,
! [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,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
=> X0 = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f156]) ).
fof(f160,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f214,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_dom(X0)) ),
inference(ennf_transformation,[],[f66]) ).
fof(f215,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_dom(X0)) ),
inference(flattening,[],[f214]) ).
fof(f216,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_rng(X0)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f217,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_rng(X0)) ),
inference(flattening,[],[f216]) ).
fof(f294,plain,
? [X0] :
( relation(X0)
& ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
& empty_set != X0 ),
inference(ennf_transformation,[],[f157]) ).
fof(f295,plain,
? [X0] :
( relation(X0)
& ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
& empty_set != X0 ),
inference(flattening,[],[f294]) ).
fof(f296,plain,
! [X0] :
( ~ empty(X0)
| X0 = empty_set ),
inference(ennf_transformation,[],[f160]) ).
fof(f397,plain,
( relation(sK49)
& ( empty_set = relation_rng(sK49)
| empty_set = relation_dom(sK49) )
& empty_set != sK49 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK49]),skolemize(X0,sK49)],[f295]) ).
fof(f524,plain,
empty(empty_set),
inference(cnf_transformation,[],[f64]) ).
fof(f526,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_dom(X0)) ),
inference(cnf_transformation,[],[f215]) ).
fof(f527,plain,
! [X0] :
( ~ relation(X0)
| empty(X0)
| ~ empty(relation_rng(X0)) ),
inference(cnf_transformation,[],[f217]) ).
fof(f652,plain,
relation(sK49),
inference(cnf_transformation,[],[f397]) ).
fof(f653,plain,
( empty_set = relation_rng(sK49)
| empty_set = relation_dom(sK49) ),
inference(cnf_transformation,[],[f397]) ).
fof(f654,plain,
empty_set != sK49,
inference(cnf_transformation,[],[f397]) ).
fof(f658,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f296]) ).
tcf(c_170,plain,
empty(empty_set),
inference(cnf_transformation,[],[f524]) ).
tcf(c_173,plain,
! [X0: $i] :
( empty(X0)
| ~ relation(X0)
| ~ empty(relation_dom(X0)) ),
inference(cnf_transformation,[],[f526]) ).
tcf(c_174,plain,
! [X0: $i] :
( empty(X0)
| ~ relation(X0)
| ~ empty(relation_rng(X0)) ),
inference(cnf_transformation,[],[f527]) ).
tcf(c_298,negated_conjecture,
empty_set != sK49,
inference(cnf_transformation,[],[f654]) ).
tcf(c_299,negated_conjecture,
( ( relation_rng(sK49) = empty_set )
| ( relation_dom(sK49) = empty_set ) ),
inference(cnf_transformation,[],[f653]) ).
tcf(c_300,negated_conjecture,
relation(sK49),
inference(cnf_transformation,[],[f652]) ).
tcf(c_303,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ~ empty(X0) ),
inference(cnf_transformation,[],[f658]) ).
tcf(c_6582,definition,
iPr_def_10 = relation_dom(sK49),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_6583,definition,
iPr_def_11 = relation_rng(sK49),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_6584,negated_conjecture,
relation(sK49),
inference(demodulation,[status(thm)],[c_300]) ).
tcf(c_6585,negated_conjecture,
( ( iPr_def_11 = empty_set )
| ( iPr_def_10 = empty_set ) ),
inference(demodulation,[status(thm)],[c_299,c_6583,c_6582]) ).
tcf(c_6586,negated_conjecture,
empty_set != sK49,
inference(demodulation,[status(thm)],[c_298]) ).
tcf(c_10741,plain,
( empty(iPr_def_11)
| ( empty_set = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_6585,c_170]) ).
tcf(c_11954,plain,
( empty(sK49)
| ~ empty(iPr_def_10)
| ~ relation(sK49) ),
inference(superposition,[status(thm)],[c_6582,c_173]) ).
tcf(c_11957,plain,
( empty(sK49)
| ~ empty(iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11954,c_6584]) ).
tcf(c_11968,plain,
( empty(sK49)
| ~ empty(iPr_def_11)
| ~ relation(sK49) ),
inference(superposition,[status(thm)],[c_6583,c_174]) ).
tcf(c_11970,plain,
( empty(sK49)
| ~ empty(iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11968,c_6584]) ).
tcf(c_12007,plain,
( empty(sK49)
| ( empty_set = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_10741,c_11970]) ).
tcf(c_12020,plain,
( ( empty_set = iPr_def_10 )
| ( empty_set = sK49 ) ),
inference(superposition,[status(thm)],[c_12007,c_303]) ).
tcf(c_12030,plain,
empty_set = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_12020,c_6586]) ).
tcf(c_12047,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ~ empty(X0) ),
inference(demodulation,[status(thm)],[c_303,c_12030]) ).
tcf(c_12060,plain,
empty(iPr_def_10),
inference(demodulation,[status(thm)],[c_170,c_12030]) ).
tcf(c_12062,plain,
sK49 != iPr_def_10,
inference(demodulation,[status(thm)],[c_6586,c_12030]) ).
tcf(c_12063,plain,
empty(sK49),
inference(backward_subsumption_resolution,[status(thm)],[c_11957,c_12060]) ).
tcf(c_12477,plain,
sK49 = iPr_def_10,
inference(superposition,[status(thm)],[c_12063,c_12047]) ).
tcf(c_12479,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12477,c_12062]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU188+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n004.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:06:36 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.42 Running first-order theorem proving
% 0.11/0.42 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.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 5.07/1.79 % SZS status Started for theBenchmark.p
% 5.07/1.79 % SZS status Theorem for theBenchmark.p
% 5.07/1.79
% 5.07/1.79 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.07/1.79
% 5.07/1.79 % ------ iProver source info
% 5.07/1.79
% 5.07/1.79 % git: date: 2026-07-19 20:42:38 +0200
% 5.07/1.79 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.07/1.79 % git: non_committed_changes: false
% 5.07/1.79
% 5.07/1.79 % ------ Parsing...
% 5.07/1.79 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.07/1.79
% 5.07/1.79 % ------ Preprocessing... sup_sim: 21 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 5.07/1.79
% 5.07/1.79 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 5.07/1.79
% 5.07/1.79 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 5.07/1.79 % ------ Proving...
% 5.07/1.79 % ------ Problem Properties
% 5.07/1.79
% 5.07/1.79 %
% 5.07/1.79 % clauses 240
% 5.07/1.79 % conjectures 3
% 5.07/1.79 % EPR 36
% 5.07/1.79 % Horn 188
% 5.07/1.79 % unary 45
% 5.07/1.79 % binary 89
% 5.07/1.79 % lits 590
% 5.07/1.79 % lits eq 133
% 5.07/1.79 % fd_pure 0
% 5.07/1.79 % fd_pseudo 0
% 5.07/1.79 % fd_cond 11
% 5.07/1.79 % fd_pseudo_cond 50
% 5.07/1.79 % AC symbols 0
% 5.07/1.79
% 5.07/1.79 % ------ Schedule dynamic 5 is on
% 5.07/1.79
% 5.07/1.79 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 5.07/1.79
% 5.07/1.79
% 5.07/1.79 % ------
% 5.07/1.79 % Current options:
% 5.07/1.79 % ------
% 5.07/1.79
% 5.07/1.79
% 5.07/1.79 %
% 5.07/1.79
% 5.07/1.79 % ------ Proving...
% 5.07/1.79 %
% 5.07/1.79
% 5.07/1.79 % SZS status Theorem for theBenchmark.p
% 5.07/1.79
% 5.07/1.79 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.07/1.79
% 5.07/1.79
%------------------------------------------------------------------------------