%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET573+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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:47:25 PM UTC 2026
% Result : Theorem 1.67s 1.30s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 29 ~; 20 |; 15 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 34 !; 9 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& member(X0,X1) )
=> ~ member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th12) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& member(X0,X1) )
=> ~ member(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( disjoint(X0,X1)
=> ~ intersect(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& member(X0,X1)
& member(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0,X1,X2] :
( disjoint(X1,X2)
& member(X0,X1)
& member(X0,X2) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ( ~ intersect(X0,X1)
| ? [X2] :
( member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
| intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ( ~ intersect(X0,X1)
| ? [X3] :
( member(X3,X1)
& member(X3,X0) ) )
& ( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
| intersect(X0,X1) ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ( ~ intersect(X0,X1)
| ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
| intersect(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f12]) ).
fof(f14,plain,
( disjoint(sK2,sK3)
& member(sK1,sK2)
& member(sK1,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f10]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
disjoint(sK2,sK3),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
member(sK1,sK3),
inference(cnf_transformation,[],[f14]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( intersect(X1,X2)
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,negated_conjecture,
member(sK1,sK3),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,negated_conjecture,
member(sK1,sK2),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,negated_conjecture,
disjoint(sK2,sK3),
inference(cnf_transformation,[],[f20]) ).
tcf(c_88,plain,
~ intersect(sK2,sK3),
inference(resolution,[status(thm)],[c_52,c_56]) ).
tcf(c_122,plain,
! [X0: $i] :
( intersect(sK2,X0)
| ~ member(sK1,sK2)
| ~ member(sK1,X0) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_136,plain,
( intersect(sK2,sK3)
| ~ member(sK1,sK2)
| ~ member(sK1,sK3) ),
inference(instantiation,[status(thm)],[c_122]) ).
tcf(c_137,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_136,c_88,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET573+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 11:16:53 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 1.67/1.30 % SZS status Started for theBenchmark.p
% 1.67/1.30 % SZS status Theorem for theBenchmark.p
% 1.67/1.30
% 1.67/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.67/1.30
% 1.67/1.30 % ------ iProver source info
% 1.67/1.30
% 1.67/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.67/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.67/1.30 % git: non_committed_changes: false
% 1.67/1.30
% 1.67/1.30 % ------ Parsing...
% 1.67/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.67/1.30
% 1.67/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.67/1.30
% 1.67/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.67/1.30 % ------ Proving...
% 1.67/1.30 % ------ Problem Properties
% 1.67/1.30
% 1.67/1.30 %
% 1.67/1.30 % clauses 7
% 1.67/1.30 % conjectures 2
% 1.67/1.30 % EPR 5
% 1.67/1.30 % Horn 7
% 1.67/1.30 % unary 3
% 1.67/1.30 % binary 3
% 1.67/1.30 % lits 12
% 1.67/1.30 % lits eq 0
% 1.67/1.30 % fd_pure 0
% 1.67/1.30 % fd_pseudo 0
% 1.67/1.30 % fd_cond 0
% 1.67/1.30 % fd_pseudo_cond 0
% 1.67/1.30 % AC symbols 0
% 1.67/1.30
% 1.67/1.30 % ------ Schedule dynamic 5 is on
% 1.67/1.30
% 1.67/1.30 % ------ no equalities: superposition off
% 1.67/1.30
% 1.67/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/1.30
% 1.67/1.30
% 1.67/1.30 % ------
% 1.67/1.30 % Current options:
% 1.67/1.30 % ------
% 1.67/1.30
% 1.67/1.30
% 1.67/1.30 %
% 1.67/1.30
% 1.67/1.30 % ------ Proving...
% 1.67/1.30 %
% 1.67/1.30
% 1.67/1.30 % SZS status Theorem for theBenchmark.p
% 1.67/1.30
% 1.67/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.30
% 1.67/1.30
%------------------------------------------------------------------------------