%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET576+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 : n015.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 0.31s 1.09s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 4 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 36 ~; 24 |; 9 &)
% ( 2 <=>; 5 =>; 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 40 !; 5 ?; 8 :)
% 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] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th17) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
? [X0,X1] :
( ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) )
& ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,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(f11,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,[],[f10]) ).
fof(f12,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))],[f11]) ).
fof(f13,plain,
( ! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK2) )
& ~ disjoint(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f9]) ).
fof(f14,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f15,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
~ disjoint(sK1,sK2),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_54,negated_conjecture,
~ disjoint(sK1,sK2),
inference(cnf_transformation,[],[f20]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_88,plain,
intersect(sK1,sK2),
inference(resolution,[status(thm)],[c_52,c_54]) ).
tcf(c_118,negated_conjecture,
! [X0: $i] :
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_119,plain,
( member(sK0(sK1,sK2),sK1)
| ~ intersect(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_120,plain,
( member(sK0(sK1,sK2),sK2)
| ~ intersect(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_124,plain,
( ~ member(sK0(sK1,sK2),sK2)
| ~ member(sK0(sK1,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_118]) ).
tcf(c_125,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_124,c_120,c_119,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET576+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 : n015.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:23:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.31/1.09 % SZS status Started for theBenchmark.p
% 0.31/1.09 % SZS status Theorem for theBenchmark.p
% 0.31/1.09
% 0.31/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.31/1.09
% 0.31/1.09 % ------ iProver source info
% 0.31/1.09
% 0.31/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 0.31/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.31/1.09 % git: non_committed_changes: false
% 0.31/1.09
% 0.31/1.09 % ------ Parsing...
% 0.31/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.31/1.09
% 0.31/1.09 % ------ 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 %
% 0.31/1.09
% 0.31/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.31/1.09 % ------ Proving...
% 0.31/1.09 % ------ Problem Properties
% 0.31/1.09
% 0.31/1.09 %
% 0.31/1.09 % clauses 6
% 0.31/1.09 % conjectures 1
% 0.31/1.09 % EPR 4
% 0.31/1.09 % Horn 6
% 0.31/1.09 % unary 1
% 0.31/1.09 % binary 4
% 0.31/1.09 % lits 12
% 0.31/1.09 % lits eq 0
% 0.31/1.09 % fd_pure 0
% 0.31/1.09 % fd_pseudo 0
% 0.31/1.09 % fd_cond 0
% 0.31/1.09 % fd_pseudo_cond 0
% 0.31/1.09 % AC symbols 0
% 0.31/1.09
% 0.31/1.09 % ------ Schedule dynamic 5 is on
% 0.31/1.09
% 0.31/1.09 % ------ no equalities: superposition off
% 0.31/1.09
% 0.31/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.31/1.09
% 0.31/1.09
% 0.31/1.09 % ------
% 0.31/1.09 % Current options:
% 0.31/1.09 % ------
% 0.31/1.09
% 0.31/1.09
% 0.31/1.09 %
% 0.31/1.09
% 0.31/1.09 % ------ Proving...
% 0.31/1.09 %
% 0.31/1.09
% 0.31/1.09 % SZS status Theorem for theBenchmark.p
% 0.31/1.09
% 0.31/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.31/1.09
% 0.31/1.09
%------------------------------------------------------------------------------