%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU126+1 : 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:29 PM UTC 2026
% Result : Theorem 2.84s 1.17s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 132 ( 25 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 156 ( 57 ~; 64 |; 28 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 71 ( 0 sgn 64 !; 7 ?; 12 :)
% 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,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f15,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f23,plain,
? [X0,X1] :
( subset(X0,X1)
& set_union2(X0,X1) != X1 ),
inference(ennf_transformation,[],[f16]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f30,plain,
( subset(sK0,sK1)
& sK1 != set_union2(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f23]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f32,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f32]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ( ( in(sK5(X0,X1,X2),X2)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0) )
& ( ~ in(sK5(X0,X1,X2),X2)
| ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f40]) ).
fof(f42,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f30]) ).
fof(f43,plain,
sK1 != set_union2(sK0,sK1),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f50,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f62,plain,
! [X2,X0,X1] :
( in(sK5(X0,X1,X2),X2)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f41]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X0)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_49,negated_conjecture,
set_union2(sK0,sK1) != sK1,
inference(cnf_transformation,[],[f43]) ).
tcf(c_50,negated_conjecture,
subset(sK0,sK1),
inference(cnf_transformation,[],[f42]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f46]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( set_union2(X0,X1) = X2 )
| ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK5(X0,X1,X2),X2)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| ( set_union2(X0,X1) = X2 ) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_190,plain,
set_union2(sK1,sK0) != sK1,
inference(demodulation,[status(thm)],[c_49,c_53]) ).
tcf(c_1005,plain,
( ( set_union2(sK1,sK0) = sK1 )
| ~ in(sK5(sK1,sK0,sK1),sK1) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_1007,plain,
( in(sK5(sK1,sK0,sK1),sK0)
| in(sK5(sK1,sK0,sK1),sK1)
| ( set_union2(sK1,sK0) = sK1 ) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_1054,plain,
! [X0: $i] :
( in(sK5(sK1,sK0,sK1),X0)
| ~ subset(sK0,X0)
| ~ in(sK5(sK1,sK0,sK1),sK0) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_1055,plain,
( in(sK5(sK1,sK0,sK1),sK1)
| ~ subset(sK0,sK1)
| ~ in(sK5(sK1,sK0,sK1),sK0) ),
inference(instantiation,[status(thm)],[c_1054]) ).
tcf(c_1056,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1055,c_1007,c_1005,c_190,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU126+1 : 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.35 % Computer : n004.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 12:50:38 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 2.84/1.17 % SZS status Started for theBenchmark.p
% 2.84/1.17 % SZS status Theorem for theBenchmark.p
% 2.84/1.17
% 2.84/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.84/1.17
% 2.84/1.17 % ------ iProver source info
% 2.84/1.17
% 2.84/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 2.84/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.84/1.17 % git: non_committed_changes: false
% 2.84/1.17
% 2.84/1.17 % ------ Parsing...
% 2.84/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.84/1.17
% 2.84/1.17 % ------ 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 %
% 2.84/1.17
% 2.84/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.84/1.17
% 2.84/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.84/1.17 % ------ Proving...
% 2.84/1.17 % ------ Problem Properties
% 2.84/1.17
% 2.84/1.17 %
% 2.84/1.17 % clauses 22
% 2.84/1.17 % conjectures 1
% 2.84/1.17 % EPR 9
% 2.84/1.17 % Horn 19
% 2.84/1.17 % unary 7
% 2.84/1.17 % binary 8
% 2.84/1.17 % lits 45
% 2.84/1.17 % lits eq 8
% 2.84/1.17 % fd_pure 0
% 2.84/1.17 % fd_pseudo 0
% 2.84/1.17 % fd_cond 0
% 2.84/1.17 % fd_pseudo_cond 5
% 2.84/1.17 % AC symbols 0
% 2.84/1.17
% 2.84/1.17 % ------ Schedule dynamic 5 is on
% 2.84/1.17
% 2.84/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 % ------
% 2.84/1.17 % Current options:
% 2.84/1.17 % ------
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 %
% 2.84/1.17
% 2.84/1.17 % ------ Proving...
% 2.84/1.17 %
% 2.84/1.17
% 2.84/1.17 % SZS status Theorem for theBenchmark.p
% 2.84/1.17
% 2.84/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.17
% 2.84/1.17
%------------------------------------------------------------------------------