%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU368+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:19:25 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 19 unt; 0 def)
% Number of atoms : 84 ( 43 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 22 |; 15 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 14 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k1_yellow_1,axiom,
! [X1] :
( reflexive(inclusion_order(X1))
& antisymmetric(inclusion_order(X1))
& transitive(inclusion_order(X1))
& v1_partfun1(inclusion_order(X1),X1,X1)
& relation_of2_as_subset(inclusion_order(X1),X1,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_k1_yellow_1) ).
fof(redefinition_k1_yellow_1,axiom,
! [X1] : inclusion_order(X1) = inclusion_relation(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/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/sandbox2/solver/bin/../tmp/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/sandbox2/solver/bin/../tmp/theBenchmark.p',redefinition_m2_relset_1) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_k2_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)
=> ( X1 = X3
& X2 = X4 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/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/sandbox2/solver/bin/../tmp/theBenchmark.p',abstractness_v1_orders_2) ).
fof(t1_yellow_1,conjecture,
! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_yellow_1) ).
fof(c_0_8,plain,
! [X2,X2,X2,X2,X2] :
( reflexive(inclusion_order(X2))
& antisymmetric(inclusion_order(X2))
& transitive(inclusion_order(X2))
& v1_partfun1(inclusion_order(X2),X2,X2)
& relation_of2_as_subset(inclusion_order(X2),X2,X2) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_yellow_1])])]) ).
fof(c_0_9,plain,
! [X2] : inclusion_order(X2) = inclusion_relation(X2),
inference(variable_rename,[status(thm)],[redefinition_k1_yellow_1]) ).
fof(c_0_10,plain,
! [X2] : incl_POSet(X2) = rel_str_of(X2,inclusion_order(X2)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ relation_of2_as_subset(X6,X4,X5)
| relation_of2(X6,X4,X5) )
& ( ~ relation_of2(X6,X4,X5)
| relation_of2_as_subset(X6,X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[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,plain,
! [X2,X2] :
( strict_rel_str(incl_POSet(X2))
& rel_str(incl_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k2_yellow_1])])]) ).
cnf(c_0_15,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ~ relation_of2(X6,X5,X5) )
& ( X6 = X8
| rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ~ relation_of2(X6,X5,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[free_g1_orders_2])])])])])]) ).
cnf(c_0_17,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(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,plain,
! [X2] :
( ~ rel_str(X2)
| ~ strict_rel_str(X2)
| X2 = rel_str_of(the_carrier(X2),the_InternalRel(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[abstractness_v1_orders_2])]) ).
cnf(c_0_20,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_relation(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_22,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
inference(assume_negation,[status(cth)],[t1_yellow_1]) ).
cnf(c_0_24,plain,
( X1 = X4
| ~ relation_of2(X1,X2,X2)
| rel_str_of(X2,X1) != rel_str_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
relation_of2(inclusion_relation(X1),X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1))
| ~ strict_rel_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
strict_rel_str(rel_str_of(X1,inclusion_relation(X1))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
rel_str(rel_str_of(X1,inclusion_relation(X1))),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
fof(c_0_29,negated_conjecture,
( the_carrier(incl_POSet(esk1_0)) != esk1_0
| the_InternalRel(incl_POSet(esk2_0)) != inclusion_order(esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_30,plain,
( inclusion_relation(X1) = X2
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X3,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
rel_str_of(the_carrier(rel_str_of(X1,inclusion_relation(X1))),the_InternalRel(rel_str_of(X1,inclusion_relation(X1)))) = rel_str_of(X1,inclusion_relation(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( X2 = X3
| ~ relation_of2(X1,X2,X2)
| rel_str_of(X2,X1) != rel_str_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( the_InternalRel(incl_POSet(esk2_0)) != inclusion_order(esk2_0)
| the_carrier(incl_POSet(esk1_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( inclusion_relation(X1) = the_InternalRel(rel_str_of(X2,inclusion_relation(X2)))
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,inclusion_relation(X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( X1 = X2
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( the_carrier(rel_str_of(esk1_0,inclusion_relation(esk1_0))) != esk1_0
| the_InternalRel(rel_str_of(esk2_0,inclusion_relation(esk2_0))) != inclusion_relation(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_13]),c_0_21]),c_0_21]) ).
cnf(c_0_37,plain,
the_InternalRel(rel_str_of(X1,inclusion_relation(X1))) = inclusion_relation(X1),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( X1 = the_carrier(rel_str_of(X2,inclusion_relation(X2)))
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,inclusion_relation(X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
the_carrier(rel_str_of(esk1_0,inclusion_relation(esk1_0))) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,plain,
the_carrier(rel_str_of(X1,inclusion_relation(X1))) = X1,
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU368+2 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 11:58:43 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.27/1.46 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.27/1.46 # Preprocessing time : 0.057 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 42
% 0.27/1.46 # Proof object clause steps : 25
% 0.27/1.46 # Proof object formula steps : 17
% 0.27/1.46 # Proof object conjectures : 7
% 0.27/1.46 # Proof object clause conjectures : 4
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 10
% 0.27/1.46 # Proof object initial formulas used : 8
% 0.27/1.46 # Proof object generating inferences : 8
% 0.27/1.46 # Proof object simplifying inferences : 13
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 721
% 0.27/1.46 # Removed by relevancy pruning/SinE : 643
% 0.27/1.46 # Initial clauses : 386
% 0.27/1.46 # Removed in clause preprocessing : 11
% 0.27/1.46 # Initial clauses in saturation : 375
% 0.27/1.46 # Processed clauses : 843
% 0.27/1.46 # ...of these trivial : 46
% 0.27/1.46 # ...subsumed : 163
% 0.27/1.46 # ...remaining for further processing : 634
% 0.27/1.46 # Other redundant clauses eliminated : 62
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 0
% 0.27/1.46 # Backward-rewritten : 64
% 0.27/1.46 # Generated clauses : 2955
% 0.27/1.46 # ...of the previous two non-trivial : 2791
% 0.27/1.46 # Contextual simplify-reflections : 87
% 0.27/1.46 # Paramodulations : 2875
% 0.27/1.46 # Factorizations : 2
% 0.27/1.46 # Equation resolutions : 86
% 0.27/1.46 # Current number of processed clauses : 521
% 0.27/1.46 # Positive orientable unit clauses : 69
% 0.27/1.46 # Positive unorientable unit clauses: 0
% 0.27/1.46 # Negative unit clauses : 5
% 0.27/1.46 # Non-unit-clauses : 447
% 0.27/1.46 # Current number of unprocessed clauses: 2030
% 0.27/1.46 # ...number of literals in the above : 12585
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 66
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 110822
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 12641
% 0.27/1.46 # Non-unit clause-clause subsumptions : 230
% 0.27/1.46 # Unit Clause-clause subsumption calls : 11547
% 0.27/1.46 # Rewrite failures with RHS unbound : 12
% 0.27/1.46 # BW rewrite match attempts : 22
% 0.27/1.46 # BW rewrite match successes : 22
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 124227
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.169 s
% 0.27/1.46 # System time : 0.010 s
% 0.27/1.46 # Total time : 0.179 s
% 0.27/1.46 # Maximum resident set size: 8300 pages
% 0.27/23.45 eprover: CPU time limit exceeded, terminating
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: CPU time limit exceeded, terminating
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.54 eprover: No such file or directory
%------------------------------------------------------------------------------