%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:24:55 PM UTC 2026
% Result : Theorem 0.23s 0.63s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 63 ( 26 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 17 ~; 14 |; 13 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 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 : 45 ( 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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(d1_yellow_1,axiom,
! [X1] : incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yellow_1) ).
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/sandbox/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/sandbox/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(t4_waybel_7,conjecture,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(t4_yellow_1,axiom,
! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_yellow_1) ).
fof(c_0_8,plain,
! [X53,X54,X55] :
( ( relation_of2_as_subset(X55,X53,X54)
| ~ relation_of2(X55,X53,X54) )
& ( relation_of2(X55,X53,X54)
| ~ relation_of2_as_subset(X55,X53,X54) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
fof(c_0_9,plain,
! [X49] :
( relation_of2_as_subset(inclusion_order(X49),X49,X49)
& v1_partfun1(inclusion_order(X49),X49,X49)
& transitive(inclusion_order(X49))
& antisymmetric(inclusion_order(X49))
& reflexive(inclusion_order(X49)) ),
inference(variable_rename,[status(thm)],[dt_k1_yellow_1]) ).
fof(c_0_10,plain,
! [X88,X89,X90,X91] :
( ( ~ relation_of2(X89,X88,X88)
| rel_str_of(X88,X89) != rel_str_of(X90,X91)
| X89 = X91 )
& ( ~ relation_of2(X89,X88,X88)
| rel_str_of(X88,X89) != rel_str_of(X90,X91)
| X88 = X90 ) ),
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,plain,
! [X83] : incl_POSet(X83) = rel_str_of(X83,inclusion_order(X83)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
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]) ).
cnf(c_0_16,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X29] :
( X29 = rel_str_of(the_carrier(X29),the_InternalRel(X29))
| ~ strict_rel_str(X29)
| ~ rel_str(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[abstractness_v1_orders_2])])]) ).
fof(c_0_18,plain,
! [X84] :
( rel_str(incl_POSet(X84))
& strict_rel_str(incl_POSet(X84)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
inference(assume_negation,[status(cth)],[t4_waybel_7]) ).
cnf(c_0_20,plain,
( incl_POSet(X1) != rel_str_of(X2,X3)
| X1 = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,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_17]) ).
cnf(c_0_22,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X25] : boole_POSet(X25) = incl_POSet(powerset(X25)),
inference(variable_rename,[status(thm)],[t4_yellow_1]) ).
fof(c_0_25,negated_conjecture,
the_carrier(boole_POSet(esk1_0)) != powerset(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_26,plain,
the_carrier(incl_POSet(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
boole_POSet(X1) = incl_POSet(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
the_carrier(boole_POSet(esk1_0)) != powerset(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU382+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n019.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 06:17:50 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.63 % Version: 3.5.1
% 0.23/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.63 % Starting sh5l with 300s (1) cores
% 0.23/0.63 % sh5l with pid 1863711 completed with status 0
% 0.23/0.63 % Result found by sh5l
% 0.23/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.63 % Starting sh5l with 300s (1) cores
% 0.23/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.63 % Search class: FGHSM-FSMM21-SFFFFFNN
% 0.23/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.63 % SubtermCWHack with pid 1863715 completed with status 0
% 0.23/0.63 % Result found by SubtermCWHack
% 0.23/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.63 % Starting sh5l with 300s (1) cores
% 0.23/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.63 % Search class: FGHSM-FSMM21-SFFFFFNN
% 0.23/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.63 % Preprocessing time : 0.005 s
% 0.23/0.63
% 0.23/0.63 % Proof found!
% 0.23/0.63 % SZS status Theorem
% 0.23/0.63 % SZS output start CNFRefutation
% See solution above
% 0.23/0.63 % Parsed axioms : 89
% 0.23/0.63 % Removed by relevancy pruning/SinE : 11
% 0.23/0.63 % Initial clauses : 288
% 0.23/0.63 % Removed in clause preprocessing : 43
% 0.23/0.63 % Initial clauses in saturation : 245
% 0.23/0.63 % Processed clauses : 494
% 0.23/0.63 % ...of these trivial : 35
% 0.23/0.63 % ...subsumed : 77
% 0.23/0.63 % ...remaining for further processing : 382
% 0.23/0.63 % Other redundant clauses eliminated : 2
% 0.23/0.63 % Clauses deleted for lack of memory : 0
% 0.23/0.63 % Backward-subsumed : 2
% 0.23/0.63 % Backward-rewritten : 15
% 0.23/0.63 % Generated clauses : 631
% 0.23/0.63 % ...of the previous two non-redundant : 494
% 0.23/0.63 % ...aggressively subsumed : 0
% 0.23/0.63 % Contextual simplify-reflections : 28
% 0.23/0.63 % Paramodulations : 629
% 0.23/0.63 % Factorizations : 0
% 0.23/0.63 % NegExts : 0
% 0.23/0.63 % Equation resolutions : 2
% 0.23/0.63 % Disequality decompositions : 0
% 0.23/0.63 % Total rewrite steps : 449
% 0.23/0.63 % ...of those cached : 348
% 0.23/0.63 % Propositional unsat checks : 0
% 0.23/0.63 % Propositional check models : 0
% 0.23/0.63 % Propositional check unsatisfiable : 0
% 0.23/0.63 % Propositional clauses : 0
% 0.23/0.63 % Propositional clauses after purity: 0
% 0.23/0.63 % Propositional unsat core size : 0
% 0.23/0.63 % Propositional preprocessing time : 0.000
% 0.23/0.63 % Propositional encoding time : 0.000
% 0.23/0.63 % Propositional solver time : 0.000
% 0.23/0.63 % Success case prop preproc time : 0.000
% 0.23/0.63 % Success case prop encoding time : 0.000
% 0.23/0.63 % Success case prop solver time : 0.000
% 0.23/0.63 % Current number of processed clauses : 365
% 0.23/0.63 % Positive orientable unit clauses : 138
% 0.23/0.63 % Positive unorientable unit clauses: 0
% 0.23/0.63 % Negative unit clauses : 14
% 0.23/0.63 % Non-unit-clauses : 213
% 0.23/0.63 % Current number of unprocessed clauses: 238
% 0.23/0.63 % ...number of literals in the above : 719
% 0.23/0.63 % Current number of archived formulas : 0
% 0.23/0.63 % Current number of archived clauses : 17
% 0.23/0.63 % Clause-clause subsumption calls (NU) : 5824
% 0.23/0.63 % Rec. Clause-clause subsumption calls : 3226
% 0.23/0.63 % Non-unit clause-clause subsumptions : 87
% 0.23/0.63 % Unit Clause-clause subsumption calls : 264
% 0.23/0.63 % Rewrite failures with RHS unbound : 0
% 0.23/0.63 % BW rewrite match attempts : 9
% 0.23/0.63 % BW rewrite match successes : 7
% 0.23/0.63 % Condensation attempts : 0
% 0.23/0.63 % Condensation successes : 0
% 0.23/0.63 % Termbank termtop insertions : 22966
% 0.23/0.63 % Search garbage collected termcells : 1925
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.050 s
% 0.23/0.63 % System time : 0.007 s
% 0.23/0.63 % Total time : 0.057 s
% 0.23/0.63 % Maximum resident set size: 3976 pages
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.055 s
% 0.23/0.63 % System time : 0.014 s
% 0.23/0.63 % Total time : 0.069 s
% 0.23/0.63 % Maximum resident set size: 4864 pages
% 0.23/0.63 % E exiting
%------------------------------------------------------------------------------