%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n001.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:31 PM UTC 2026
% Result : Unsatisfiable 3.62s 1.27s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 66 ( 27 unt; 2 def)
% Number of atoms : 141 ( 44 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 88 ( 41 ~; 47 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 67 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f21,axiom,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f22,axiom,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f67,axiom,
! [X0] :
( member(regular(X0),X0)
| X0 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
fof(f68,plain,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f67]) ).
fof(f101,negated_conjecture,
unordered_pair(y,z) = singleton(x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).
fof(f102,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).
fof(f103,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).
fof(f104,plain,
y != x,
inference(reorient_equations,[],[f103]) ).
fof(f105,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).
fof(f106,plain,
z != x,
inference(reorient_equations,[],[f105]) ).
fof(f155,plain,
unordered_pair(y,z) = unordered_pair(x,x),
inference(definition_unfolding,[],[f101,f12]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subclass(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_196,plain,
! [X0: $i] :
( member(regular(X0),X0)
| ( X0 = null_class ) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_219,negated_conjecture,
unordered_pair(y,z) = unordered_pair(x,x),
inference(cnf_transformation,[],[f155]) ).
tcf(c_220,negated_conjecture,
member(x,universal_class),
inference(cnf_transformation,[],[f102]) ).
tcf(c_221,negated_conjecture,
y != x,
inference(cnf_transformation,[],[f104]) ).
tcf(c_222,negated_conjecture,
z != x,
inference(cnf_transformation,[],[f106]) ).
tcf(c_2658,definition,
iPr_def_10 = unordered_pair(y,z),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2659,definition,
iPr_def_11 = unordered_pair(x,x),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2660,negated_conjecture,
z != x,
inference(demodulation,[status(thm)],[c_222]) ).
tcf(c_2661,negated_conjecture,
y != x,
inference(demodulation,[status(thm)],[c_221]) ).
tcf(c_2662,negated_conjecture,
member(x,universal_class),
inference(demodulation,[status(thm)],[c_220]) ).
tcf(c_2663,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_219,c_2659,c_2658]) ).
tcf(c_3427,plain,
unordered_pair(x,x) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2659,c_2663]) ).
tcf(c_3463,plain,
( member(x,iPr_def_10)
| ~ member(x,universal_class) ),
inference(superposition,[status(thm)],[c_3427,c_152]) ).
tcf(c_3464,plain,
member(x,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_3463,c_2662]) ).
tcf(c_3480,plain,
! [X0: $i,X1: $i] :
( member(regular(intersection(X0,X1)),X0)
| ( intersection(X0,X1) = null_class ) ),
inference(superposition,[status(thm)],[c_196,c_162]) ).
tcf(c_3508,plain,
! [X0: $i,X1: $i] :
( member(regular(intersection(X0,X1)),X1)
| ( intersection(X0,X1) = null_class ) ),
inference(superposition,[status(thm)],[c_196,c_163]) ).
tcf(c_3580,plain,
! [X0: $i] :
( member(x,X0)
| ~ subclass(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_3464,c_144]) ).
tcf(c_4044,plain,
! [X0: $i] :
( ( X0 = x )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3427,c_151]) ).
tcf(c_4078,plain,
( ~ member(x,universal_class)
| ~ member(x,complement(universal_class)) ),
inference(instantiation,[status(thm)],[c_165]) ).
tcf(c_4114,plain,
! [X0: $i] :
( subclass(iPr_def_10,X0)
| ( not_subclass_element(iPr_def_10,X0) = x ) ),
inference(superposition,[status(thm)],[c_145,c_4044]) ).
tcf(c_4117,plain,
! [X0: $i] :
( ( intersection(iPr_def_10,X0) = null_class )
| ( regular(intersection(iPr_def_10,X0)) = x ) ),
inference(superposition,[status(thm)],[c_3480,c_4044]) ).
tcf(c_4118,plain,
! [X0: $i] :
( ( intersection(X0,iPr_def_10) = null_class )
| ( regular(intersection(X0,iPr_def_10)) = x ) ),
inference(superposition,[status(thm)],[c_3508,c_4044]) ).
tcf(c_4145,plain,
! [X0: $i] :
( member(x,X0)
| ( not_subclass_element(iPr_def_10,X0) = x ) ),
inference(superposition,[status(thm)],[c_4114,c_3580]) ).
tcf(c_4198,plain,
! [X0: $i] :
( ( not_subclass_element(iPr_def_10,complement(X0)) = x )
| ~ member(x,X0) ),
inference(superposition,[status(thm)],[c_4145,c_165]) ).
tcf(c_4228,plain,
! [X0: $i] :
( member(x,X0)
| ( intersection(iPr_def_10,X0) = null_class ) ),
inference(superposition,[status(thm)],[c_4117,c_3508]) ).
tcf(c_4335,plain,
! [X0: $i,X1: $i] :
( ( X1 = x )
| ( X0 = x )
| ( intersection(iPr_def_10,unordered_pair(X0,X1)) = null_class ) ),
inference(superposition,[status(thm)],[c_4228,c_151]) ).
tcf(c_4465,plain,
! [X0: $i] :
( member(x,X0)
| ( intersection(X0,iPr_def_10) = null_class ) ),
inference(superposition,[status(thm)],[c_4118,c_3480]) ).
tcf(c_4702,plain,
not_subclass_element(iPr_def_10,complement(universal_class)) = x,
inference(superposition,[status(thm)],[c_2662,c_4198]) ).
tcf(c_4909,plain,
( subclass(iPr_def_10,complement(universal_class))
| ~ member(x,complement(universal_class)) ),
inference(superposition,[status(thm)],[c_4702,c_146]) ).
tcf(c_4997,plain,
~ member(x,complement(universal_class)),
inference(global_subsumption_just,[status(thm)],[c_4909,c_220,c_4078]) ).
tcf(c_5002,plain,
intersection(complement(universal_class),iPr_def_10) = null_class,
inference(superposition,[status(thm)],[c_4465,c_4997]) ).
tcf(c_5286,plain,
! [X0: $i] :
( member(X0,complement(universal_class))
| ~ member(X0,null_class) ),
inference(superposition,[status(thm)],[c_5002,c_162]) ).
tcf(c_5365,plain,
~ member(x,null_class),
inference(superposition,[status(thm)],[c_5286,c_4997]) ).
tcf(c_6215,plain,
( ( z = x )
| ( y = x )
| ( intersection(iPr_def_10,iPr_def_10) = null_class ) ),
inference(superposition,[status(thm)],[c_2658,c_4335]) ).
tcf(c_6224,plain,
intersection(iPr_def_10,iPr_def_10) = null_class,
inference(forward_subsumption_resolution,[status(thm)],[c_6215,c_2660,c_2661]) ).
tcf(c_6465,plain,
! [X0: $i] :
( member(X0,null_class)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_6224,c_164]) ).
tcf(c_6497,plain,
member(x,null_class),
inference(superposition,[status(thm)],[c_3464,c_6465]) ).
tcf(c_6510,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6497,c_5365]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 09:46:52 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.62/1.27 % SZS status Started for theBenchmark.p
% 3.62/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.27
% 3.62/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.62/1.27
% 3.62/1.27 % ------ iProver source info
% 3.62/1.27
% 3.62/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.62/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.62/1.27 % git: non_committed_changes: false
% 3.62/1.27
% 3.62/1.27 % ------ Parsing...% successful
% 3.62/1.27
% 3.62/1.27
% 3.62/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.62/1.27
% 3.62/1.27 % ------ 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: 2 0s sf_e pe_s pe_e %
% 3.62/1.27
% 3.62/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.62/1.27
% 3.62/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.27 % ------ Proving...
% 3.62/1.27 % ------ Problem Properties
% 3.62/1.27
% 3.62/1.27 %
% 3.62/1.27 % clauses 73
% 3.62/1.27 % conjectures 4
% 3.62/1.27 % EPR 16
% 3.62/1.27 % Horn 65
% 3.62/1.27 % unary 21
% 3.62/1.27 % binary 32
% 3.62/1.27 % lits 151
% 3.62/1.27 % lits eq 25
% 3.62/1.27 % fd_pure 0
% 3.62/1.27 % fd_pseudo 0
% 3.62/1.27 % fd_cond 3
% 3.62/1.27 % fd_pseudo_cond 3
% 3.62/1.27 % AC symbols 0
% 3.62/1.27
% 3.62/1.27 % ------ Schedule dynamic 5 is on
% 3.62/1.27
% 3.62/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.27
% 3.62/1.27
% 3.62/1.27 % ------
% 3.62/1.27 % Current options:
% 3.62/1.27 % ------
% 3.62/1.27
% 3.62/1.27
% 3.62/1.27 %
% 3.62/1.27
% 3.62/1.27 % ------ Proving...
% 3.62/1.27 %
% 3.62/1.27
% 3.62/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.27
% 3.62/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.27
% 3.62/1.27
%------------------------------------------------------------------------------