TSTP Solution File: SEU219+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU219+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:57 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 47 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 18 ~; 13 |; 10 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t55_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t55_funct_1) ).
fof(d9_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(X1) = relation_inverse(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_funct_1) ).
fof(t37_relat_1,axiom,
! [X1] :
( relation(X1)
=> ( relation_rng(X1) = relation_dom(relation_inverse(X1))
& relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t55_funct_1]) ).
fof(c_0_4,negated_conjecture,
( relation(esk1_0)
& function(esk1_0)
& one_to_one(esk1_0)
& ( relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0))
| relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2] :
( ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(X2)
| function_inverse(X2) = relation_inverse(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_funct_1])]) ).
cnf(c_0_6,negated_conjecture,
( relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0))
| relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( function_inverse(X1) = relation_inverse(X1)
| ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X2] :
( ( relation_rng(X2) = relation_dom(relation_inverse(X2))
| ~ relation(X2) )
& ( relation_dom(X2) = relation_rng(relation_inverse(X2))
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])]) ).
cnf(c_0_12,negated_conjecture,
( relation_rng(relation_inverse(esk1_0)) != relation_dom(esk1_0)
| relation_rng(esk1_0) != relation_dom(relation_inverse(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( relation_dom(X1) = relation_rng(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
relation_rng(esk1_0) != relation_dom(relation_inverse(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9])]) ).
cnf(c_0_15,plain,
( relation_rng(X1) = relation_dom(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$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.11/0.12 % Problem : SEU219+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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:26:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.016 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 17
% 0.24/1.42 # Proof object clause steps : 10
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 10
% 0.24/1.42 # Proof object clause conjectures : 7
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 3
% 0.24/1.42 # Proof object simplifying inferences : 8
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 40
% 0.24/1.42 # Removed by relevancy pruning/SinE : 17
% 0.24/1.42 # Initial clauses : 41
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 39
% 0.24/1.42 # Processed clauses : 43
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 42
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 35
% 0.24/1.42 # ...of the previous two non-trivial : 28
% 0.24/1.42 # Contextual simplify-reflections : 4
% 0.24/1.42 # Paramodulations : 35
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 42
% 0.24/1.42 # Positive orientable unit clauses : 17
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 22
% 0.24/1.42 # Current number of unprocessed clauses: 24
% 0.24/1.42 # ...number of literals in the above : 68
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 55
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 51
% 0.24/1.42 # Non-unit clause-clause subsumptions : 5
% 0.24/1.42 # Unit Clause-clause subsumption calls : 3
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 2126
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.014 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2980 pages
%------------------------------------------------------------------------------