%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET064-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 : 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:20 PM UTC 2026
% Result : Unsatisfiable 2.84s 1.29s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 13 unt; 1 def)
% Number of atoms : 48 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
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(f21,axiom,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(f101,negated_conjecture,
z != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_class_is_unique_1) ).
fof(f102,plain,
null_class != z,
inference(reorient_equations,[],[f101]) ).
fof(f103,negated_conjecture,
~ member(not_subclass_element(z,null_class),z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_class_is_unique_2) ).
tcf(c_143,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_195,plain,
! [X0: $i] :
( ( X0 = null_class )
| ( intersection(X0,regular(X0)) = null_class ) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_217,negated_conjecture,
z != null_class,
inference(cnf_transformation,[],[f102]) ).
tcf(c_218,negated_conjecture,
~ member(not_subclass_element(z,null_class),z),
inference(cnf_transformation,[],[f103]) ).
tcf(c_2646,definition,
iPr_def_10 = not_subclass_element(z,null_class),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2647,negated_conjecture,
~ member(iPr_def_10,z),
inference(demodulation,[status(thm)],[c_218,c_2646]) ).
tcf(c_2648,negated_conjecture,
z != null_class,
inference(demodulation,[status(thm)],[c_217]) ).
tcf(c_3429,plain,
( subclass(z,null_class)
| member(iPr_def_10,z) ),
inference(superposition,[status(thm)],[c_2646,c_143]) ).
tcf(c_3430,plain,
subclass(z,null_class),
inference(forward_subsumption_resolution,[status(thm)],[c_3429,c_2647]) ).
tcf(c_3461,plain,
! [X0: $i,X1: $i,X2: $i] :
( subclass(intersection(X0,X1),X2)
| member(not_subclass_element(intersection(X0,X1),X2),X0) ),
inference(superposition,[status(thm)],[c_143,c_160]) ).
tcf(c_3679,plain,
( ( z = null_class )
| ~ subclass(null_class,z) ),
inference(superposition,[status(thm)],[c_3430,c_148]) ).
tcf(c_3683,plain,
~ subclass(null_class,z),
inference(forward_subsumption_resolution,[status(thm)],[c_3679,c_2648]) ).
tcf(c_4073,plain,
! [X0: $i,X1: $i] : subclass(intersection(X0,X1),X0),
inference(superposition,[status(thm)],[c_3461,c_144]) ).
tcf(c_4224,plain,
! [X0: $i] :
( subclass(null_class,X0)
| ( X0 = null_class ) ),
inference(superposition,[status(thm)],[c_195,c_4073]) ).
tcf(c_4251,plain,
z = null_class,
inference(superposition,[status(thm)],[c_4224,c_3683]) ).
tcf(c_4252,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4251,c_2648]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET064-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.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 09:32:13 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.84/1.29 % SZS status Started for theBenchmark.p
% 2.84/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.29
% 2.84/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.84/1.29
% 2.84/1.29 % ------ iProver source info
% 2.84/1.29
% 2.84/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.84/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.84/1.29 % git: non_committed_changes: false
% 2.84/1.29
% 2.84/1.29 % ------ Parsing...% successful
% 2.84/1.29
% 2.84/1.29
% 2.84/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.84/1.29
% 2.84/1.29 % ------ 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 %
% 2.84/1.29
% 2.84/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.84/1.29
% 2.84/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.84/1.29 % ------ Proving...
% 2.84/1.29 % ------ Problem Properties
% 2.84/1.29
% 2.84/1.29 %
% 2.84/1.29 % clauses 70
% 2.84/1.29 % conjectures 2
% 2.84/1.29 % EPR 14
% 2.84/1.29 % Horn 62
% 2.84/1.29 % unary 18
% 2.84/1.29 % binary 32
% 2.84/1.29 % lits 148
% 2.84/1.29 % lits eq 22
% 2.84/1.29 % fd_pure 0
% 2.84/1.29 % fd_pseudo 0
% 2.84/1.29 % fd_cond 3
% 2.84/1.29 % fd_pseudo_cond 3
% 2.84/1.29 % AC symbols 0
% 2.84/1.29
% 2.84/1.29 % ------ Schedule dynamic 5 is on
% 2.84/1.29
% 2.84/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.84/1.29
% 2.84/1.29
% 2.84/1.29 % ------
% 2.84/1.29 % Current options:
% 2.84/1.29 % ------
% 2.84/1.29
% 2.84/1.29
% 2.84/1.29 %
% 2.84/1.29
% 2.84/1.29 % ------ Proving...
% 2.84/1.29 %
% 2.84/1.29
% 2.84/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.29
% 2.84/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.29
% 2.84/1.29
%------------------------------------------------------------------------------