TSTP Solution File: SEU225+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:02 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 165 ( 38 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 216 ( 89 ~; 86 |; 23 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 65 ( 8 sgn 41 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_funct_1) ).
fof(t72_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,X1)
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t72_funct_1) ).
fof(t68_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_dom_restriction(X3,X1)
<=> ( relation_dom(X2) = set_intersection2(relation_dom(X3),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',t68_funct_1) ).
fof(fc4_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1) )
=> ( relation(relation_dom_restriction(X1,X2))
& function(relation_dom_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k7_relat_1) ).
fof(l82_funct_1,axiom,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
<=> ( in(X2,relation_dom(X3))
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l82_funct_1) ).
fof(c_0_8,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_9,plain,
empty(esk12_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X6,X5,X6,X6] :
( ( X6 != apply(X4,X5)
| in(ordered_pair(X5,X6),X4)
| ~ in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( ~ in(ordered_pair(X5,X6),X4)
| X6 = apply(X4,X5)
| ~ in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( X6 != apply(X4,X5)
| X6 = empty_set
| in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( X6 != empty_set
| X6 = apply(X4,X5)
| in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) ) ),
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)],[inference(fof_simplification,[status(thm)],[d4_funct_1])])])])])])]) ).
cnf(c_0_11,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
empty(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,X1)
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t72_funct_1]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ( relation_dom(X6) = set_intersection2(relation_dom(X7),X5)
| X6 != relation_dom_restriction(X7,X5)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X8,relation_dom(X6))
| apply(X6,X8) = apply(X7,X8)
| X6 != relation_dom_restriction(X7,X5)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk4_3(X5,X6,X7),relation_dom(X6))
| relation_dom(X6) != set_intersection2(relation_dom(X7),X5)
| X6 = relation_dom_restriction(X7,X5)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk4_3(X5,X6,X7)) != apply(X7,esk4_3(X5,X6,X7))
| relation_dom(X6) != set_intersection2(relation_dom(X7),X5)
| X6 = relation_dom_restriction(X7,X5)
| ~ 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)],[t68_funct_1])])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4,X4] :
( ( relation(relation_dom_restriction(X3,X4))
| ~ relation(X3)
| ~ function(X3) )
& ( function(relation_dom_restriction(X3,X4))
| ~ relation(X3)
| ~ function(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])])])]) ).
fof(c_0_16,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_17,plain,
( in(X2,relation_dom(X1))
| X3 = empty_set
| ~ function(X1)
| ~ relation(X1)
| X3 != apply(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
empty_set = esk12_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_19,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& in(esk2_0,esk1_0)
& apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_20,plain,
( apply(X1,X4) = apply(X2,X4)
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| X1 != relation_dom_restriction(X2,X3)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( X1 = esk12_0
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ relation(X3)
| ~ function(X3) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_28,plain,
! [X4,X5,X6] :
( ( in(X5,relation_dom(X6))
| ~ in(X5,relation_dom(relation_dom_restriction(X6,X4)))
| ~ relation(X6)
| ~ function(X6) )
& ( in(X5,X4)
| ~ in(X5,relation_dom(relation_dom_restriction(X6,X4)))
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X5,relation_dom(X6))
| ~ in(X5,X4)
| in(X5,relation_dom(relation_dom_restriction(X6,X4)))
| ~ relation(X6)
| ~ function(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l82_funct_1])])]) ).
cnf(c_0_29,plain,
( apply(X1,X2) = esk12_0
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk2_0,relation_dom(relation_dom_restriction(esk3_0,esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( in(X2,relation_dom(relation_dom_restriction(X1,X3)))
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,X3)
| ~ in(X2,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( apply(esk3_0,esk2_0) != esk12_0
| ~ relation(relation_dom_restriction(esk3_0,esk1_0))
| ~ function(relation_dom_restriction(esk3_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ in(esk2_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_27]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
( ~ relation(relation_dom_restriction(esk3_0,esk1_0))
| ~ function(relation_dom_restriction(esk3_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_26]),c_0_27])]),c_0_34]) ).
cnf(c_0_36,negated_conjecture,
~ relation(relation_dom_restriction(esk3_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_26]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_22]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 06:54:40 EDT 2022
% 0.14/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.017 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 : 38
% 0.24/1.41 # Proof object clause steps : 21
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 13
% 0.24/1.41 # Proof object clause conjectures : 10
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 11
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 9
% 0.24/1.41 # Proof object simplifying inferences : 20
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 46
% 0.24/1.41 # Removed by relevancy pruning/SinE : 11
% 0.24/1.41 # Initial clauses : 56
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 56
% 0.24/1.41 # Processed clauses : 1041
% 0.24/1.41 # ...of these trivial : 13
% 0.24/1.41 # ...subsumed : 745
% 0.24/1.41 # ...remaining for further processing : 283
% 0.24/1.41 # Other redundant clauses eliminated : 8
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 18
% 0.24/1.41 # Backward-rewritten : 23
% 0.24/1.41 # Generated clauses : 4715
% 0.24/1.41 # ...of the previous two non-trivial : 4107
% 0.24/1.41 # Contextual simplify-reflections : 840
% 0.24/1.41 # Paramodulations : 4698
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 17
% 0.24/1.41 # Current number of processed clauses : 242
% 0.24/1.41 # Positive orientable unit clauses : 21
% 0.24/1.41 # Positive unorientable unit clauses: 1
% 0.24/1.41 # Negative unit clauses : 14
% 0.24/1.41 # Non-unit-clauses : 206
% 0.24/1.41 # Current number of unprocessed clauses: 2849
% 0.24/1.41 # ...number of literals in the above : 18247
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 41
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 32336
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 11059
% 0.24/1.41 # Non-unit clause-clause subsumptions : 1444
% 0.24/1.41 # Unit Clause-clause subsumption calls : 377
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 12
% 0.24/1.41 # BW rewrite match successes : 12
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 77339
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.141 s
% 0.24/1.41 # System time : 0.004 s
% 0.24/1.41 # Total time : 0.145 s
% 0.24/1.41 # Maximum resident set size: 5960 pages
%------------------------------------------------------------------------------