%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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:57:17 PM UTC 2026
% Result : Theorem 3.75s 1.26s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 65 ( 40 unt; 4 def)
% Number of atoms : 155 ( 47 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 84 ( 35 ~; 27 |; 17 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 71 !; 1 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( rel_str(X0)
=> ( strict_rel_str(X0)
=> X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstractness_v1_orders_2) ).
fof(f27,axiom,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yellow_1) ).
fof(f31,axiom,
! [X0] :
( relation_of2_as_subset(inclusion_order(X0),X0,X0)
& v1_partfun1(inclusion_order(X0),X0,X0)
& transitive(inclusion_order(X0))
& antisymmetric(inclusion_order(X0))
& reflexive(inclusion_order(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_yellow_1) ).
fof(f33,axiom,
! [X0] :
( rel_str(incl_POSet(X0))
& strict_rel_str(incl_POSet(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(f55,axiom,
! [X0] :
( antisymmetric_relstr(incl_POSet(X0))
& transitive_relstr(incl_POSet(X0))
& reflexive_relstr(incl_POSet(X0))
& strict_rel_str(incl_POSet(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc5_yellow_1) ).
fof(f60,axiom,
! [X0,X1] :
( relation_of2(X1,X0,X0)
=> ! [X2,X3] :
( rel_str_of(X0,X1) = rel_str_of(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(f77,axiom,
! [X0] : inclusion_order(X0) = inclusion_relation(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_yellow_1) ).
fof(f78,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
<=> relation_of2(X2,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(f84,conjecture,
! [X0] : the_carrier(boole_POSet(X0)) = powerset(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(f85,negated_conjecture,
~ ! [X0] : the_carrier(boole_POSet(X0)) = powerset(X0),
inference(negated_conjecture,[status(cth)],[f84]) ).
fof(f86,axiom,
! [X0] : boole_POSet(X0) = incl_POSet(powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_yellow_1) ).
fof(f93,plain,
! [X0] :
( relation_of2_as_subset(inclusion_order(X0),X0,X0)
& transitive(inclusion_order(X0))
& antisymmetric(inclusion_order(X0))
& reflexive(inclusion_order(X0)) ),
inference(pure_predicate_removal,[],[f31]) ).
fof(f94,plain,
! [X0] :
( relation_of2_as_subset(inclusion_order(X0),X0,X0)
& antisymmetric(inclusion_order(X0))
& reflexive(inclusion_order(X0)) ),
inference(pure_predicate_removal,[],[f93]) ).
fof(f95,plain,
! [X0] :
( relation_of2_as_subset(inclusion_order(X0),X0,X0)
& reflexive(inclusion_order(X0)) ),
inference(pure_predicate_removal,[],[f94]) ).
fof(f96,plain,
! [X0] : relation_of2_as_subset(inclusion_order(X0),X0,X0),
inference(pure_predicate_removal,[],[f95]) ).
fof(f99,plain,
! [X0] :
( ~ rel_str(X0)
| ~ strict_rel_str(X0)
| X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0)) ),
inference(ennf_transformation,[],[f1]) ).
fof(f100,plain,
! [X0] :
( ~ rel_str(X0)
| ~ strict_rel_str(X0)
| X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0)) ),
inference(flattening,[],[f99]) ).
fof(f161,plain,
! [X0,X1] :
( ~ relation_of2(X1,X0,X0)
| ! [X2,X3] :
( rel_str_of(X0,X1) != rel_str_of(X2,X3)
| ( X1 = X3
& X0 = X2 ) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f173,plain,
? [X0] : powerset(X0) != the_carrier(boole_POSet(X0)),
inference(ennf_transformation,[],[f85]) ).
fof(f214,plain,
! [X0,X1,X2] :
( ( ~ relation_of2_as_subset(X2,X0,X1)
| relation_of2(X2,X0,X1) )
& ( ~ relation_of2(X2,X0,X1)
| relation_of2_as_subset(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f215,plain,
powerset(sK26) != the_carrier(boole_POSet(sK26)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26]),skolemize(X0,sK26)],[f173]) ).
fof(f216,plain,
! [X0] :
( ~ rel_str(X0)
| ~ strict_rel_str(X0)
| rel_str_of(the_carrier(X0),the_InternalRel(X0)) = X0 ),
inference(cnf_transformation,[],[f100]) ).
fof(f323,plain,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f326,plain,
! [X0] : relation_of2_as_subset(inclusion_order(X0),X0,X0),
inference(cnf_transformation,[],[f96]) ).
fof(f327,plain,
! [X0] : rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f33]) ).
fof(f362,plain,
! [X0] : strict_rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f55]) ).
fof(f400,plain,
! [X2,X3,X0,X1] :
( ~ relation_of2(X1,X0,X0)
| rel_str_of(X0,X1) != rel_str_of(X2,X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f161]) ).
fof(f493,plain,
! [X0] : inclusion_order(X0) = inclusion_relation(X0),
inference(cnf_transformation,[],[f77]) ).
fof(f494,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| relation_of2(X2,X0,X1) ),
inference(cnf_transformation,[],[f214]) ).
fof(f501,plain,
powerset(sK26) != the_carrier(boole_POSet(sK26)),
inference(cnf_transformation,[],[f215]) ).
fof(f502,plain,
! [X0] : boole_POSet(X0) = incl_POSet(powerset(X0)),
inference(cnf_transformation,[],[f86]) ).
fof(f507,plain,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_relation(X0)),
inference(definition_unfolding,[],[f323,f493]) ).
fof(f508,plain,
! [X0] : boole_POSet(X0) = rel_str_of(powerset(X0),inclusion_relation(powerset(X0))),
inference(definition_unfolding,[],[f502,f507]) ).
fof(f509,plain,
! [X0] : relation_of2_as_subset(inclusion_relation(X0),X0,X0),
inference(definition_unfolding,[],[f326,f493]) ).
fof(f511,plain,
! [X0] : rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(definition_unfolding,[],[f327,f507]) ).
fof(f528,plain,
! [X0] : strict_rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(definition_unfolding,[],[f362,f507]) ).
fof(f568,plain,
powerset(sK26) != the_carrier(rel_str_of(powerset(sK26),inclusion_relation(powerset(sK26)))),
inference(definition_unfolding,[],[f501,f508]) ).
tcf(c_49,plain,
! [X0: $i] :
( ( rel_str_of(the_carrier(X0),the_InternalRel(X0)) = X0 )
| ~ rel_str(X0)
| ~ strict_rel_str(X0) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_139,plain,
! [X0: $i] : relation_of2_as_subset(inclusion_relation(X0),X0,X0),
inference(cnf_transformation,[],[f509]) ).
tcf(c_141,plain,
! [X0: $i] : rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(cnf_transformation,[],[f511]) ).
tcf(c_172,plain,
! [X0: $i] : strict_rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(cnf_transformation,[],[f528]) ).
tcf(c_212,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ~ relation_of2(X1,X0,X0)
| ( rel_str_of(X0,X1) != rel_str_of(X2,X3) ) ),
inference(cnf_transformation,[],[f400]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i,X2: $i] :
( relation_of2(X0,X1,X2)
| ~ relation_of2_as_subset(X0,X1,X2) ),
inference(cnf_transformation,[],[f494]) ).
tcf(c_313,negated_conjecture,
the_carrier(rel_str_of(powerset(sK26),inclusion_relation(powerset(sK26)))) != powerset(sK26),
inference(cnf_transformation,[],[f568]) ).
tcf(c_409,plain,
! [X0: $i,X1: $i,X2: $i] :
( relation_of2(X0,X1,X2)
| ~ relation_of2_as_subset(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_307]) ).
tcf(c_2482,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( relation_of2(X1,X2,X3)
| ( X0 != X3 )
| ( X0 != X2 )
| ( inclusion_relation(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_409]) ).
tcf(c_2483,plain,
! [X0: $i] : relation_of2(inclusion_relation(X0),X0,X0),
inference(unflattening,[status(thm)],[c_2482]) ).
tcf(c_6385,definition,
iPr_def_10 = powerset(sK26),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_6386,definition,
iPr_def_11 = inclusion_relation(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_6387,definition,
iPr_def_12 = rel_str_of(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6388,definition,
iPr_def_13 = the_carrier(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_6389,negated_conjecture,
iPr_def_13 != iPr_def_10,
inference(demodulation,[status(thm)],[c_313,c_6386,c_6385,c_6387,c_6388]) ).
tcf(c_7091,plain,
rel_str(rel_str_of(iPr_def_10,iPr_def_11)),
inference(superposition,[status(thm)],[c_6386,c_141]) ).
tcf(c_7092,plain,
rel_str(iPr_def_12),
inference(light_normalisation,[status(thm)],[c_7091,c_6387]) ).
tcf(c_7093,plain,
strict_rel_str(rel_str_of(iPr_def_10,iPr_def_11)),
inference(superposition,[status(thm)],[c_6386,c_172]) ).
tcf(c_7094,plain,
strict_rel_str(iPr_def_12),
inference(light_normalisation,[status(thm)],[c_7093,c_6387]) ).
tcf(c_7096,plain,
relation_of2(iPr_def_11,iPr_def_10,iPr_def_10),
inference(superposition,[status(thm)],[c_6386,c_2483]) ).
tcf(c_7120,plain,
( ( rel_str_of(the_carrier(iPr_def_12),the_InternalRel(iPr_def_12)) = iPr_def_12 )
| ~ rel_str(iPr_def_12) ),
inference(superposition,[status(thm)],[c_7094,c_49]) ).
tcf(c_7121,plain,
( ( rel_str_of(iPr_def_13,the_InternalRel(iPr_def_12)) = iPr_def_12 )
| ~ rel_str(iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_7120,c_6388]) ).
tcf(c_7122,plain,
rel_str_of(iPr_def_13,the_InternalRel(iPr_def_12)) = iPr_def_12,
inference(forward_subsumption_resolution,[status(thm)],[c_7121,c_7092]) ).
tcf(c_7454,plain,
! [X0: $i,X1: $i] :
( ( X0 = iPr_def_10 )
| ~ relation_of2(iPr_def_11,iPr_def_10,iPr_def_10)
| ( rel_str_of(X0,X1) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_6387,c_212]) ).
tcf(c_7472,plain,
! [X0: $i,X1: $i] :
( ( X0 = iPr_def_10 )
| ( rel_str_of(X0,X1) != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7454,c_7096]) ).
tcf(c_7751,plain,
iPr_def_10 = iPr_def_13,
inference(superposition,[status(thm)],[c_7122,c_7472]) ).
tcf(c_7768,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_6389,c_7751]) ).
tcf(c_7769,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_7768]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.34 % Computer : n002.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 13:57:49 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.75/1.26 % SZS status Started for theBenchmark.p
% 3.75/1.26 % SZS status Theorem for theBenchmark.p
% 3.75/1.26
% 3.75/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.75/1.26
% 3.75/1.26 % ------ iProver source info
% 3.75/1.26
% 3.75/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.75/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.75/1.26 % git: non_committed_changes: false
% 3.75/1.26
% 3.75/1.26 % ------ Parsing...
% 3.75/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.75/1.26
% 3.75/1.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe_e %
% 3.75/1.26
% 3.75/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.75/1.26
% 3.75/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.75/1.26 % ------ Proving...
% 3.75/1.26 % ------ Problem Properties
% 3.75/1.26
% 3.75/1.26 %
% 3.75/1.26 % clauses 85
% 3.75/1.26 % conjectures 1
% 3.75/1.26 % EPR 33
% 3.75/1.26 % Horn 78
% 3.75/1.26 % unary 54
% 3.75/1.26 % binary 20
% 3.75/1.26 % lits 127
% 3.75/1.26 % lits eq 12
% 3.75/1.26 % fd_pure 0
% 3.75/1.26 % fd_pseudo 0
% 3.75/1.26 % fd_cond 1
% 3.75/1.26 % fd_pseudo_cond 3
% 3.75/1.26 % AC symbols 0
% 3.75/1.26
% 3.75/1.26 % ------ Schedule dynamic 5 is on
% 3.75/1.26
% 3.75/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.75/1.26
% 3.75/1.26
% 3.75/1.26 % ------
% 3.75/1.26 % Current options:
% 3.75/1.26 % ------
% 3.75/1.26
% 3.75/1.26
% 3.75/1.26 %
% 3.75/1.26
% 3.75/1.26 % ------ Proving...
% 3.75/1.26 %
% 3.75/1.26
% 3.75/1.26 % SZS status Theorem for theBenchmark.p
% 3.75/1.26
% 3.75/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.26
% 3.75/1.26
%------------------------------------------------------------------------------