%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET196+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n018.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:46:54 PM UTC 2026
% Result : Theorem 0.45s 1.29s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 10 unt; 1 def)
% Number of atoms : 71 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 27 ~; 24 |; 11 &)
% ( 3 <=>; 1 =>; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 44 !; 4 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f6,conjecture,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_is_subset) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] : subset(intersection(X0,X1),X0),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1] : ~ subset(intersection(X0,X1),X0),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f13]) ).
fof(f18,plain,
~ subset(intersection(sK2,sK3),sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f9]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
~ subset(intersection(sK2,sK3),sK2),
inference(cnf_transformation,[],[f18]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_59,negated_conjecture,
~ subset(intersection(sK2,sK3),sK2),
inference(cnf_transformation,[],[f31]) ).
tcf(c_204,definition,
iPr_def_10 = intersection(sK2,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_205,negated_conjecture,
~ subset(iPr_def_10,sK2),
inference(demodulation,[status(thm)],[c_59,c_204]) ).
tcf(c_381,plain,
! [X0: $i] :
( member(X0,sK2)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_204,c_50]) ).
tcf(c_392,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),sK2) ),
inference(superposition,[status(thm)],[c_53,c_381]) ).
tcf(c_437,plain,
subset(iPr_def_10,sK2),
inference(superposition,[status(thm)],[c_392,c_52]) ).
tcf(c_438,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_437,c_205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET196+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 10:14:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/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.45/1.29 % SZS status Started for theBenchmark.p
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29
% 0.45/1.29 % ------ iProver source info
% 0.45/1.29
% 0.45/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29 % git: non_committed_changes: false
% 0.45/1.29
% 0.45/1.29 % ------ Parsing...
% 0.45/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 % ------ Problem Properties
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29 % clauses 12
% 0.45/1.29 % conjectures 1
% 0.45/1.29 % EPR 3
% 0.45/1.29 % Horn 10
% 0.45/1.29 % unary 4
% 0.45/1.29 % binary 4
% 0.45/1.29 % lits 24
% 0.45/1.29 % lits eq 4
% 0.45/1.29 % fd_pure 0
% 0.45/1.29 % fd_pseudo 0
% 0.45/1.29 % fd_cond 0
% 0.45/1.29 % fd_pseudo_cond 2
% 0.45/1.29 % AC symbols 0
% 0.45/1.29
% 0.45/1.29 % ------ Schedule dynamic 5 is on
% 0.45/1.29
% 0.45/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 % ------
% 0.45/1.29 % Current options:
% 0.45/1.29 % ------
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29
% 0.45/1.29
%------------------------------------------------------------------------------