%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU136+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 : n018.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.57s 1.18s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 14 unt; 0 def)
% Number of atoms : 220 ( 41 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 268 ( 102 ~; 121 |; 41 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 129 ( 0 sgn 121 !; 8 ?; 29 :)
% 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(f6,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f19,conjecture,
! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_xboole_1) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f31,plain,
? [X0,X1] : set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1),
inference(ennf_transformation,[],[f20]) ).
fof(f37,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(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(flattening,[],[f37]) ).
fof(f39,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,[],[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) ) ) )
& ( ( ( in(sK0(X0,X1,X2),X2)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X0) )
& ( ~ in(sK0(X0,X1,X2),X2)
| ( ~ in(sK0(X0,X1,X2),X1)
& ~ in(sK0(X0,X1,X2),X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f39]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) ) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) ) ),
inference(rectify,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( ~ in(X4,X1)
& in(X4,X0) ) )
& ( in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ( ( in(sK2(X0,X1,X2),X2)
| ( ~ in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) ) )
& ( ~ in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f46]) ).
fof(f50,plain,
set_difference(sK5,sK6) != set_difference(set_union2(sK5,sK6),sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f31]) ).
fof(f52,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f56,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X1)
| in(X4,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f65,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f67,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f68,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X1)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f47]) ).
fof(f69,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X0)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f47]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f47]) ).
fof(f80,plain,
set_difference(sK5,sK6) != set_difference(set_union2(sK5,sK6),sK6),
inference(cnf_transformation,[],[f50]) ).
fof(f88,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f57]) ).
fof(f89,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f56]) ).
fof(f90,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f67]) ).
fof(f91,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f66]) ).
fof(f92,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f65]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f52]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_union2(X2,X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| in(X0,X1)
| ~ in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK2(X0,X1,X2),X1)
| ( set_difference(X0,X1) = X2 )
| ~ in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X0)
| ( set_difference(X0,X1) = X2 ) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK2(X0,X1,X2),X2)
| ( set_difference(X0,X1) = X2 )
| ~ in(sK2(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| in(X0,set_difference(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ in(X0,X2)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_78,negated_conjecture,
set_difference(set_union2(sK5,sK6),sK6) != set_difference(sK5,sK6),
inference(cnf_transformation,[],[f80]) ).
tcf(c_227,plain,
set_difference(set_union2(sK6,sK5),sK6) != set_difference(sK5,sK6),
inference(demodulation,[status(thm)],[c_78,c_50]) ).
tcf(c_726,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6)
| ( set_difference(set_union2(sK6,sK5),sK6) = set_difference(sK5,sK6) )
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(sK5,sK6))
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,sK5)) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_727,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(sK5,sK6))
| ( set_difference(set_union2(sK6,sK5),sK6) = set_difference(sK5,sK6) )
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_768,plain,
! [X0: $i] :
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6)
| in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),X0)
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,X0)) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_773,plain,
! [X0: $i] :
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6)
| in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(X0,sK6))
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),X0) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_970,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6)
| in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK5)
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,sK5)) ),
inference(instantiation,[status(thm)],[c_768]) ).
tcf(c_975,plain,
! [X0: $i] :
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,X0))
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),X0) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_2237,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,sK5))
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK5) ),
inference(instantiation,[status(thm)],[c_975]) ).
tcf(c_2239,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6)
| in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(sK5,sK6))
| ~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK5) ),
inference(instantiation,[status(thm)],[c_773]) ).
tcf(c_3867,plain,
( in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(sK5,sK6))
| in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_union2(sK6,sK5)) ),
inference(resolution,[status(thm)],[c_64,c_227]) ).
tcf(c_4190,plain,
in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),set_difference(sK5,sK6)),
inference(global_subsumption_just,[status(thm)],[c_3867,c_227,c_727,c_970,c_2239,c_3867]) ).
tcf(c_4201,plain,
in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK5),
inference(resolution,[status(thm)],[c_4190,c_67]) ).
tcf(c_4202,plain,
~ in(sK2(set_union2(sK6,sK5),sK6,set_difference(sK5,sK6)),sK6),
inference(resolution,[status(thm)],[c_4190,c_68]) ).
tcf(c_4203,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4201,c_4202,c_4190,c_2237,c_726,c_227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU136+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.09/0.35 % Computer : n018.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 12:56:04 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 3.57/1.18 % SZS status Started for theBenchmark.p
% 3.57/1.18 % SZS status Theorem for theBenchmark.p
% 3.57/1.18
% 3.57/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.57/1.18
% 3.57/1.18 % ------ iProver source info
% 3.57/1.18
% 3.57/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.57/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.57/1.18 % git: non_committed_changes: false
% 3.57/1.18
% 3.57/1.18 % ------ Parsing...
% 3.57/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.57/1.18
% 3.57/1.18 % ------ 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.57/1.18
% 3.57/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.57/1.18
% 3.57/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.57/1.18 % ------ Proving...
% 3.57/1.18 % ------ Problem Properties
% 3.57/1.18
% 3.57/1.18 %
% 3.57/1.18 % clauses 32
% 3.57/1.18 % conjectures 0
% 3.57/1.18 % EPR 10
% 3.57/1.18 % Horn 25
% 3.57/1.18 % unary 10
% 3.57/1.18 % binary 11
% 3.57/1.18 % lits 67
% 3.57/1.18 % lits eq 15
% 3.57/1.18 % fd_pure 0
% 3.57/1.18 % fd_pseudo 0
% 3.57/1.18 % fd_cond 1
% 3.57/1.18 % fd_pseudo_cond 8
% 3.57/1.18 % AC symbols 0
% 3.57/1.18
% 3.57/1.18 % ------ Input Options Time Limit: Unbounded
% 3.57/1.18
% 3.57/1.18
% 3.57/1.18 % ------
% 3.57/1.18 % Current options:
% 3.57/1.18 % ------
% 3.57/1.18
% 3.57/1.18
% 3.57/1.18 %
% 3.57/1.18
% 3.57/1.18 % ------ Proving...
% 3.57/1.18 %
% 3.57/1.18
% 3.57/1.18 % SZS status Theorem for theBenchmark.p
% 3.57/1.18
% 3.57/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.18
% 3.57/1.18
%------------------------------------------------------------------------------