%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET096-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 : n005.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:34 PM UTC 2026
% Result : Unsatisfiable 4.14s 6.31s
% Output : CNFRefutation 4.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 21 unt; 1 def)
% Number of atoms : 98 ( 33 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 59 ( 28 ~; 31 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 16 :)
% 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(f7,axiom,
! [X0,X1] :
( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
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(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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,
subclass(x,singleton(y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_1) ).
fof(f102,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_2) ).
fof(f103,plain,
null_class != x,
inference(reorient_equations,[],[f102]) ).
fof(f104,negated_conjecture,
singleton(y) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_3) ).
fof(f105,plain,
x != singleton(y),
inference(reorient_equations,[],[f104]) ).
fof(f154,plain,
subclass(x,unordered_pair(y,y)),
inference(definition_unfolding,[],[f101,f12]) ).
fof(f155,plain,
x != unordered_pair(y,y),
inference(definition_unfolding,[],[f105,f12]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_195,plain,
! [X0: $i] :
( member(regular(X0),X0)
| ( X0 = null_class ) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_218,negated_conjecture,
subclass(x,unordered_pair(y,y)),
inference(cnf_transformation,[],[f154]) ).
tcf(c_219,negated_conjecture,
x != null_class,
inference(cnf_transformation,[],[f103]) ).
tcf(c_220,negated_conjecture,
unordered_pair(y,y) != x,
inference(cnf_transformation,[],[f155]) ).
tcf(c_2652,definition,
iPr_def_10 = unordered_pair(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2653,negated_conjecture,
iPr_def_10 != x,
inference(demodulation,[status(thm)],[c_220,c_2652]) ).
tcf(c_2654,negated_conjecture,
x != null_class,
inference(demodulation,[status(thm)],[c_219]) ).
tcf(c_2655,negated_conjecture,
subclass(x,iPr_def_10),
inference(demodulation,[status(thm)],[c_218]) ).
tcf(c_3537,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,x) ),
inference(superposition,[status(thm)],[c_2655,c_143]) ).
tcf(c_3571,plain,
( member(regular(x),iPr_def_10)
| ( x = null_class ) ),
inference(superposition,[status(thm)],[c_195,c_3537]) ).
tcf(c_3572,plain,
member(regular(x),iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_3571,c_2654]) ).
tcf(c_3648,plain,
( ( x = iPr_def_10 )
| ~ subclass(iPr_def_10,x) ),
inference(superposition,[status(thm)],[c_2655,c_149]) ).
tcf(c_3968,plain,
! [X0: $i] :
( ( X0 = y )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2652,c_150]) ).
tcf(c_4014,plain,
! [X0: $i] :
( subclass(iPr_def_10,X0)
| ( not_subclass_element(iPr_def_10,X0) = y ) ),
inference(superposition,[status(thm)],[c_144,c_3968]) ).
tcf(c_4017,plain,
regular(x) = y,
inference(superposition,[status(thm)],[c_3572,c_3968]) ).
tcf(c_4033,plain,
( member(y,x)
| ( x = null_class ) ),
inference(superposition,[status(thm)],[c_4017,c_195]) ).
tcf(c_4034,plain,
member(y,x),
inference(forward_subsumption_resolution,[status(thm)],[c_4033,c_2654]) ).
tcf(c_4220,plain,
( ( iPr_def_10 = x )
| ~ subclass(iPr_def_10,x)
| ~ subclass(x,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_149]) ).
tcf(c_4227,plain,
( ( x = iPr_def_10 )
| ( not_subclass_element(iPr_def_10,x) = y ) ),
inference(superposition,[status(thm)],[c_4014,c_3648]) ).
tcf(c_4263,plain,
( subclass(iPr_def_10,x)
| ( x = iPr_def_10 )
| ~ member(y,x) ),
inference(superposition,[status(thm)],[c_4227,c_145]) ).
tcf(c_4265,plain,
( subclass(iPr_def_10,x)
| ( x = iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4263,c_4034]) ).
tcf(c_4268,plain,
x = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_4265,c_2653,c_2655,c_4220,c_4265]) ).
tcf(c_4282,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_2653,c_4268]) ).
tcf(c_4284,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_4282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET096-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.12/5.39 % Computer : n005.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Thu Sep 24 09:46:07 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.44
% 0.16/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.44
% 0.16/5.44 % Detected problem language: tptp
% 0.16/5.46 % Proving...
% 4.14/6.31 % SZS status Started for theBenchmark.p
% 4.14/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 4.14/6.31
% 4.14/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.14/6.31
% 4.14/6.31 % ------ iProver source info
% 4.14/6.31
% 4.14/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.14/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.14/6.31 % git: non_committed_changes: false
% 4.14/6.31
% 4.14/6.31 % ------ Parsing...% successful
% 4.14/6.31
% 4.14/6.31
% 4.14/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.14/6.31
% 4.14/6.31 % ------ 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 %
% 4.14/6.31
% 4.14/6.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.14/6.31
% 4.14/6.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.14/6.31 % ------ Proving...
% 4.14/6.31 % ------ Problem Properties
% 4.14/6.31
% 4.14/6.31 %
% 4.14/6.31 % clauses 71
% 4.14/6.31 % conjectures 3
% 4.14/6.31 % EPR 15
% 4.14/6.31 % Horn 63
% 4.14/6.31 % unary 19
% 4.14/6.31 % binary 32
% 4.14/6.31 % lits 149
% 4.14/6.31 % lits eq 23
% 4.14/6.31 % fd_pure 0
% 4.14/6.31 % fd_pseudo 0
% 4.14/6.31 % fd_cond 3
% 4.14/6.31 % fd_pseudo_cond 3
% 4.14/6.31 % AC symbols 0
% 4.14/6.31
% 4.14/6.31 % ------ Schedule dynamic 5 is on
% 4.14/6.31
% 4.14/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.14/6.31
% 4.14/6.31
% 4.14/6.31 % ------
% 4.14/6.31 % Current options:
% 4.14/6.31 % ------
% 4.14/6.31
% 4.14/6.31
% 4.14/6.31 %
% 4.14/6.31
% 4.14/6.31 % ------ Proving...
% 4.14/6.31 %
% 4.14/6.31
% 4.14/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 4.14/6.31
% 4.14/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.14/6.31
% 4.14/6.31
%------------------------------------------------------------------------------