%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET194-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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 : Unsatisfiable 10.12s 2.65s
% Output : CNFRefutation 10.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 34 ( 13 unt; 4 def)
% Number of atoms : 85 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 51 ( 24 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f21,axiom,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f26,axiom,
! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
fof(f122,negated_conjecture,
~ subclass(x,union(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lattice_upper_bound1_1) ).
fof(f185,plain,
~ subclass(x,complement(intersection(complement(x),complement(y)))),
inference(definition_unfolding,[],[f122,f26]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_165,plain,
! [X0: $i] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f4]) ).
tcf(c_180,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_255,negated_conjecture,
~ subclass(x,complement(intersection(complement(x),complement(y)))),
inference(cnf_transformation,[],[f185]) ).
tcf(c_2974,definition,
iPr_def_10 = complement(x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2975,definition,
iPr_def_11 = complement(y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2976,definition,
iPr_def_12 = intersection(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2977,definition,
iPr_def_13 = complement(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2978,negated_conjecture,
~ subclass(x,iPr_def_13),
inference(demodulation,[status(thm)],[c_255,c_2975,c_2974,c_2976,c_2977]) ).
tcf(c_3878,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,iPr_def_12) ),
inference(superposition,[status(thm)],[c_2976,c_180]) ).
tcf(c_3976,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_10)
| ~ member(X0,x) ),
inference(superposition,[status(thm)],[c_2974,c_183]) ).
tcf(c_4123,plain,
! [X0: $i,X1: $i] :
( member(X0,universal_class)
| ~ member(X0,X1) ),
inference(superposition,[status(thm)],[c_165,c_162]) ).
tcf(c_4180,plain,
! [X0: $i] :
( member(X0,iPr_def_13)
| member(X0,iPr_def_12)
| ~ member(X0,universal_class) ),
inference(superposition,[status(thm)],[c_2977,c_184]) ).
tcf(c_4267,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),universal_class) ),
inference(superposition,[status(thm)],[c_163,c_4123]) ).
tcf(c_4778,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),iPr_def_13)
| member(not_subclass_element(X0,X1),iPr_def_12) ),
inference(superposition,[status(thm)],[c_4267,c_4180]) ).
tcf(c_15944,plain,
! [X0: $i] :
( subclass(X0,iPr_def_13)
| member(not_subclass_element(X0,iPr_def_13),iPr_def_12) ),
inference(superposition,[status(thm)],[c_4778,c_164]) ).
tcf(c_15969,plain,
! [X0: $i] :
( subclass(X0,iPr_def_13)
| member(not_subclass_element(X0,iPr_def_13),iPr_def_10) ),
inference(superposition,[status(thm)],[c_15944,c_3878]) ).
tcf(c_16026,plain,
! [X0: $i] :
( subclass(X0,iPr_def_13)
| ~ member(not_subclass_element(X0,iPr_def_13),x) ),
inference(superposition,[status(thm)],[c_15969,c_3976]) ).
tcf(c_17289,plain,
subclass(x,iPr_def_13),
inference(superposition,[status(thm)],[c_163,c_16026]) ).
tcf(c_17294,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_17289,c_2978]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET194-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 10:13:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 10.12/2.65 % SZS status Started for theBenchmark.p
% 10.12/2.65 % SZS status Unsatisfiable for theBenchmark.p
% 10.12/2.65
% 10.12/2.65 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.12/2.65
% 10.12/2.65 % ------ iProver source info
% 10.12/2.65
% 10.12/2.65 % git: date: 2026-07-19 20:42:38 +0200
% 10.12/2.65 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.12/2.65 % git: non_committed_changes: false
% 10.12/2.65
% 10.12/2.65 % ------ Parsing...% successful
% 10.12/2.65
% 10.12/2.65
% 10.12/2.65 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.12/2.65
% 10.12/2.65 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 10.12/2.65
% 10.12/2.65 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.12/2.65
% 10.12/2.65 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.12/2.65 % ------ Proving...
% 10.12/2.65 % ------ Problem Properties
% 10.12/2.65
% 10.12/2.65 %
% 10.12/2.65 % clauses 86
% 10.12/2.65 % conjectures 1
% 10.12/2.65 % EPR 13
% 10.12/2.65 % Horn 78
% 10.12/2.65 % unary 25
% 10.12/2.65 % binary 40
% 10.12/2.65 % lits 174
% 10.12/2.65 % lits eq 29
% 10.12/2.65 % fd_pure 0
% 10.12/2.65 % fd_pseudo 0
% 10.12/2.65 % fd_cond 3
% 10.12/2.65 % fd_pseudo_cond 7
% 10.12/2.65 % AC symbols 0
% 10.12/2.65
% 10.12/2.65 % ------ Schedule dynamic 5 is on
% 10.12/2.65
% 10.12/2.65 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.12/2.65
% 10.12/2.65
% 10.12/2.65 % ------
% 10.12/2.65 % Current options:
% 10.12/2.65 % ------
% 10.12/2.65
% 10.12/2.65
% 10.12/2.65 %
% 10.12/2.65
% 10.12/2.65 % ------ Proving...
% 10.12/2.65 %
% 10.12/2.65
% 10.12/2.65 % SZS status Unsatisfiable for theBenchmark.p
% 10.12/2.65
% 10.12/2.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.12/2.65
% 10.12/2.65
%------------------------------------------------------------------------------