%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU140+1 : 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 : 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 2.00s 16.29s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 76 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 59 ( 25 ~; 19 |; 9 &)
% ( 1 <=>; 5 =>; 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; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 53 !; 6 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f12,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f14,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0] :
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(ennf_transformation,[],[f14]) ).
fof(f27,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& subset(X0,X1)
& ~ disjoint(X0,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f28,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& subset(X0,X1)
& ~ disjoint(X0,X2) ),
inference(flattening,[],[f27]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set )
& ( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f34,plain,
( disjoint(sK3,sK4)
& subset(sK2,sK3)
& ~ disjoint(sK2,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f28]) ).
fof(f35,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f36,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f31]) ).
fof(f37,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f43,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f47,plain,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f34]) ).
fof(f48,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f49,plain,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f34]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f35]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| ( set_intersection2(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = empty_set )
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_60,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ~ subset(X0,empty_set) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_61,negated_conjecture,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f49]) ).
tcf(c_62,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f48]) ).
tcf(c_63,negated_conjecture,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f47]) ).
tcf(c_202,negated_conjecture,
disjoint(sK3,sK4),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_203,negated_conjecture,
subset(sK2,sK3),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_509,plain,
disjoint(sK4,sK3),
inference(superposition,[status(thm)],[c_202,c_57]) ).
tcf(c_554,plain,
set_intersection2(sK4,sK3) = empty_set,
inference(superposition,[status(thm)],[c_509,c_51]) ).
tcf(c_584,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_intersection2(X0,X2),set_intersection2(X2,X1))
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_49,c_58]) ).
tcf(c_690,plain,
( disjoint(sK2,sK4)
| ( set_intersection2(sK2,sK4) != empty_set ) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_963,plain,
! [X0: $i] :
( subset(set_intersection2(X0,sK4),empty_set)
| ~ subset(X0,sK3) ),
inference(superposition,[status(thm)],[c_554,c_584]) ).
tcf(c_1055,plain,
! [X0: $i] :
( ( set_intersection2(X0,sK4) = empty_set )
| ~ subset(X0,sK3) ),
inference(superposition,[status(thm)],[c_963,c_60]) ).
tcf(c_1102,plain,
set_intersection2(sK2,sK4) = empty_set,
inference(superposition,[status(thm)],[c_203,c_1055]) ).
tcf(c_1109,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1102,c_690,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU140+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/15.37 % Computer : n004.cluster.edu
% 0.10/15.37 % Model : x86_64 x86_64
% 0.10/15.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.37 % Memory : 8046.5625MB
% 0.10/15.37 % OS : Linux 6.8.0-71-generic
% 0.10/15.37 % CPULimit : 300
% 0.10/15.37 % WCLimit : 300
% 0.10/15.37 % DateTime : Thu Sep 24 12:55:09 UTC 2026
% 0.10/15.38 % CPUTime :
% 0.10/15.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/15.42 Running first-order theorem proving
% 0.14/15.42 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.14/15.43
% 0.14/15.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/15.43
% 0.14/15.43 % Detected problem language: tptp
% 0.14/15.44 % Proving...
% 2.00/16.29 % SZS status Started for theBenchmark.p
% 2.00/16.29 % SZS status Theorem for theBenchmark.p
% 2.00/16.29
% 2.00/16.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.00/16.29
% 2.00/16.29 % ------ iProver source info
% 2.00/16.29
% 2.00/16.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.00/16.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.00/16.29 % git: non_committed_changes: false
% 2.00/16.29
% 2.00/16.29 % ------ Parsing...
% 2.00/16.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.00/16.29
% 2.00/16.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.00/16.29
% 2.00/16.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.00/16.29
% 2.00/16.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.00/16.29 % ------ Proving...
% 2.00/16.29 % ------ Problem Properties
% 2.00/16.29
% 2.00/16.29 %
% 2.00/16.29 % clauses 17
% 2.00/16.29 % conjectures 3
% 2.00/16.29 % EPR 11
% 2.00/16.29 % Horn 17
% 2.00/16.29 % unary 10
% 2.00/16.29 % binary 6
% 2.00/16.29 % lits 25
% 2.00/16.29 % lits eq 8
% 2.00/16.29 % fd_pure 0
% 2.00/16.29 % fd_pseudo 0
% 2.00/16.29 % fd_cond 2
% 2.00/16.29 % fd_pseudo_cond 1
% 2.00/16.29 % AC symbols 0
% 2.00/16.29
% 2.00/16.29 % ------ Schedule dynamic 5 is on
% 2.00/16.29
% 2.00/16.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.00/16.29
% 2.00/16.29
% 2.00/16.29 % ------
% 2.00/16.29 % Current options:
% 2.00/16.29 % ------
% 2.00/16.29
% 2.00/16.29
% 2.00/16.29 %
% 2.00/16.29
% 2.00/16.29 % ------ Proving...
% 2.00/16.29 %
% 2.00/16.29
% 2.00/16.29 % SZS status Theorem for theBenchmark.p
% 2.00/16.29
% 2.00/16.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.00/16.29
% 2.00/16.29
%------------------------------------------------------------------------------