%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET516-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 : n016.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:21 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 20 unt; 1 def)
% Number of atoms : 124 ( 35 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 73 ( 31 ~; 42 |; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 63 !; 0 ?; 40 :)
% 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(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(f69,axiom,
! [X0] :
( intersection(X0,regular(X0)) = null_class
| X0 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
fof(f70,plain,
! [X0] :
( null_class = intersection(X0,regular(X0))
| null_class = X0 ),
inference(reorient_equations,[],[f69]) ).
fof(f122,negated_conjecture,
singleton(x) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_no_class_belongs_to_itself_1) ).
fof(f123,plain,
x = singleton(x),
inference(reorient_equations,[],[f122]) ).
fof(f186,plain,
x = unordered_pair(x,x),
inference(definition_unfolding,[],[f123,f12]) ).
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_165,plain,
! [X0: $i] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f4]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f11]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_214,plain,
! [X0: $i] :
( member(regular(X0),X0)
| ( X0 = null_class ) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_215,plain,
! [X0: $i] :
( ( X0 = null_class )
| ( intersection(X0,regular(X0)) = null_class ) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_255,negated_conjecture,
unordered_pair(x,x) = x,
inference(cnf_transformation,[],[f186]) ).
tcf(c_2974,definition,
iPr_def_10 = unordered_pair(x,x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2975,negated_conjecture,
iPr_def_10 = x,
inference(demodulation,[status(thm)],[c_255,c_2974]) ).
tcf(c_3816,plain,
unordered_pair(iPr_def_10,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2974,c_2975]) ).
tcf(c_3817,plain,
member(iPr_def_10,universal_class),
inference(superposition,[status(thm)],[c_3816,c_172]) ).
tcf(c_3853,plain,
( member(iPr_def_10,iPr_def_10)
| ~ member(iPr_def_10,universal_class) ),
inference(superposition,[status(thm)],[c_3816,c_170]) ).
tcf(c_3854,plain,
member(iPr_def_10,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_3853,c_3817]) ).
tcf(c_3902,plain,
! [X0: $i,X1: $i] :
( subclass(complement(X0),X1)
| ~ member(not_subclass_element(complement(X0),X1),X0) ),
inference(superposition,[status(thm)],[c_163,c_183]) ).
tcf(c_3903,plain,
! [X0: $i] :
( ( complement(X0) = null_class )
| ~ member(regular(complement(X0)),X0) ),
inference(superposition,[status(thm)],[c_214,c_183]) ).
tcf(c_3908,plain,
( ( complement(universal_class) = null_class )
| ~ member(regular(complement(universal_class)),universal_class) ),
inference(instantiation,[status(thm)],[c_3903]) ).
tcf(c_3990,plain,
! [X0: $i,X1: $i] :
( member(X0,universal_class)
| ~ member(X0,X1) ),
inference(superposition,[status(thm)],[c_165,c_162]) ).
tcf(c_4104,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),universal_class) ),
inference(superposition,[status(thm)],[c_163,c_3990]) ).
tcf(c_4326,plain,
! [X0: $i] : subclass(complement(universal_class),X0),
inference(superposition,[status(thm)],[c_4104,c_3902]) ).
tcf(c_4348,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| ~ member(X0,complement(universal_class)) ),
inference(superposition,[status(thm)],[c_4326,c_162]) ).
tcf(c_4372,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3816,c_169]) ).
tcf(c_4417,plain,
! [X0: $i] :
( member(regular(complement(universal_class)),X0)
| ( complement(universal_class) = null_class ) ),
inference(superposition,[status(thm)],[c_214,c_4348]) ).
tcf(c_4420,plain,
( member(regular(complement(universal_class)),universal_class)
| ( complement(universal_class) = null_class ) ),
inference(instantiation,[status(thm)],[c_4417]) ).
tcf(c_4426,plain,
( ( null_class = iPr_def_10 )
| ( regular(iPr_def_10) = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_214,c_4372]) ).
tcf(c_4456,plain,
( ( null_class = iPr_def_10 )
| ( intersection(iPr_def_10,iPr_def_10) = null_class ) ),
inference(superposition,[status(thm)],[c_4426,c_215]) ).
tcf(c_4475,plain,
! [X0: $i] :
( member(X0,null_class)
| ( null_class = iPr_def_10 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_4456,c_182]) ).
tcf(c_4736,plain,
complement(universal_class) = null_class,
inference(global_subsumption_just,[status(thm)],[c_4417,c_3908,c_4420]) ).
tcf(c_4739,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| ~ member(X0,null_class) ),
inference(demodulation,[status(thm)],[c_4348,c_4736]) ).
tcf(c_4750,plain,
! [X0: $i] :
( ~ member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(superposition,[status(thm)],[c_4736,c_183]) ).
tcf(c_4760,plain,
! [X0: $i] : ~ member(X0,null_class),
inference(global_subsumption_just,[status(thm)],[c_4739,c_3990,c_4739,c_4750]) ).
tcf(c_6754,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_10)
| ( null_class = iPr_def_10 ) ),
inference(global_subsumption_just,[status(thm)],[c_4475,c_3990,c_4475,c_4739,c_4750]) ).
tcf(c_6755,plain,
! [X0: $i] :
( ( null_class = iPr_def_10 )
| ~ member(X0,iPr_def_10) ),
inference(renaming,[status(thm)],[c_6754]) ).
tcf(c_6764,plain,
null_class = iPr_def_10,
inference(superposition,[status(thm)],[c_3854,c_6755]) ).
tcf(c_6780,plain,
! [X0: $i] : ~ member(X0,iPr_def_10),
inference(demodulation,[status(thm)],[c_4760,c_6764]) ).
tcf(c_6807,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_3854,c_6780]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET516-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 11:14:59 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.27/1.72 % SZS status Started for theBenchmark.p
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72
% 1.27/1.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.27/1.72
% 1.27/1.72 % ------ iProver source info
% 1.27/1.72
% 1.27/1.72 % git: date: 2026-07-19 20:42:38 +0200
% 1.27/1.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.27/1.72 % git: non_committed_changes: false
% 1.27/1.72
% 1.27/1.72 % ------ Parsing...% successful
% 1.27/1.72
% 1.27/1.72
% 1.27/1.72 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.27/1.72
% 1.27/1.72 % ------ 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 %
% 1.27/1.72
% 1.27/1.72 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.27/1.72
% 1.27/1.72 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.27/1.72 % ------ Proving...
% 1.27/1.72 % ------ Problem Properties
% 1.27/1.72
% 1.27/1.72 %
% 1.27/1.72 % clauses 83
% 1.27/1.72 % conjectures 1
% 1.27/1.72 % EPR 13
% 1.27/1.72 % Horn 75
% 1.27/1.72 % unary 22
% 1.27/1.72 % binary 40
% 1.27/1.72 % lits 171
% 1.27/1.72 % lits eq 27
% 1.27/1.72 % fd_pure 0
% 1.27/1.72 % fd_pseudo 0
% 1.27/1.72 % fd_cond 3
% 1.27/1.72 % fd_pseudo_cond 7
% 1.27/1.72 % AC symbols 0
% 1.27/1.72
% 1.27/1.72 % ------ Schedule dynamic 5 is on
% 1.27/1.72
% 1.27/1.72 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.27/1.72
% 1.27/1.72
% 1.27/1.72 % ------
% 1.27/1.72 % Current options:
% 1.27/1.72 % ------
% 1.27/1.72
% 1.27/1.72
% 1.27/1.72 %
% 1.27/1.72
% 1.27/1.72 % ------ Proving...
% 1.27/1.72 %
% 1.27/1.72
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72
% 1.27/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.27/1.72
% 1.27/1.72
%------------------------------------------------------------------------------