TSTP Solution File: SEU040+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU040+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:16:33 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 6 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t76_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
& subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t76_funct_1) ).
fof(t99_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t99_relat_1) ).
fof(t89_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t89_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
& subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
inference(assume_negation,[status(cth)],[t76_funct_1]) ).
fof(c_0_4,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& ( ~ subset(relation_dom(relation_dom_restriction(esk2_0,esk1_0)),relation_dom(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_3])])]) ).
fof(c_0_5,plain,
! [X3,X4] :
( ~ relation(X4)
| subset(relation_rng(relation_dom_restriction(X4,X3)),relation_rng(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t99_relat_1])]) ).
cnf(c_0_6,negated_conjecture,
( ~ subset(relation_rng(relation_dom_restriction(esk2_0,esk1_0)),relation_rng(esk2_0))
| ~ subset(relation_dom(relation_dom_restriction(esk2_0,esk1_0)),relation_dom(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(relation_rng(relation_dom_restriction(X1,X2)),relation_rng(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ relation(X4)
| subset(relation_dom(relation_dom_restriction(X4,X3)),relation_dom(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t89_relat_1])]) ).
cnf(c_0_10,negated_conjecture,
~ subset(relation_dom(relation_dom_restriction(esk2_0,esk1_0)),relation_dom(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,plain,
( subset(relation_dom(relation_dom_restriction(X1,X2)),relation_dom(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU040+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 22:00:18 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.017 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 13
% 0.26/1.44 # Proof object clause steps : 6
% 0.26/1.44 # Proof object formula steps : 7
% 0.26/1.44 # Proof object conjectures : 7
% 0.26/1.44 # Proof object clause conjectures : 4
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 4
% 0.26/1.44 # Proof object initial formulas used : 3
% 0.26/1.44 # Proof object generating inferences : 2
% 0.26/1.44 # Proof object simplifying inferences : 4
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 38
% 0.26/1.44 # Removed by relevancy pruning/SinE : 8
% 0.26/1.44 # Initial clauses : 43
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 43
% 0.26/1.44 # Processed clauses : 44
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 1
% 0.26/1.44 # ...remaining for further processing : 43
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 0
% 0.26/1.44 # Generated clauses : 25
% 0.26/1.44 # ...of the previous two non-trivial : 18
% 0.26/1.44 # Contextual simplify-reflections : 1
% 0.26/1.44 # Paramodulations : 25
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 43
% 0.26/1.44 # Positive orientable unit clauses : 15
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 4
% 0.26/1.44 # Non-unit-clauses : 24
% 0.26/1.44 # Current number of unprocessed clauses: 17
% 0.26/1.44 # ...number of literals in the above : 36
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 0
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 59
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 45
% 0.26/1.44 # Non-unit clause-clause subsumptions : 2
% 0.26/1.44 # Unit Clause-clause subsumption calls : 23
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 0
% 0.26/1.44 # BW rewrite match successes : 0
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 2277
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.017 s
% 0.26/1.44 # System time : 0.002 s
% 0.26/1.44 # Total time : 0.019 s
% 0.26/1.44 # Maximum resident set size: 3004 pages
%------------------------------------------------------------------------------