%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:18:27 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 112 ( 22 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 144 ( 60 ~; 64 |; 11 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 50 ( 3 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_wellord2,axiom,
! [X1,X2] :
( relation(X2)
=> ( X2 = inclusion_relation(X1)
<=> ( relation_field(X2) = X1
& ! [X3,X4] :
( ( in(X3,X1)
& in(X4,X1) )
=> ( in(ordered_pair(X3,X4),X2)
<=> subset(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_wellord2) ).
fof(d1_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_reflexive_in(X1,X2)
<=> ! [X3] :
( in(X3,X2)
=> in(ordered_pair(X3,X3),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relat_2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_wellord2) ).
fof(t2_wellord2,conjecture,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_wellord2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_relat_2) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8] :
( ( relation_field(X6) = X5
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ in(ordered_pair(X7,X8),X6)
| subset(X7,X8)
| ~ in(X7,X5)
| ~ in(X8,X5)
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ subset(X7,X8)
| in(ordered_pair(X7,X8),X6)
| ~ in(X7,X5)
| ~ in(X8,X5)
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( in(esk2_2(X5,X6),X5)
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( in(esk3_2(X5,X6),X5)
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6)
| ~ subset(esk2_2(X5,X6),esk3_2(X5,X6))
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6)
| subset(esk2_2(X5,X6),esk3_2(X5,X6))
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_wellord2])])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X5] :
( ( ~ is_reflexive_in(X4,X5)
| ~ in(X6,X5)
| in(ordered_pair(X6,X6),X4)
| ~ relation(X4) )
& ( in(esk4_2(X4,X5),X5)
| is_reflexive_in(X4,X5)
| ~ relation(X4) )
& ( ~ in(ordered_pair(esk4_2(X4,X5),esk4_2(X4,X5)),X4)
| is_reflexive_in(X4,X5)
| ~ relation(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relat_2])])])])])])]) ).
cnf(c_0_8,plain,
( in(ordered_pair(X4,X3),X1)
| ~ relation(X1)
| X1 != inclusion_relation(X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ subset(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( is_reflexive_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X2] : relation(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] : reflexive(inclusion_relation(X1)),
inference(assume_negation,[status(cth)],[t2_wellord2]) ).
cnf(c_0_12,plain,
( is_reflexive_in(X1,X2)
| in(ordered_pair(esk4_2(X1,X2),X3),X4)
| X4 != inclusion_relation(X2)
| ~ subset(esk4_2(X1,X2),X3)
| ~ relation(X4)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_15,negated_conjecture,
~ reflexive(inclusion_relation(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_16,plain,
! [X2] :
( ( ~ reflexive(X2)
| is_reflexive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_reflexive_in(X2,relation_field(X2))
| reflexive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])]) ).
cnf(c_0_17,plain,
( relation_field(X1) = X2
| ~ relation(X1)
| X1 != inclusion_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ in(ordered_pair(esk4_2(X1,X2),esk4_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( is_reflexive_in(X1,X2)
| in(ordered_pair(esk4_2(X1,X2),X3),inclusion_relation(X4))
| inclusion_relation(X4) != inclusion_relation(X2)
| ~ subset(esk4_2(X1,X2),X3)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ reflexive(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_13])]) ).
cnf(c_0_24,plain,
( is_reflexive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X2)
| ~ in(esk4_2(inclusion_relation(X1),X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
~ is_reflexive_in(inclusion_relation(esk1_0),esk1_0),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13])]),c_0_23]) ).
cnf(c_0_26,plain,
( is_reflexive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_9]),c_0_13])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 04:39:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.018 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 28
% 0.24/1.41 # Proof object clause steps : 15
% 0.24/1.41 # Proof object formula steps : 13
% 0.24/1.41 # Proof object conjectures : 6
% 0.24/1.41 # Proof object clause conjectures : 3
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 8
% 0.24/1.41 # Proof object initial formulas used : 6
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 10
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 51
% 0.24/1.41 # Removed by relevancy pruning/SinE : 33
% 0.24/1.41 # Initial clauses : 28
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 28
% 0.24/1.41 # Processed clauses : 1637
% 0.24/1.41 # ...of these trivial : 5
% 0.24/1.41 # ...subsumed : 1157
% 0.24/1.41 # ...remaining for further processing : 475
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 52
% 0.24/1.41 # Backward-rewritten : 86
% 0.24/1.41 # Generated clauses : 8247
% 0.24/1.41 # ...of the previous two non-trivial : 7957
% 0.24/1.41 # Contextual simplify-reflections : 893
% 0.24/1.41 # Paramodulations : 8214
% 0.24/1.41 # Factorizations : 22
% 0.24/1.41 # Equation resolutions : 11
% 0.24/1.41 # Current number of processed clauses : 337
% 0.24/1.41 # Positive orientable unit clauses : 9
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 7
% 0.24/1.41 # Non-unit-clauses : 321
% 0.24/1.41 # Current number of unprocessed clauses: 3165
% 0.24/1.41 # ...number of literals in the above : 17499
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 138
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 84234
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 42032
% 0.24/1.41 # Non-unit clause-clause subsumptions : 2088
% 0.24/1.41 # Unit Clause-clause subsumption calls : 434
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 9
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 129207
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.208 s
% 0.24/1.41 # System time : 0.007 s
% 0.24/1.41 # Total time : 0.215 s
% 0.24/1.41 # Maximum resident set size: 7256 pages
%------------------------------------------------------------------------------