%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET060+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:18 PM UTC 2026
% Result : Theorem 1.80s 1.48s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 2 def)
% Number of atoms : 68 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 62 ( 29 ~; 21 |; 10 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 39 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(f14,axiom,
! [X0,X1] :
( member(X1,complement(X0))
<=> ( ~ member(X1,X0)
& member(X1,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',complement) ).
fof(f44,conjecture,
! [X0,X1] : ~ member(X1,intersection(complement(X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',special_classes_lemma) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : ~ member(X1,intersection(complement(X0),X0)),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1] : member(X1,intersection(complement(X0),X0)),
inference(ennf_transformation,[],[f45]) ).
fof(f72,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,[],[f13]) ).
fof(f73,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,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ( ~ member(X1,complement(X0))
| ( ~ member(X1,X0)
& member(X1,universal_class) ) )
& ( member(X1,X0)
| ~ member(X1,universal_class)
| member(X1,complement(X0)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f75,plain,
! [X0,X1] :
( ( ~ member(X1,complement(X0))
| ( ~ member(X1,X0)
& member(X1,universal_class) ) )
& ( member(X1,X0)
| ~ member(X1,universal_class)
| member(X1,complement(X0)) ) ),
inference(flattening,[],[f74]) ).
fof(f103,plain,
member(sK7,intersection(complement(sK6),sK6)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f131,plain,
! [X0,X1] :
( ~ member(X1,complement(X0))
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f191,plain,
member(sK7,intersection(complement(sK6),sK6)),
inference(cnf_transformation,[],[f103]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_128,negated_conjecture,
member(sK7,intersection(complement(sK6),sK6)),
inference(cnf_transformation,[],[f191]) ).
tcf(c_1554,definition,
iPr_def_10 = complement(sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1555,definition,
iPr_def_11 = intersection(iPr_def_10,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1556,negated_conjecture,
member(sK7,iPr_def_11),
inference(demodulation,[status(thm)],[c_128,c_1554,c_1555]) ).
tcf(c_2510,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1555,c_72]) ).
tcf(c_2596,plain,
! [X0: $i] :
( member(X0,sK6)
| ~ member(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1555,c_73]) ).
tcf(c_2610,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_10)
| ~ member(X0,sK6) ),
inference(superposition,[status(thm)],[c_1554,c_76]) ).
tcf(c_2635,plain,
! [X0: $i] : ~ member(X0,iPr_def_11),
inference(global_subsumption_just,[status(thm)],[c_2596,c_2510,c_2596,c_2610]) ).
tcf(c_2638,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1556,c_2635]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET060+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.58 % Computer : n013.cluster.edu
% 0.08/0.58 % Model : x86_64 x86_64
% 0.08/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.58 % Memory : 8046.5625MB
% 0.08/0.58 % OS : Linux 6.8.0-71-generic
% 0.08/0.58 % CPULimit : 300
% 0.08/0.58 % WCLimit : 300
% 0.08/0.58 % DateTime : Thu Sep 24 09:28:28 UTC 2026
% 0.08/0.58 % CPUTime :
% 0.08/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.62 Running first-order theorem proving
% 0.08/0.62 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.08/0.63
% 0.08/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.63
% 0.08/0.63 % Detected problem language: tptp
% 0.13/0.64 % Proving...
% 1.80/1.48 % SZS status Started for theBenchmark.p
% 1.80/1.48 % SZS status Theorem for theBenchmark.p
% 1.80/1.48
% 1.80/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.48
% 1.80/1.48 % ------ iProver source info
% 1.80/1.48
% 1.80/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.48 % git: non_committed_changes: false
% 1.80/1.48
% 1.80/1.48 % ------ Parsing...
% 1.80/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/1.48
% 1.80/1.48 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 1.80/1.48
% 1.80/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/1.48
% 1.80/1.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.80/1.48 % ------ Proving...
% 1.80/1.48 % ------ Problem Properties
% 1.80/1.48
% 1.80/1.48 %
% 1.80/1.48 % clauses 77
% 1.80/1.48 % conjectures 1
% 1.80/1.48 % EPR 8
% 1.80/1.48 % Horn 69
% 1.80/1.48 % unary 17
% 1.80/1.48 % binary 39
% 1.80/1.48 % lits 159
% 1.80/1.48 % lits eq 16
% 1.80/1.48 % fd_pure 0
% 1.80/1.48 % fd_pseudo 0
% 1.80/1.48 % fd_cond 4
% 1.80/1.48 % fd_pseudo_cond 3
% 1.80/1.48 % AC symbols 0
% 1.80/1.48
% 1.80/1.48 % ------ Schedule dynamic 5 is on
% 1.80/1.48
% 1.80/1.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/1.48
% 1.80/1.48
% 1.80/1.48 % ------
% 1.80/1.48 % Current options:
% 1.80/1.48 % ------
% 1.80/1.48
% 1.80/1.48
% 1.80/1.48 %
% 1.80/1.48
% 1.80/1.48 % ------ Proving...
% 1.80/1.48 %
% 1.80/1.48
% 1.80/1.48 % SZS status Theorem for theBenchmark.p
% 1.80/1.48
% 1.80/1.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.48
% 1.80/1.48
%------------------------------------------------------------------------------