TSTP Solution File: SEU196+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:17:43 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 43 ( 19 ~; 14 |; 3 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t99_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t99_relat_1) ).
fof(t25_relat_1,lemma,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t25_relat_1) ).
fof(t88_relat_1,lemma,
! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t88_relat_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k7_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
inference(assume_negation,[status(cth)],[t99_relat_1]) ).
fof(c_0_5,negated_conjecture,
( relation(esk2_0)
& ~ subset(relation_rng(relation_dom_restriction(esk2_0,esk1_0)),relation_rng(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,lemma,
! [X3,X4] :
( ( subset(relation_dom(X3),relation_dom(X4))
| ~ subset(X3,X4)
| ~ relation(X4)
| ~ relation(X3) )
& ( subset(relation_rng(X3),relation_rng(X4))
| ~ subset(X3,X4)
| ~ relation(X4)
| ~ relation(X3) ) ),
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)],[t25_relat_1])])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ subset(relation_rng(relation_dom_restriction(esk2_0,esk1_0)),relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,lemma,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X1)
| ~ relation(X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,lemma,
! [X3,X4] :
( ~ relation(X4)
| subset(relation_dom_restriction(X4,X3),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t88_relat_1])]) ).
cnf(c_0_11,negated_conjecture,
( ~ subset(relation_dom_restriction(esk2_0,esk1_0),esk2_0)
| ~ relation(relation_dom_restriction(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,lemma,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_dom_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])])])]) ).
cnf(c_0_14,lemma,
~ relation(relation_dom_restriction(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9])]) ).
cnf(c_0_15,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n008.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 09:12:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.027 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 17
% 0.21/1.40 # Proof object clause steps : 8
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 6
% 0.21/1.40 # Proof object clause conjectures : 3
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 5
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 3
% 0.21/1.40 # Proof object simplifying inferences : 6
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 187
% 0.21/1.40 # Removed by relevancy pruning/SinE : 86
% 0.21/1.40 # Initial clauses : 186
% 0.21/1.40 # Removed in clause preprocessing : 3
% 0.21/1.40 # Initial clauses in saturation : 183
% 0.21/1.40 # Processed clauses : 196
% 0.21/1.40 # ...of these trivial : 3
% 0.21/1.40 # ...subsumed : 14
% 0.21/1.40 # ...remaining for further processing : 179
% 0.21/1.40 # Other redundant clauses eliminated : 19
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 24
% 0.21/1.40 # Generated clauses : 974
% 0.21/1.40 # ...of the previous two non-trivial : 846
% 0.21/1.40 # Contextual simplify-reflections : 3
% 0.21/1.40 # Paramodulations : 940
% 0.21/1.40 # Factorizations : 8
% 0.21/1.40 # Equation resolutions : 26
% 0.21/1.40 # Current number of processed clauses : 151
% 0.21/1.40 # Positive orientable unit clauses : 21
% 0.21/1.40 # Positive unorientable unit clauses: 1
% 0.21/1.40 # Negative unit clauses : 8
% 0.21/1.40 # Non-unit-clauses : 121
% 0.21/1.40 # Current number of unprocessed clauses: 680
% 0.21/1.40 # ...number of literals in the above : 2923
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 25
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 3299
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1415
% 0.21/1.40 # Non-unit clause-clause subsumptions : 16
% 0.21/1.40 # Unit Clause-clause subsumption calls : 372
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 31
% 0.21/1.40 # BW rewrite match successes : 9
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 24040
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.055 s
% 0.21/1.40 # System time : 0.001 s
% 0.21/1.40 # Total time : 0.056 s
% 0.21/1.40 # Maximum resident set size: 4504 pages
%------------------------------------------------------------------------------