%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU140+2 : 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 4.36s 6.30s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 121 ( 50 ~; 38 |; 28 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 55 !; 11 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f43,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f51,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f52,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f62,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X3] :
( in(X3,X1)
& in(X3,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f43]) ).
fof(f67,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f82,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) ) )
& ( ? [X2] :
( in(X2,X1)
& in(X2,X0) )
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f87,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& subset(X0,X1)
& ~ disjoint(X0,X2) ),
inference(ennf_transformation,[],[f52]) ).
fof(f88,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& subset(X0,X1)
& ~ disjoint(X0,X2) ),
inference(flattening,[],[f87]) ).
fof(f103,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,[],[f67]) ).
fof(f104,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,[],[f103]) ).
fof(f105,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))],[f104]) ).
fof(f121,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) ) )
& ( ( in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) )
| disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f82]) ).
fof(f123,plain,
( disjoint(sK11,sK12)
& subset(sK10,sK11)
& ~ disjoint(sK10,sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f88]) ).
fof(f139,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f186,plain,
! [X3,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f187,plain,
! [X0,X1] :
( in(sK8(X0,X1),X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f188,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f197,plain,
disjoint(sK11,sK12),
inference(cnf_transformation,[],[f123]) ).
fof(f198,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f123]) ).
fof(f199,plain,
~ disjoint(sK10,sK12),
inference(cnf_transformation,[],[f123]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X1) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ disjoint(X2,X1)
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_121,negated_conjecture,
~ disjoint(sK10,sK12),
inference(cnf_transformation,[],[f199]) ).
tcf(c_122,negated_conjecture,
subset(sK10,sK11),
inference(cnf_transformation,[],[f198]) ).
tcf(c_123,negated_conjecture,
disjoint(sK11,sK12),
inference(cnf_transformation,[],[f197]) ).
tcf(c_3342,plain,
( disjoint(sK10,sK12)
| in(sK8(sK10,sK12),sK10) ),
inference(instantiation,[status(thm)],[c_111]) ).
tcf(c_3343,plain,
( disjoint(sK10,sK12)
| in(sK8(sK10,sK12),sK12) ),
inference(instantiation,[status(thm)],[c_112]) ).
tcf(c_3628,plain,
! [X0: $i] :
( in(sK8(sK10,sK12),X0)
| ~ subset(sK10,X0)
| ~ in(sK8(sK10,sK12),sK10) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_3702,plain,
! [X0: $i] :
( ~ disjoint(X0,sK12)
| ~ in(sK8(sK10,sK12),sK12)
| ~ in(sK8(sK10,sK12),X0) ),
inference(instantiation,[status(thm)],[c_113]) ).
tcf(c_7700,plain,
( in(sK8(sK10,sK12),sK11)
| ~ subset(sK10,sK11)
| ~ in(sK8(sK10,sK12),sK10) ),
inference(instantiation,[status(thm)],[c_3628]) ).
tcf(c_8035,plain,
( ~ disjoint(sK11,sK12)
| ~ in(sK8(sK10,sK12),sK11)
| ~ in(sK8(sK10,sK12),sK12) ),
inference(instantiation,[status(thm)],[c_3702]) ).
tcf(c_8036,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8035,c_7700,c_3343,c_3342,c_121,c_122,c_123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU140+2 : 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/5.38 % Computer : n004.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 12:54:42 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.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/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 4.36/6.30 % SZS status Started for theBenchmark.p
% 4.36/6.30 % SZS status Theorem for theBenchmark.p
% 4.36/6.30
% 4.36/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/6.30
% 4.36/6.30 % ------ iProver source info
% 4.36/6.30
% 4.36/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.36/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/6.30 % git: non_committed_changes: false
% 4.36/6.30
% 4.36/6.30 % ------ Parsing...
% 4.36/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.36/6.30
% 4.36/6.30 % ------ 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 %
% 4.36/6.30
% 4.36/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.36/6.30
% 4.36/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.36/6.30 % ------ Proving...
% 4.36/6.30 % ------ Problem Properties
% 4.36/6.30
% 4.36/6.30 %
% 4.36/6.30 % clauses 72
% 4.36/6.30 % conjectures 3
% 4.36/6.30 % EPR 23
% 4.36/6.30 % Horn 57
% 4.36/6.30 % unary 21
% 4.36/6.30 % binary 29
% 4.36/6.30 % lits 148
% 4.36/6.30 % lits eq 32
% 4.36/6.30 % fd_pure 0
% 4.36/6.30 % fd_pseudo 0
% 4.36/6.30 % fd_cond 3
% 4.36/6.30 % fd_pseudo_cond 14
% 4.36/6.30 % AC symbols 0
% 4.36/6.30
% 4.36/6.30 % ------ Schedule dynamic 5 is on
% 4.36/6.30
% 4.36/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.36/6.30
% 4.36/6.30
% 4.36/6.30 % ------
% 4.36/6.30 % Current options:
% 4.36/6.30 % ------
% 4.36/6.30
% 4.36/6.30
% 4.36/6.30 %
% 4.36/6.30
% 4.36/6.30 % ------ Proving...
% 4.36/6.30 %
% 4.36/6.30
% 4.36/6.30 % SZS status Theorem for theBenchmark.p
% 4.36/6.30
% 4.36/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/6.30
% 4.36/6.30
%------------------------------------------------------------------------------