%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU126+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 : 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 02:55:29 PM UTC 2026
% Result : Theorem 3.16s 1.32s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 21 unt; 1 def)
% Number of atoms : 86 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 32 ~; 24 |; 8 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 1 sgn 47 !; 2 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f20,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f22,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f23,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f32,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f34,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f37,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f20]) ).
fof(f45,plain,
? [X0,X1] :
( subset(X0,X1)
& set_union2(X0,X1) != X1 ),
inference(ennf_transformation,[],[f23]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f57,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f56]) ).
fof(f75,plain,
( subset(sK6,sK7)
& sK7 != set_union2(sK6,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f45]) ).
fof(f79,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f83,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f57]) ).
fof(f110,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f112,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f75]) ).
fof(f113,plain,
sK7 != set_union2(sK6,sK7),
inference(cnf_transformation,[],[f75]) ).
fof(f125,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f32]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f79]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_81,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f110]) ).
tcf(c_83,negated_conjecture,
set_union2(sK6,sK7) != sK7,
inference(cnf_transformation,[],[f113]) ).
tcf(c_84,negated_conjecture,
subset(sK6,sK7),
inference(cnf_transformation,[],[f112]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f125]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_495,plain,
set_union2(sK7,sK6) != sK7,
inference(demodulation,[status(thm)],[c_83,c_50]) ).
tcf(c_1145,definition,
iPr_def_10 = set_union2(sK7,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1146,plain,
iPr_def_10 != sK7,
inference(demodulation,[status(thm)],[c_495,c_1145]) ).
tcf(c_1147,negated_conjecture,
subset(sK6,sK7),
inference(demodulation,[status(thm)],[c_84]) ).
tcf(c_1938,plain,
subset(sK7,iPr_def_10),
inference(superposition,[status(thm)],[c_1145,c_96]) ).
tcf(c_2308,plain,
( ( iPr_def_10 = sK7 )
| ~ subset(iPr_def_10,sK7)
| ~ subset(sK7,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_3061,plain,
( ( sK7 = iPr_def_10 )
| ~ subset(iPr_def_10,sK7) ),
inference(superposition,[status(thm)],[c_1938,c_52]) ).
tcf(c_3553,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ subset(sK6,X0)
| ~ subset(sK7,X0) ),
inference(superposition,[status(thm)],[c_1145,c_98]) ).
tcf(c_4619,plain,
~ subset(iPr_def_10,sK7),
inference(global_subsumption_just,[status(thm)],[c_3061,c_1146,c_1938,c_2308]) ).
tcf(c_7156,plain,
( subset(iPr_def_10,sK7)
| ~ subset(sK6,sK7) ),
inference(superposition,[status(thm)],[c_81,c_3553]) ).
tcf(c_7166,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7156,c_4619,c_1147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU126+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.41 % Computer : n005.cluster.edu
% 0.08/0.41 % Model : x86_64 x86_64
% 0.08/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.41 % Memory : 8046.5625MB
% 0.08/0.41 % OS : Linux 6.8.0-71-generic
% 0.08/0.41 % CPULimit : 300
% 0.08/0.41 % WCLimit : 300
% 0.08/0.41 % DateTime : Thu Sep 24 12:50:18 UTC 2026
% 0.08/0.41 % CPUTime :
% 0.08/0.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.45 Running first-order theorem proving
% 0.08/0.45 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.14/0.46
% 0.14/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.46
% 0.14/0.46 % Detected problem language: tptp
% 0.14/0.47 % Proving...
% 3.16/1.32 % SZS status Started for theBenchmark.p
% 3.16/1.32 % SZS status Theorem for theBenchmark.p
% 3.16/1.32
% 3.16/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.16/1.32
% 3.16/1.32 % ------ iProver source info
% 3.16/1.32
% 3.16/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.16/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.16/1.32 % git: non_committed_changes: false
% 3.16/1.32
% 3.16/1.32 % ------ Parsing...
% 3.16/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.16/1.32
% 3.16/1.32 % ------ Preprocessing... sup_sim: 1 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.16/1.32
% 3.16/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.16/1.32
% 3.16/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.16/1.32 % ------ Proving...
% 3.16/1.32 % ------ Problem Properties
% 3.16/1.32
% 3.16/1.32 %
% 3.16/1.32 % clauses 49
% 3.16/1.32 % conjectures 1
% 3.16/1.32 % EPR 18
% 3.16/1.32 % Horn 40
% 3.16/1.32 % unary 15
% 3.16/1.32 % binary 20
% 3.16/1.32 % lits 99
% 3.16/1.32 % lits eq 20
% 3.16/1.32 % fd_pure 0
% 3.16/1.32 % fd_pseudo 0
% 3.16/1.32 % fd_cond 3
% 3.16/1.32 % fd_pseudo_cond 8
% 3.16/1.32 % AC symbols 0
% 3.16/1.32
% 3.16/1.32 % ------ Schedule dynamic 5 is on
% 3.16/1.32
% 3.16/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.16/1.32
% 3.16/1.32
% 3.16/1.32 % ------
% 3.16/1.32 % Current options:
% 3.16/1.32 % ------
% 3.16/1.32
% 3.16/1.32
% 3.16/1.32 %
% 3.16/1.32
% 3.16/1.32 % ------ Proving...
% 3.16/1.32 %
% 3.16/1.32
% 3.16/1.32 % SZS status Theorem for theBenchmark.p
% 3.16/1.32
% 3.16/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.16/1.32
% 3.16/1.32
%------------------------------------------------------------------------------