TSTP Solution File: SEU368+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 82 ( 38 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 31 ~; 26 |; 15 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 14 sgn 32 !; 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_m2_relset_1) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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)
=> ( X1 = X3
& X2 = X4 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',free_g1_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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',abstractness_v1_orders_2) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_yellow_1) ).
fof(d1_yellow_1,axiom,
! [X1] : incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_yellow_1) ).
fof(c_0_7,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])])])]) ).
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,
! [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_10,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
relation_of2_as_subset(inclusion_order(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,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_13,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_9]) ).
cnf(c_0_14,plain,
relation_of2(inclusion_order(X1),X1,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,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])]) ).
fof(c_0_16,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])])]) ).
fof(c_0_17,plain,
! [X2] : incl_POSet(X2) = rel_str_of(X2,inclusion_order(X2)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
fof(c_0_18,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_12])])])]) ).
cnf(c_0_19,plain,
( X1 = X2
| rel_str_of(X1,inclusion_order(X1)) != rel_str_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,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_15]) ).
cnf(c_0_21,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
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_9]) ).
cnf(c_0_25,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_18]) ).
cnf(c_0_26,plain,
( X1 = the_carrier(X2)
| rel_str_of(X1,inclusion_order(X1)) != X2
| ~ strict_rel_str(X2)
| ~ rel_str(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
strict_rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,plain,
( inclusion_order(X1) = X2
| rel_str_of(X1,inclusion_order(X1)) != rel_str_of(X3,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( the_carrier(rel_str_of(esk1_0,inclusion_order(esk1_0))) != esk1_0
| the_InternalRel(rel_str_of(esk2_0,inclusion_order(esk2_0))) != inclusion_order(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_22]) ).
cnf(c_0_31,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_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( inclusion_order(X1) = the_InternalRel(X2)
| rel_str_of(X1,inclusion_order(X1)) != X2
| ~ strict_rel_str(X2)
| ~ rel_str(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_33,negated_conjecture,
the_InternalRel(rel_str_of(esk2_0,inclusion_order(esk2_0))) != inclusion_order(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,plain,
the_InternalRel(rel_str_of(X1,inclusion_order(X1))) = inclusion_order(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_27]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 19:29:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.018 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 36
% 0.25/1.43 # Proof object clause steps : 21
% 0.25/1.43 # Proof object formula steps : 15
% 0.25/1.43 # Proof object conjectures : 7
% 0.25/1.43 # Proof object clause conjectures : 4
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 9
% 0.25/1.43 # Proof object initial formulas used : 7
% 0.25/1.43 # Proof object generating inferences : 7
% 0.25/1.43 # Proof object simplifying inferences : 14
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 53
% 0.25/1.43 # Removed by relevancy pruning/SinE : 19
% 0.25/1.43 # Initial clauses : 67
% 0.25/1.43 # Removed in clause preprocessing : 1
% 0.25/1.43 # Initial clauses in saturation : 66
% 0.25/1.43 # Processed clauses : 117
% 0.25/1.43 # ...of these trivial : 6
% 0.25/1.43 # ...subsumed : 7
% 0.25/1.43 # ...remaining for further processing : 104
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 1
% 0.25/1.43 # Backward-rewritten : 10
% 0.25/1.43 # Generated clauses : 104
% 0.25/1.43 # ...of the previous two non-trivial : 72
% 0.25/1.43 # Contextual simplify-reflections : 7
% 0.25/1.43 # Paramodulations : 95
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 9
% 0.25/1.43 # Current number of processed clauses : 93
% 0.25/1.43 # Positive orientable unit clauses : 39
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 6
% 0.25/1.43 # Non-unit-clauses : 48
% 0.25/1.43 # Current number of unprocessed clauses: 13
% 0.25/1.43 # ...number of literals in the above : 50
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 12
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 304
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 139
% 0.25/1.43 # Non-unit clause-clause subsumptions : 14
% 0.25/1.43 # Unit Clause-clause subsumption calls : 68
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 5
% 0.25/1.43 # BW rewrite match successes : 5
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 4617
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.020 s
% 0.25/1.43 # System time : 0.003 s
% 0.25/1.43 # Total time : 0.023 s
% 0.25/1.43 # Maximum resident set size: 3368 pages
%------------------------------------------------------------------------------