TSTP Solution File: NUM609+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM609+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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 : Mon Jul 18 09:34:22 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 17 unt; 0 def)
% Number of atoms : 164 ( 31 equ)
% Maximal formula atoms : 52 ( 3 avg)
% Number of connectives : 203 ( 81 ~; 85 |; 27 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 47 ( 3 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefDiff) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefSub) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5164) ).
fof(m__5147,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5147) ).
fof(m__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5093) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4891) ).
fof(mImgElm,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElement0(sdtlpdtrp0(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mImgElm) ).
fof(m__4982,hypothesis,
! [X1] :
( aElementOf0(X1,xO)
=> ? [X2] :
( aElementOf0(X2,szNzAzT0)
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X2) = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4982) ).
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4660) ).
fof(m__5182,hypothesis,
aElementOf0(xp,xO),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5182) ).
fof(m__,conjecture,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8,X8,X7] :
( ( aSet0(X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(X8)
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( X8 != X6
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| X8 = X6
| aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk15_3(X5,X6,X7),X7)
| ~ aElement0(esk15_3(X5,X6,X7))
| ~ aElementOf0(esk15_3(X5,X6,X7),X5)
| esk15_3(X5,X6,X7) = X6
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(esk15_3(X5,X6,X7))
| aElementOf0(esk15_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk15_3(X5,X6,X7),X5)
| aElementOf0(esk15_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( esk15_3(X5,X6,X7) != X6
| aElementOf0(esk15_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(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)],[mDefDiff])])])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk7_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk7_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
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)],[mDefSub])])])])])])]) ).
cnf(c_0_13,plain,
( aElementOf0(X4,X2)
| ~ aElement0(X1)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_15,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_16,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[m__5093]) ).
cnf(c_0_18,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ aFunction0(X3)
| ~ aElementOf0(X4,szDzozmdt0(X3))
| aElement0(sdtlpdtrp0(X3,X4)) ),
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)],[mImgElm])])])])]) ).
fof(c_0_20,hypothesis,
! [X3] :
( ( aElementOf0(esk6_1(X3),szNzAzT0)
| ~ aElementOf0(X3,xO) )
& ( aElementOf0(esk6_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ~ aElementOf0(X3,xO) )
& ( sdtlpdtrp0(xe,esk6_1(X3)) = X3
| ~ aElementOf0(X3,xO) ) ),
inference(distribute,[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)],[m__4982])])])])])]) ).
fof(c_0_21,hypothesis,
! [X2] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( ~ aElementOf0(X2,szNzAzT0)
| sdtlpdtrp0(xe,X2) = szmzizndt0(sdtlpdtrp0(xN,X2)) ) ),
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)],[m__4660])])])])]) ).
cnf(c_0_22,plain,
( aElementOf0(X1,X2)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| ~ aElement0(X3)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_23,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
( aElement0(sdtlpdtrp0(X1,X2))
| ~ aElementOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
( sdtlpdtrp0(xe,esk6_1(X1)) = X1
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,hypothesis,
aFunction0(xe),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
szDzozmdt0(xe) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,hypothesis,
( aElementOf0(esk6_1(X1),szNzAzT0)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP)
| ~ aElement0(xp) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,hypothesis,
( aElement0(X1)
| ~ aElementOf0(X1,xO) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xp,xO),
inference(split_conjunct,[status(thm)],[m__5182]) ).
fof(c_0_33,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_34,hypothesis,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk7_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
fof(c_0_37,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,hypothesis,
( aSubsetOf0(xP,X1)
| aElementOf0(esk7_2(X1,xP),xQ)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]),c_0_24])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM609+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n023.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 : Fri Jul 8 01:37:11 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.25/1.42 # Preprocessing time : 0.019 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 107
% 0.25/1.42 # Removed by relevancy pruning/SinE : 93
% 0.25/1.42 # Initial clauses : 29
% 0.25/1.42 # Removed in clause preprocessing : 1
% 0.25/1.42 # Initial clauses in saturation : 28
% 0.25/1.42 # Processed clauses : 48
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 48
% 0.25/1.42 # Other redundant clauses eliminated : 1
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 1
% 0.25/1.42 # Generated clauses : 23
% 0.25/1.42 # ...of the previous two non-trivial : 20
% 0.25/1.42 # Contextual simplify-reflections : 3
% 0.25/1.42 # Paramodulations : 15
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 8
% 0.25/1.42 # Current number of processed clauses : 46
% 0.25/1.42 # Positive orientable unit clauses : 4
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 1
% 0.25/1.42 # Non-unit-clauses : 41
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 1
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 270
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 34
% 0.25/1.42 # Non-unit clause-clause subsumptions : 3
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 4291
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.019 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.021 s
% 0.25/1.42 # Maximum resident set size: 3204 pages
% 0.25/1.42 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.25/1.42 # Preprocessing time : 0.024 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 42
% 0.25/1.42 # Proof object clause steps : 24
% 0.25/1.42 # Proof object formula steps : 18
% 0.25/1.42 # Proof object conjectures : 4
% 0.25/1.42 # Proof object clause conjectures : 1
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 16
% 0.25/1.42 # Proof object initial formulas used : 11
% 0.25/1.42 # Proof object generating inferences : 7
% 0.25/1.42 # Proof object simplifying inferences : 17
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 107
% 0.25/1.42 # Removed by relevancy pruning/SinE : 18
% 0.25/1.42 # Initial clauses : 167
% 0.25/1.42 # Removed in clause preprocessing : 6
% 0.25/1.42 # Initial clauses in saturation : 161
% 0.25/1.42 # Processed clauses : 487
% 0.25/1.42 # ...of these trivial : 9
% 0.25/1.42 # ...subsumed : 112
% 0.25/1.42 # ...remaining for further processing : 366
% 0.25/1.42 # Other redundant clauses eliminated : 12
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 20
% 0.25/1.42 # Backward-rewritten : 12
% 0.25/1.42 # Generated clauses : 1368
% 0.25/1.42 # ...of the previous two non-trivial : 1282
% 0.25/1.42 # Contextual simplify-reflections : 70
% 0.25/1.42 # Paramodulations : 1318
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 50
% 0.25/1.42 # Current number of processed clauses : 332
% 0.25/1.42 # Positive orientable unit clauses : 58
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 22
% 0.25/1.42 # Non-unit-clauses : 252
% 0.25/1.42 # Current number of unprocessed clauses: 849
% 0.25/1.42 # ...number of literals in the above : 4170
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 32
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 6703
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 1804
% 0.25/1.42 # Non-unit clause-clause subsumptions : 126
% 0.25/1.42 # Unit Clause-clause subsumption calls : 977
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 2
% 0.25/1.42 # BW rewrite match successes : 2
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 33284
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.070 s
% 0.25/1.42 # System time : 0.006 s
% 0.25/1.42 # Total time : 0.076 s
% 0.25/1.42 # Maximum resident set size: 5044 pages
%------------------------------------------------------------------------------