TSTP Solution File: SEU045+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU045+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:34 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 136 ( 23 equ)
% Maximal formula atoms : 79 ( 7 avg)
% Number of connectives : 196 ( 78 ~; 86 |; 21 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 4 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t87_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_rng_restriction(X1,X3)))
=> apply(relation_rng_restriction(X1,X3),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t87_funct_1) ).
fof(t85_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_rng_restriction(X1,X3)
<=> ( ! [X4] :
( in(X4,relation_dom(X2))
<=> ( in(X4,relation_dom(X3))
& in(apply(X3,X4),X1) ) )
& ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t85_funct_1) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k8_relat_1) ).
fof(fc5_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( relation(relation_rng_restriction(X1,X2))
& function(relation_rng_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc5_funct_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_rng_restriction(X1,X3)))
=> apply(relation_rng_restriction(X1,X3),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t87_funct_1]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X8,X9] :
( ( in(X8,relation_dom(X7))
| ~ in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(apply(X7,X8),X5)
| ~ in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X8,relation_dom(X7))
| ~ in(apply(X7,X8),X5)
| in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X9,relation_dom(X6))
| apply(X6,X9) = apply(X7,X9)
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk5_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk4_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk4_3(X5,X6,X7),relation_dom(X7))
| ~ in(apply(X7,esk4_3(X5,X6,X7)),X5)
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk5_3(X5,X6,X7)) != apply(X7,esk5_3(X5,X6,X7))
| ~ in(esk4_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk4_3(X5,X6,X7),relation_dom(X7))
| ~ in(apply(X7,esk4_3(X5,X6,X7)),X5)
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk5_3(X5,X6,X7),relation_dom(X6))
| in(esk4_3(X5,X6,X7),relation_dom(X7))
| in(esk4_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk5_3(X5,X6,X7)) != apply(X7,esk5_3(X5,X6,X7))
| in(esk4_3(X5,X6,X7),relation_dom(X7))
| in(esk4_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk5_3(X5,X6,X7),relation_dom(X6))
| in(apply(X7,esk4_3(X5,X6,X7)),X5)
| in(esk4_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk5_3(X5,X6,X7)) != apply(X7,esk5_3(X5,X6,X7))
| in(apply(X7,esk4_3(X5,X6,X7)),X5)
| in(esk4_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(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)],[t85_funct_1])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ relation(X4)
| relation(relation_rng_restriction(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ( relation(relation_rng_restriction(X3,X4))
| ~ relation(X4)
| ~ function(X4) )
& ( function(relation_rng_restriction(X3,X4))
| ~ relation(X4)
| ~ function(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_funct_1])])]) ).
fof(c_0_8,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& in(esk2_0,relation_dom(relation_rng_restriction(esk1_0,esk3_0)))
& apply(relation_rng_restriction(esk1_0,esk3_0),esk2_0) != apply(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_9,plain,
( apply(X1,X4) = apply(X2,X4)
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| X1 != relation_rng_restriction(X3,X2)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( function(relation_rng_restriction(X2,X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(relation_rng_restriction(esk1_0,esk3_0),esk2_0) != apply(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( apply(relation_rng_restriction(X1,X2),X3) = apply(X2,X3)
| ~ in(X3,relation_dom(relation_rng_restriction(X1,X2)))
| ~ function(X2)
| ~ relation(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,relation_dom(relation_rng_restriction(esk1_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU045+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.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 20:43:00 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.017 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 : 18
% 0.24/1.42 # Proof object clause steps : 9
% 0.24/1.42 # Proof object formula steps : 9
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 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 : 4
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 34
% 0.24/1.42 # Removed by relevancy pruning/SinE : 9
% 0.24/1.42 # Initial clauses : 46
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 46
% 0.24/1.42 # Processed clauses : 116
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 14
% 0.24/1.42 # ...remaining for further processing : 102
% 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 : 19
% 0.24/1.42 # Generated clauses : 166
% 0.24/1.42 # ...of the previous two non-trivial : 147
% 0.24/1.42 # Contextual simplify-reflections : 4
% 0.24/1.42 # Paramodulations : 162
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 4
% 0.24/1.42 # Current number of processed clauses : 83
% 0.24/1.42 # Positive orientable unit clauses : 16
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 8
% 0.24/1.42 # Non-unit-clauses : 59
% 0.24/1.42 # Current number of unprocessed clauses: 64
% 0.24/1.42 # ...number of literals in the above : 337
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 19
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 742
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 393
% 0.24/1.42 # Non-unit clause-clause subsumptions : 15
% 0.24/1.42 # Unit Clause-clause subsumption calls : 162
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 6
% 0.24/1.42 # BW rewrite match successes : 5
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 5252
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.023 s
% 0.24/1.42 # System time : 0.001 s
% 0.24/1.42 # Total time : 0.024 s
% 0.24/1.42 # Maximum resident set size: 3036 pages
%------------------------------------------------------------------------------