%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:33 PM UTC 2026
% Result : Theorem 3.45s 1.28s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 19 unt; 0 def)
% Number of atoms : 54 ( 15 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 41 ( 19 ~; 11 |; 9 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 1 sgn 33 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f12,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f22,axiom,
! [X0,X1] : ~ proper_subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(f28,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f50,conjecture,
! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f51,negated_conjecture,
~ ! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f50]) ).
fof(f59,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(rectify,[],[f22]) ).
fof(f69,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(ennf_transformation,[],[f28]) ).
fof(f82,plain,
? [X0,X1] :
( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f109,plain,
! [X0,X1] :
( ( ~ proper_subset(X0,X1)
| ( X0 != X1
& subset(X0,X1) ) )
& ( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f110,plain,
! [X0,X1] :
( ( ~ proper_subset(X0,X1)
| ( X0 != X1
& subset(X0,X1) ) )
& ( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ) ),
inference(flattening,[],[f109]) ).
fof(f119,plain,
( proper_subset(sK11,sK10)
& subset(sK10,sK11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f82]) ).
fof(f122,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f153,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f160,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f59]) ).
fof(f167,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f194,plain,
proper_subset(sK11,sK10),
inference(cnf_transformation,[],[f119]) ).
fof(f195,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f119]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f122]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_89,plain,
! [X0: $i] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f160]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_122,negated_conjecture,
subset(sK10,sK11),
inference(cnf_transformation,[],[f195]) ).
tcf(c_123,negated_conjecture,
proper_subset(sK11,sK10),
inference(cnf_transformation,[],[f194]) ).
tcf(c_1708,negated_conjecture,
proper_subset(sK11,sK10),
inference(demodulation,[status(thm)],[c_123]) ).
tcf(c_1709,negated_conjecture,
subset(sK10,sK11),
inference(demodulation,[status(thm)],[c_122]) ).
tcf(c_2882,plain,
subset(sK11,sK10),
inference(superposition,[status(thm)],[c_1708,c_82]) ).
tcf(c_3173,plain,
set_union2(sK10,sK11) = sK11,
inference(superposition,[status(thm)],[c_1709,c_96]) ).
tcf(c_3176,plain,
set_union2(sK11,sK10) = sK10,
inference(superposition,[status(thm)],[c_2882,c_96]) ).
tcf(c_3208,plain,
sK10 = sK11,
inference(demodulation,[status(thm)],[c_3176,c_51,c_3173]) ).
tcf(c_3214,plain,
proper_subset(sK10,sK10),
inference(demodulation,[status(thm)],[c_1708,c_3208]) ).
tcf(c_3215,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3214,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 12:54:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 3.45/1.28 % SZS status Started for theBenchmark.p
% 3.45/1.28 % SZS status Theorem for theBenchmark.p
% 3.45/1.28
% 3.45/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.45/1.28
% 3.45/1.28 % ------ iProver source info
% 3.45/1.28
% 3.45/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.45/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.45/1.28 % git: non_committed_changes: false
% 3.45/1.28
% 3.45/1.28 % ------ Parsing...
% 3.45/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.45/1.28
% 3.45/1.28 % ------ Preprocessing... sup_sim: 3 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.45/1.28
% 3.45/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.45/1.28
% 3.45/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.45/1.28 % ------ Proving...
% 3.45/1.28 % ------ Problem Properties
% 3.45/1.28
% 3.45/1.28 %
% 3.45/1.28 % clauses 71
% 3.45/1.28 % conjectures 2
% 3.45/1.28 % EPR 22
% 3.45/1.28 % Horn 56
% 3.45/1.28 % unary 20
% 3.45/1.28 % binary 29
% 3.45/1.28 % lits 147
% 3.45/1.28 % lits eq 32
% 3.45/1.28 % fd_pure 0
% 3.45/1.28 % fd_pseudo 0
% 3.45/1.28 % fd_cond 3
% 3.45/1.28 % fd_pseudo_cond 14
% 3.45/1.28 % AC symbols 0
% 3.45/1.28
% 3.45/1.28 % ------ Schedule dynamic 5 is on
% 3.45/1.28
% 3.45/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.45/1.28
% 3.45/1.28
% 3.45/1.28 % ------
% 3.45/1.28 % Current options:
% 3.45/1.28 % ------
% 3.45/1.28
% 3.45/1.28
% 3.45/1.28 %
% 3.45/1.28
% 3.45/1.28 % ------ Proving...
% 3.45/1.28 %
% 3.45/1.28
% 3.45/1.28 % SZS status Theorem for theBenchmark.p
% 3.45/1.28
% 3.45/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.45/1.28
% 3.45/1.28
%------------------------------------------------------------------------------