%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET574+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 : n016.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.52s 1.25s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 23 ~; 17 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 24 !; 9 ?; 4 :)
% 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(f3,conjecture,
! [X0,X1,X2] :
( ( member(X0,X2)
& member(X0,X1) )
=> intersect(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th13) ).
fof(f4,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X2)
& member(X0,X1) )
=> intersect(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f6,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& ~ intersect(X1,X2) ),
inference(ennf_transformation,[],[f4]) ).
fof(f7,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& ~ intersect(X1,X2) ),
inference(flattening,[],[f6]) ).
fof(f8,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(f9,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,[],[f8]) ).
fof(f10,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))],[f9]) ).
fof(f11,plain,
( member(sK1,sK3)
& member(sK1,sK2)
& ~ intersect(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f7]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
member(sK1,sK3),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
~ intersect(sK2,sK3),
inference(cnf_transformation,[],[f11]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( intersect(X1,X2)
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_53,negated_conjecture,
~ intersect(sK2,sK3),
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,negated_conjecture,
member(sK1,sK2),
inference(cnf_transformation,[],[f17]) ).
tcf(c_55,negated_conjecture,
member(sK1,sK3),
inference(cnf_transformation,[],[f16]) ).
tcf(c_85,plain,
! [X0: $i] :
( intersect(sK2,X0)
| ~ member(sK1,sK2)
| ~ member(sK1,X0) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_95,plain,
( intersect(sK2,sK3)
| ~ member(sK1,sK3)
| ~ member(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_85]) ).
tcf(c_96,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_95,c_53,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET574+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.42 % Computer : n016.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Thu Sep 24 11:24:12 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.49 Running first-order theorem proving
% 0.16/0.49 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.16/0.50
% 0.16/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.50
% 0.16/0.50 % Detected problem language: tptp
% 0.26/0.51 % Proving...
% 1.52/1.25 % SZS status Started for theBenchmark.p
% 1.52/1.25 % SZS status Theorem for theBenchmark.p
% 1.52/1.25
% 1.52/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.52/1.25
% 1.52/1.25 % ------ iProver source info
% 1.52/1.25
% 1.52/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 1.52/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.52/1.25 % git: non_committed_changes: false
% 1.52/1.25
% 1.52/1.25 % ------ Parsing...
% 1.52/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.52/1.25
% 1.52/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.52/1.25
% 1.52/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.25 % ------ Proving...
% 1.52/1.25 % ------ Problem Properties
% 1.52/1.25
% 1.52/1.25 %
% 1.52/1.25 % clauses 7
% 1.52/1.25 % conjectures 3
% 1.52/1.25 % EPR 5
% 1.52/1.25 % Horn 7
% 1.52/1.25 % unary 3
% 1.52/1.25 % binary 3
% 1.52/1.25 % lits 12
% 1.52/1.25 % lits eq 0
% 1.52/1.25 % fd_pure 0
% 1.52/1.25 % fd_pseudo 0
% 1.52/1.25 % fd_cond 0
% 1.52/1.25 % fd_pseudo_cond 0
% 1.52/1.25 % AC symbols 0
% 1.52/1.25
% 1.52/1.25 % ------ Schedule dynamic 5 is on
% 1.52/1.25
% 1.52/1.25 % ------ no equalities: superposition off
% 1.52/1.25
% 1.52/1.25 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.25
% 1.52/1.25
% 1.52/1.25 % ------
% 1.52/1.25 % Current options:
% 1.52/1.25 % ------
% 1.52/1.25
% 1.52/1.25
% 1.52/1.25 %
% 1.52/1.25
% 1.52/1.25 % ------ Proving...
% 1.52/1.25 %
% 1.52/1.25
% 1.52/1.25 % SZS status Theorem for theBenchmark.p
% 1.52/1.25
% 1.52/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.25
% 1.52/1.25
%------------------------------------------------------------------------------