%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU134+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 : n019.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:32 PM UTC 2026
% Result : Theorem 3.18s 1.24s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 4 unt; 0 def)
% Number of atoms : 52 ( 26 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 22 ~; 20 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 20 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f37,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f38,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f68,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f98,plain,
! [X0,X1] :
( ( empty_set != set_difference(X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f103,plain,
? [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| subset(X0,X1) )
& ( empty_set != set_difference(X0,X1)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f104,plain,
( ( empty_set = set_difference(sK8,sK9)
| subset(sK8,sK9) )
& ( empty_set != set_difference(sK8,sK9)
| ~ subset(sK8,sK9) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f103]) ).
fof(f143,plain,
! [X0,X1] :
( empty_set != set_difference(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f144,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f162,plain,
( empty_set = set_difference(sK8,sK9)
| subset(sK8,sK9) ),
inference(cnf_transformation,[],[f104]) ).
fof(f163,plain,
( empty_set != set_difference(sK8,sK9)
| ~ subset(sK8,sK9) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) = empty_set )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ( set_difference(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_104,negated_conjecture,
( ~ subset(sK8,sK9)
| ( set_difference(sK8,sK9) != empty_set ) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_105,negated_conjecture,
( subset(sK8,sK9)
| ( set_difference(sK8,sK9) = empty_set ) ),
inference(cnf_transformation,[],[f162]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) != empty_set )
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_86]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ( set_difference(X0,X1) != empty_set ) ),
inference(renaming,[status(thm)],[c_149]) ).
tcf(c_153,plain,
( ( set_difference(sK8,sK9) != empty_set )
| ~ subset(sK8,sK9) ),
inference(prop_impl_just,[status(thm)],[c_104]) ).
tcf(c_154,plain,
( ~ subset(sK8,sK9)
| ( set_difference(sK8,sK9) != empty_set ) ),
inference(renaming,[status(thm)],[c_153]) ).
tcf(c_155,plain,
( ( set_difference(sK8,sK9) = empty_set )
| subset(sK8,sK9) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
tcf(c_156,plain,
( subset(sK8,sK9)
| ( set_difference(sK8,sK9) = empty_set ) ),
inference(renaming,[status(thm)],[c_155]) ).
tcf(c_434,plain,
subset(sK8,sK9),
inference(forward_subsumption_resolution,[status(thm)],[c_156,c_150]) ).
tcf(c_438,plain,
set_difference(sK8,sK9) != empty_set,
inference(backward_subsumption_resolution,[status(thm)],[c_154,c_434]) ).
tcf(c_3083,plain,
set_difference(sK8,sK9) = empty_set,
inference(superposition,[status(thm)],[c_434,c_85]) ).
tcf(c_3087,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3083,c_438]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU134+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33 % Computer : n019.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Thu Sep 24 12:53:04 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.07/0.34 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.36 Running first-order theorem proving
% 0.11/0.36 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.37
% 0.11/0.37 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.37
% 0.11/0.37 % Detected problem language: tptp
% 0.11/0.39 % Proving...
% 3.18/1.24 % SZS status Started for theBenchmark.p
% 3.18/1.24 % SZS status Theorem for theBenchmark.p
% 3.18/1.24
% 3.18/1.24 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.18/1.24
% 3.18/1.24 % ------ iProver source info
% 3.18/1.24
% 3.18/1.24 % git: date: 2026-07-19 20:42:38 +0200
% 3.18/1.24 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.18/1.24 % git: non_committed_changes: false
% 3.18/1.24
% 3.18/1.24 % ------ Parsing...
% 3.18/1.24 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.18/1.24
% 3.18/1.24 % ------ Preprocessing... sup_sim: 0 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 %
% 3.18/1.24
% 3.18/1.24 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.18/1.24
% 3.18/1.24 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.18/1.24 % ------ Proving...
% 3.18/1.24 % ------ Problem Properties
% 3.18/1.24
% 3.18/1.24 %
% 3.18/1.24 % clauses 68
% 3.18/1.24 % conjectures 0
% 3.18/1.24 % EPR 17
% 3.18/1.24 % Horn 54
% 3.18/1.24 % unary 19
% 3.18/1.24 % binary 28
% 3.18/1.24 % lits 141
% 3.18/1.24 % lits eq 31
% 3.18/1.24 % fd_pure 0
% 3.18/1.24 % fd_pseudo 0
% 3.18/1.24 % fd_cond 3
% 3.18/1.24 % fd_pseudo_cond 13
% 3.18/1.24 % AC symbols 0
% 3.18/1.24
% 3.18/1.24 % ------ Schedule dynamic 5 is on
% 3.18/1.24
% 3.18/1.24 % ------ no conjectures: strip conj schedule
% 3.18/1.24
% 3.18/1.24 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.18/1.24
% 3.18/1.24
% 3.18/1.24 % ------
% 3.18/1.24 % Current options:
% 3.18/1.24 % ------
% 3.18/1.24
% 3.18/1.24
% 3.18/1.24 %
% 3.18/1.24
% 3.18/1.24 % ------ Proving...
% 3.18/1.24 %
% 3.18/1.24
% 3.18/1.24 % SZS status Theorem for theBenchmark.p
% 3.18/1.24
% 3.18/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.18/1.24
% 3.18/1.24
%------------------------------------------------------------------------------