%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Thu Sep 24 02:29:11 PM UTC 2026
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 19 unt; 0 def)
% Number of atoms : 69 ( 28 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 21 ~; 17 |; 13 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(dt_k1_yellow_1,axiom,
! [X1] :
( relation_of2_as_subset(inclusion_order(X1),X1,X1)
& v1_partfun1(inclusion_order(X1),X1,X1)
& transitive(inclusion_order(X1))
& antisymmetric(inclusion_order(X1))
& reflexive(inclusion_order(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_yellow_1) ).
fof(free_g1_orders_2,axiom,
! [X1,X2] :
( relation_of2(X2,X1,X1)
=> ! [X3,X4] :
( rel_str_of(X1,X2) = rel_str_of(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(t4_waybel_7,conjecture,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(abstractness_v1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ( strict_rel_str(X1)
=> X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',abstractness_v1_orders_2) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( rel_str(incl_POSet(X1))
& strict_rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(d1_yellow_1,axiom,
! [X1] : incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_yellow_1) ).
fof(t4_yellow_1,axiom,
! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_yellow_1) ).
fof(c_0_8,plain,
! [X94,X95,X96] :
( ( relation_of2_as_subset(X96,X94,X95)
| ~ relation_of2(X96,X94,X95) )
& ( relation_of2(X96,X94,X95)
| ~ relation_of2_as_subset(X96,X94,X95) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
fof(c_0_9,plain,
! [X37] :
( relation_of2_as_subset(inclusion_order(X37),X37,X37)
& v1_partfun1(inclusion_order(X37),X37,X37)
& transitive(inclusion_order(X37))
& antisymmetric(inclusion_order(X37))
& reflexive(inclusion_order(X37)) ),
inference(variable_rename,[status(thm)],[dt_k1_yellow_1]) ).
fof(c_0_10,plain,
! [X68,X69,X70,X71] :
( ( ~ relation_of2(X69,X68,X68)
| rel_str_of(X68,X69) != rel_str_of(X70,X71)
| X69 = X71 )
& ( ~ relation_of2(X69,X68,X68)
| rel_str_of(X68,X69) != rel_str_of(X70,X71)
| X68 = X70 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[free_g1_orders_2])])])])]) ).
cnf(c_0_11,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
relation_of2_as_subset(inclusion_order(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
inference(assume_negation,[status(cth)],[t4_waybel_7]) ).
cnf(c_0_14,plain,
( ~ relation_of2(X3,X1,X1)
| rel_str_of(X1,X3) != rel_str_of(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
relation_of2(inclusion_order(X1),X1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X5] :
( X5 = rel_str_of(the_carrier(X5),the_InternalRel(X5))
| ~ strict_rel_str(X5)
| ~ rel_str(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[abstractness_v1_orders_2])])]) ).
fof(c_0_17,plain,
! [X38] :
( rel_str(incl_POSet(X38))
& strict_rel_str(incl_POSet(X38)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
fof(c_0_18,plain,
! [X33] : incl_POSet(X33) = rel_str_of(X33,inclusion_order(X33)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
fof(c_0_19,negated_conjecture,
the_carrier(boole_POSet(esk22_0)) != powerset(esk22_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_20,plain,
! [X108] : boole_POSet(X108) = incl_POSet(powerset(X108)),
inference(variable_rename,[status(thm)],[t4_yellow_1]) ).
cnf(c_0_21,plain,
( rel_str_of(X1,inclusion_order(X1)) != rel_str_of(X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ strict_rel_str(X1)
| ~ rel_str(X1)
| X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
the_carrier(boole_POSet(esk22_0)) != powerset(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
boole_POSet(X1) = incl_POSet(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ rel_str(X2)
| ~ strict_rel_str(X2)
| rel_str_of(X1,inclusion_order(X1)) != X2
| X1 = the_carrier(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
strict_rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
the_carrier(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0)))) != powerset(esk22_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_24]) ).
cnf(c_0_32,plain,
the_carrier(rel_str_of(X1,inclusion_order(X1))) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n015.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 06:20:51 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.60 % Version: 3.5.1
% 0.21/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 % Starting sh5l with 300s (1) cores
% 0.21/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 744156 completed with status 0
% 0.21/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.60 % No SInE strategy applied
% 0.21/0.60 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.21/0.60 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.21/0.60 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.60 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.60 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.60 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.60 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 744165 completed with status 0
% 0.21/0.60 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.21/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.60 % No SInE strategy applied
% 0.21/0.60 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.21/0.60 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.21/0.60 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.60 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.60 % Preprocessing time : 0.003 s
% 0.21/0.60 % Presaturation interreduction done
% 0.21/0.60
% 0.21/0.60 % Proof found!
% 0.21/0.60 % SZS status Theorem
% 0.21/0.60 % SZS output start CNFRefutation
% See solution above
% 0.21/0.60 % Parsed axioms : 89
% 0.21/0.60 % Removed by relevancy pruning/SinE : 0
% 0.21/0.60 % Initial clauses : 300
% 0.21/0.60 % Removed in clause preprocessing : 53
% 0.21/0.60 % Initial clauses in saturation : 247
% 0.21/0.60 % Processed clauses : 527
% 0.21/0.60 % ...of these trivial : 40
% 0.21/0.60 % ...subsumed : 42
% 0.21/0.60 % ...remaining for further processing : 445
% 0.21/0.60 % Other redundant clauses eliminated : 0
% 0.21/0.60 % Clauses deleted for lack of memory : 0
% 0.21/0.60 % Backward-subsumed : 1
% 0.21/0.60 % Backward-rewritten : 7
% 0.21/0.60 % Generated clauses : 232
% 0.21/0.60 % ...of the previous two non-redundant : 128
% 0.21/0.60 % ...aggressively subsumed : 0
% 0.21/0.60 % Contextual simplify-reflections : 8
% 0.21/0.60 % Paramodulations : 222
% 0.21/0.60 % Factorizations : 0
% 0.21/0.60 % NegExts : 0
% 0.21/0.60 % Equation resolutions : 7
% 0.21/0.60 % Disequality decompositions : 0
% 0.21/0.60 % Total rewrite steps : 330
% 0.21/0.60 % ...of those cached : 249
% 0.21/0.60 % Propositional unsat checks : 0
% 0.21/0.60 % Propositional check models : 0
% 0.21/0.60 % Propositional check unsatisfiable : 0
% 0.21/0.60 % Propositional clauses : 0
% 0.21/0.60 % Propositional clauses after purity: 0
% 0.21/0.60 % Propositional unsat core size : 0
% 0.21/0.60 % Propositional preprocessing time : 0.000
% 0.21/0.60 % Propositional encoding time : 0.000
% 0.21/0.60 % Propositional solver time : 0.000
% 0.21/0.60 % Success case prop preproc time : 0.000
% 0.21/0.60 % Success case prop encoding time : 0.000
% 0.21/0.60 % Success case prop solver time : 0.000
% 0.21/0.60 % Current number of processed clauses : 245
% 0.21/0.60 % Positive orientable unit clauses : 121
% 0.21/0.60 % Positive unorientable unit clauses: 0
% 0.21/0.60 % Negative unit clauses : 16
% 0.21/0.60 % Non-unit-clauses : 108
% 0.21/0.60 % Current number of unprocessed clauses: 30
% 0.21/0.60 % ...number of literals in the above : 130
% 0.21/0.60 % Current number of archived formulas : 0
% 0.21/0.60 % Current number of archived clauses : 202
% 0.21/0.60 % Clause-clause subsumption calls (NU) : 5768
% 0.21/0.60 % Rec. Clause-clause subsumption calls : 1471
% 0.21/0.60 % Non-unit clause-clause subsumptions : 32
% 0.21/0.60 % Unit Clause-clause subsumption calls : 720
% 0.21/0.60 % Rewrite failures with RHS unbound : 0
% 0.21/0.60 % BW rewrite match attempts : 13
% 0.21/0.60 % BW rewrite match successes : 5
% 0.21/0.60 % Condensation attempts : 0
% 0.21/0.60 % Condensation successes : 0
% 0.21/0.60 % Termbank termtop insertions : 18430
% 0.21/0.60 % Search garbage collected termcells : 1966
% 0.21/0.60
% 0.21/0.60 % -------------------------------------------------
% 0.21/0.60 % User time : 0.032 s
% 0.21/0.60 % System time : 0.010 s
% 0.21/0.60 % Total time : 0.042 s
% 0.21/0.60 % Maximum resident set size: 4232 pages
% 0.21/0.60
% 0.21/0.60 % -------------------------------------------------
% 0.21/0.60 % User time : 0.100 s
% 0.21/0.60 % System time : 0.027 s
% 0.21/0.60 % Total time : 0.126 s
% 0.21/0.60 % Maximum resident set size: 4608 pages
% 0.21/0.60 % E exiting
%------------------------------------------------------------------------------