%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU368+2 : 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 : n014.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:08 PM UTC 2026
% Result : Theorem 4.90s 6.31s
% Output : CNFRefutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 77 ( 38 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 20 |; 15 &)
% ( 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 : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 6 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(redefinition_k1_yellow_1,axiom,
! [X1] : inclusion_order(X1) = inclusion_relation(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_yellow_1) ).
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(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(t1_yellow_1,conjecture,
! [X1] :
( the_InternalRel(incl_POSet(X1)) = inclusion_order(X1)
& the_carrier(incl_POSet(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_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(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(c_0_8,plain,
! [X23] :
( relation_of2_as_subset(inclusion_order(X23),X23,X23)
& v1_partfun1(inclusion_order(X23),X23,X23)
& transitive(inclusion_order(X23))
& antisymmetric(inclusion_order(X23))
& reflexive(inclusion_order(X23)) ),
inference(variable_rename,[status(thm)],[dt_k1_yellow_1]) ).
fof(c_0_9,plain,
! [X24] : inclusion_order(X24) = inclusion_relation(X24),
inference(variable_rename,[status(thm)],[redefinition_k1_yellow_1]) ).
fof(c_0_10,plain,
! [X22] : incl_POSet(X22) = rel_str_of(X22,inclusion_order(X22)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
fof(c_0_11,plain,
! [X52,X53,X54] :
( ( relation_of2_as_subset(X54,X52,X53)
| ~ relation_of2(X54,X52,X53) )
& ( relation_of2(X54,X52,X53)
| ~ relation_of2_as_subset(X54,X52,X53) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_12,plain,
relation_of2_as_subset(inclusion_order(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
inclusion_order(X1) = inclusion_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( the_InternalRel(incl_POSet(X1)) = inclusion_order(X1)
& the_carrier(incl_POSet(X1)) = X1 ),
inference(assume_negation,[status(cth)],[t1_yellow_1]) ).
fof(c_0_15,plain,
! [X42,X43,X44,X45] :
( ( ~ relation_of2(X43,X42,X42)
| rel_str_of(X42,X43) != rel_str_of(X44,X45)
| X43 = X45 )
& ( ~ relation_of2(X43,X42,X42)
| rel_str_of(X42,X43) != rel_str_of(X44,X45)
| X42 = X44 ) ),
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_16,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
relation_of2_as_subset(inclusion_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,negated_conjecture,
( the_InternalRel(incl_POSet(esk1_0)) != inclusion_order(esk1_0)
| the_carrier(incl_POSet(esk1_0)) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_20,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_15]) ).
cnf(c_0_21,plain,
rel_str_of(X1,inclusion_relation(X1)) = incl_POSet(X1),
inference(rw,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,plain,
relation_of2(inclusion_relation(X1),X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,plain,
! [X25] :
( X25 = rel_str_of(the_carrier(X25),the_InternalRel(X25))
| ~ strict_rel_str(X25)
| ~ rel_str(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[abstractness_v1_orders_2])])]) ).
fof(c_0_24,plain,
! [X33] :
( rel_str(incl_POSet(X33))
& strict_rel_str(incl_POSet(X33)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
cnf(c_0_25,negated_conjecture,
( the_InternalRel(incl_POSet(esk1_0)) != inclusion_order(esk1_0)
| the_carrier(incl_POSet(esk1_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( incl_POSet(X1) != rel_str_of(X2,X3)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,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_23]) ).
cnf(c_0_28,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ relation_of2(X1,X3,X3)
| rel_str_of(X3,X1) != rel_str_of(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,negated_conjecture,
( the_carrier(incl_POSet(esk1_0)) != esk1_0
| the_InternalRel(incl_POSet(esk1_0)) != inclusion_relation(esk1_0) ),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_32,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_26,c_0_27])]),c_0_28]),c_0_29])]) ).
cnf(c_0_33,plain,
( incl_POSet(X1) != rel_str_of(X3,X2)
| inclusion_relation(X1) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_22])]) ).
cnf(c_0_34,negated_conjecture,
the_InternalRel(incl_POSet(esk1_0)) != inclusion_relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
the_InternalRel(incl_POSet(X1)) = inclusion_relation(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27])]),c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU368+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.47 % Computer : n014.cluster.edu
% 0.20/5.47 % Model : x86_64 x86_64
% 0.20/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47 % Memory : 8046.5625MB
% 0.20/5.47 % OS : Linux 6.8.0-71-generic
% 0.20/5.48 % CPULimit : 300
% 0.20/5.48 % WCLimit : 300
% 0.20/5.48 % DateTime : Mon Sep 21 06:16:11 UTC 2026
% 0.20/5.48 % CPUTime :
% 0.20/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.55 Running first-order theorem proving
% 0.24/5.55 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
% 4.90/6.31 % Version: 3.5.1
% 4.90/6.31 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.90/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/6.31 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.90/6.31 % Starting new_bool_3 with 600s (2) cores
% 4.90/6.31 % Starting new_bool_1 with 600s (2) cores
% 4.90/6.31 % Starting sh5l with 300s (1) cores
% 4.90/6.31 % new_bool_3 with pid 3315916 completed with status 0
% 4.90/6.31 % Result found by new_bool_3
% 4.90/6.31 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.90/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/6.31 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.90/6.31 % Starting new_bool_3 with 600s (2) cores
% 4.90/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.90/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.90/6.31 % Search class: FGHSM-SMLM32-MFFFFFNN
% 4.90/6.31 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 4.90/6.31 % Starting SubtermCWHack with 55s (1) cores
% 4.90/6.31 % Starting new_bool_3 with 61s (1) cores
% 4.90/6.31 % new_bool_3 with pid 3315920 completed with status 0
% 4.90/6.31 % Result found by new_bool_3
% 4.90/6.31 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.90/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/6.31 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.90/6.31 % Starting new_bool_3 with 600s (2) cores
% 4.90/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.90/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.90/6.31 % Search class: FGHSM-SMLM32-MFFFFFNN
% 4.90/6.31 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 4.90/6.31 % Starting SubtermCWHack with 55s (1) cores
% 4.90/6.31 % Starting new_bool_3 with 61s (1) cores
% 4.90/6.31 % Preprocessing time : 0.022 s
% 4.90/6.31 % Presaturation interreduction done
% 4.90/6.31
% 4.90/6.31 % Proof found!
% 4.90/6.31 % SZS status Theorem
% 4.90/6.31 % SZS output start CNFRefutation
% See solution above
% 4.90/6.31 % Parsed axioms : 721
% 4.90/6.31 % Removed by relevancy pruning/SinE : 491
% 4.90/6.31 % Initial clauses : 1261
% 4.90/6.31 % Removed in clause preprocessing : 9
% 4.90/6.31 % Initial clauses in saturation : 1252
% 4.90/6.31 % Processed clauses : 3128
% 4.90/6.31 % ...of these trivial : 25
% 4.90/6.31 % ...subsumed : 889
% 4.90/6.31 % ...remaining for further processing : 2214
% 4.90/6.31 % Other redundant clauses eliminated : 645
% 4.90/6.31 % Clauses deleted for lack of memory : 0
% 4.90/6.31 % Backward-subsumed : 15
% 4.90/6.31 % Backward-rewritten : 72
% 4.90/6.31 % Generated clauses : 5344
% 4.90/6.31 % ...of the previous two non-redundant : 4512
% 4.90/6.31 % ...aggressively subsumed : 0
% 4.90/6.31 % Contextual simplify-reflections : 268
% 4.90/6.31 % Paramodulations : 4826
% 4.90/6.31 % Factorizations : 2
% 4.90/6.31 % NegExts : 0
% 4.90/6.31 % Equation resolutions : 654
% 4.90/6.31 % Disequality decompositions : 0
% 4.90/6.31 % Total rewrite steps : 1218
% 4.90/6.31 % ...of those cached : 1031
% 4.90/6.31 % Propositional unsat checks : 0
% 4.90/6.31 % Propositional check models : 0
% 4.90/6.31 % Propositional check unsatisfiable : 0
% 4.90/6.31 % Propositional clauses : 0
% 4.90/6.31 % Propositional clauses after purity: 0
% 4.90/6.31 % Propositional unsat core size : 0
% 4.90/6.31 % Propositional preprocessing time : 0.000
% 4.90/6.31 % Propositional encoding time : 0.000
% 4.90/6.31 % Propositional solver time : 0.000
% 4.90/6.31 % Success case prop preproc time : 0.000
% 4.90/6.31 % Success case prop encoding time : 0.000
% 4.90/6.31 % Success case prop solver time : 0.000
% 4.90/6.31 % Current number of processed clauses : 609
% 4.90/6.31 % Positive orientable unit clauses : 155
% 4.90/6.31 % Positive unorientable unit clauses: 3
% 4.90/6.31 % Negative unit clauses : 88
% 4.90/6.31 % Non-unit-clauses : 363
% 4.90/6.31 % Current number of unprocessed clauses: 3766
% 4.90/6.31 % ...number of literals in the above : 13453
% 4.90/6.31 % Current number of archived formulas : 0
% 4.90/6.31 % Current number of archived clauses : 1255
% 4.90/6.31 % Clause-clause subsumption calls (NU) : 1109303
% 4.90/6.31 % Rec. Clause-clause subsumption calls : 91166
% 4.90/6.31 % Non-unit clause-clause subsumptions : 695
% 4.90/6.31 % Unit Clause-clause subsumption calls : 7436
% 4.90/6.31 % Rewrite failures with RHS unbound : 0
% 4.90/6.31 % BW rewrite match attempts : 68
% 4.90/6.31 % BW rewrite match successes : 44
% 4.90/6.31 % Condensation attempts : 0
% 4.90/6.31 % Condensation successes : 0
% 4.90/6.31 % Termbank termtop insertions : 158965
% 4.90/6.31 % Search garbage collected termcells : 18841
% 4.90/6.31
% 4.90/6.31 % -------------------------------------------------
% 4.90/6.31 % User time : 0.652 s
% 4.90/6.31 % System time : 0.023 s
% 4.90/6.31 % Total time : 0.676 s
% 4.90/6.31 % Maximum resident set size: 7204 pages
% 4.90/6.31
% 4.90/6.31 % -------------------------------------------------
% 4.90/6.31 % User time : 1.255 s
% 4.90/6.31 % System time : 0.059 s
% 4.90/6.31 % Total time : 1.314 s
% 4.90/6.31 % Maximum resident set size: 5888 pages
% 4.90/6.31 % E exiting
%------------------------------------------------------------------------------