TSTP Solution File: SWV457+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV457+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Wed Jul 20 17:47:30 EDT 2022
% Result : Theorem 9.67s 2.69s
% Output : CNFRefutation 9.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of clauses : 68 ( 41 unt; 3 nHn; 61 RR)
% Number of literals : 135 ( 64 equ; 69 neg)
% Maximal clause size : 9 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 92 ( 45 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_103,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk10_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_103) ).
cnf(i_0_100,negated_conjecture,
index(pendack,host(esk10_0)) = host(esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_100) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_56) ).
cnf(i_0_102,negated_conjecture,
elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_102) ).
cnf(i_0_87,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_87) ).
cnf(i_0_4,plain,
leq(host(X1),nbr_proc),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_4) ).
cnf(i_0_111,plain,
( index(status,host(X1)) != norm
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| index(ldr,host(X1)) != host(X1)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ leq(nbr_proc,index(pendack,host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_111) ).
cnf(i_0_101,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_101) ).
cnf(i_0_83,plain,
leq(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_83) ).
cnf(i_0_104,negated_conjecture,
setIn(esk10_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_104) ).
cnf(i_0_97,negated_conjecture,
index(status,host(esk8_0)) = norm,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_97) ).
cnf(i_0_98,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_98) ).
cnf(i_0_99,negated_conjecture,
setIn(esk8_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_99) ).
cnf(i_0_109,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_109) ).
cnf(i_0_110,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_110) ).
cnf(i_0_37,plain,
( X1 = X2
| m_Ack(X3,X1) != m_Ack(X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_37) ).
cnf(i_0_52,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_52) ).
cnf(i_0_36,plain,
( X1 = X2
| m_Ack(X1,X3) != m_Ack(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_36) ).
cnf(i_0_112,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X2)) != norm
| index(status,host(X1)) != elec_2
| index(ldr,host(X2)) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Halt(X1),queue(host(X6))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_112) ).
cnf(i_0_107,negated_conjecture,
host(esk8_0) != host(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2iniq63o/input.p',i_0_107) ).
cnf(c_0_133,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk10_0))),
i_0_103 ).
cnf(c_0_134,negated_conjecture,
index(pendack,host(esk10_0)) = host(esk9_0),
i_0_100 ).
cnf(c_0_135,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_136,negated_conjecture,
elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0))),
i_0_102 ).
cnf(c_0_137,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_87 ).
cnf(c_0_138,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_139,plain,
leq(host(X1),nbr_proc),
i_0_4 ).
cnf(c_0_140,plain,
( index(status,host(X1)) != norm
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| index(ldr,host(X1)) != host(X1)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ leq(nbr_proc,index(pendack,host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2))) ),
i_0_111 ).
cnf(c_0_141,negated_conjecture,
( m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0)
| elem(m_Ack(esk10_0,esk9_0),queue(host(esk10_0))) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_142,plain,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139])]) ).
cnf(c_0_143,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
i_0_101 ).
cnf(c_0_144,plain,
leq(X1,X1),
i_0_83 ).
cnf(c_0_145,negated_conjecture,
setIn(esk10_0,alive),
i_0_104 ).
cnf(c_0_146,plain,
( m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0)
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142]),c_0_134]),c_0_142]),c_0_143]),c_0_134]),c_0_142]),c_0_144]),c_0_145])]) ).
cnf(c_0_147,negated_conjecture,
index(status,host(esk8_0)) = norm,
i_0_97 ).
cnf(c_0_148,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
i_0_98 ).
cnf(c_0_149,negated_conjecture,
setIn(esk8_0,alive),
i_0_99 ).
cnf(c_0_150,negated_conjecture,
( m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0)
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),c_0_149])]) ).
cnf(c_0_151,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
i_0_109 ).
cnf(c_0_152,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
i_0_110 ).
cnf(c_0_153,plain,
( X1 = X2
| m_Ack(X3,X1) != m_Ack(X4,X2) ),
i_0_37 ).
cnf(c_0_154,negated_conjecture,
m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_155,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
i_0_52 ).
cnf(c_0_156,negated_conjecture,
cons(m_Halt(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_152,c_0_151]) ).
cnf(c_0_157,plain,
( esk6_0 = X1
| m_Ack(esk10_0,esk9_0) != m_Ack(X2,X1) ),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_158,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_155]) ).
cnf(c_0_159,plain,
( queue(host(X1)) = queue(host(esk6_0))
| ~ epred1_3(esk5_0,X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_152,c_0_156]) ).
cnf(c_0_160,plain,
esk9_0 = esk6_0,
inference(er,[status(thm)],[c_0_157]) ).
cnf(c_0_161,plain,
elem(m_Halt(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_158,c_0_156]) ).
cnf(c_0_162,plain,
( queue(host(esk6_0)) = queue(nbr_proc)
| ~ epred1_3(esk5_0,esk9_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_159,c_0_142]) ).
cnf(c_0_163,plain,
( X1 = X2
| m_Ack(X1,X3) != m_Ack(X2,X4) ),
i_0_36 ).
cnf(c_0_164,negated_conjecture,
m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk6_0),
inference(rw,[status(thm)],[c_0_154,c_0_160]) ).
cnf(c_0_165,plain,
( elem(m_Halt(esk7_0),queue(nbr_proc))
| ~ epred1_3(esk5_0,esk9_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_161,c_0_162]) ).
cnf(c_0_166,plain,
( esk7_0 = X1
| m_Ack(esk10_0,esk6_0) != m_Ack(X1,X2) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_167,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X2)) != norm
| index(status,host(X1)) != elec_2
| index(ldr,host(X2)) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Halt(X1),queue(host(X6))) ),
i_0_112 ).
cnf(c_0_168,negated_conjecture,
index(pendack,host(esk10_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_134,c_0_142]) ).
cnf(c_0_169,plain,
elem(m_Halt(esk7_0),queue(nbr_proc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_160]),c_0_151])]) ).
cnf(c_0_170,plain,
esk7_0 = esk10_0,
inference(er,[status(thm)],[c_0_166]) ).
cnf(c_0_171,plain,
( leq(nbr_proc,host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ elem(m_Halt(esk10_0),queue(host(X2)))
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_143]),c_0_145])]) ).
cnf(c_0_172,plain,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_142,c_0_160]) ).
cnf(c_0_173,plain,
elem(m_Halt(esk10_0),queue(nbr_proc)),
inference(rw,[status(thm)],[c_0_169,c_0_170]) ).
cnf(c_0_174,plain,
( leq(nbr_proc,host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_173])]) ).
cnf(c_0_175,negated_conjecture,
( leq(nbr_proc,host(esk8_0))
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_147]),c_0_148]),c_0_149])]) ).
cnf(c_0_176,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk10_0),
inference(rw,[status(thm)],[c_0_151,c_0_170]) ).
cnf(c_0_177,negated_conjecture,
host(esk8_0) != host(esk6_0),
i_0_107 ).
cnf(c_0_178,negated_conjecture,
leq(nbr_proc,host(esk8_0)),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_179,negated_conjecture,
host(esk8_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_177,c_0_172]) ).
cnf(c_0_180,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_178]),c_0_139])]),c_0_179]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV457+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.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 : Wed Jun 15 09:48:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.67/2.69 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.67/2.69 # Version: 2.1pre011
% 9.67/2.69 # Preprocessing time : 0.021 s
% 9.67/2.69
% 9.67/2.69 # Proof found!
% 9.67/2.69 # SZS status Theorem
% 9.67/2.69 # SZS output start CNFRefutation
% See solution above
% 9.67/2.69 # Proof object total steps : 68
% 9.67/2.69 # Proof object clause steps : 48
% 9.67/2.69 # Proof object formula steps : 20
% 9.67/2.69 # Proof object conjectures : 31
% 9.67/2.69 # Proof object clause conjectures : 21
% 9.67/2.69 # Proof object formula conjectures : 10
% 9.67/2.69 # Proof object initial clauses used : 20
% 9.67/2.69 # Proof object initial formulas used : 20
% 9.67/2.69 # Proof object generating inferences : 19
% 9.67/2.69 # Proof object simplifying inferences : 36
% 9.67/2.69 # Training examples: 0 positive, 0 negative
% 9.67/2.69 # Parsed axioms : 120
% 9.67/2.69 # Removed by relevancy pruning/SinE : 0
% 9.67/2.69 # Initial clauses : 120
% 9.67/2.69 # Removed in clause preprocessing : 0
% 9.67/2.69 # Initial clauses in saturation : 120
% 9.67/2.69 # Processed clauses : 1485
% 9.67/2.69 # ...of these trivial : 56
% 9.67/2.69 # ...subsumed : 668
% 9.67/2.69 # ...remaining for further processing : 761
% 9.67/2.69 # Other redundant clauses eliminated : 4
% 9.67/2.69 # Clauses deleted for lack of memory : 0
% 9.67/2.69 # Backward-subsumed : 35
% 9.67/2.69 # Backward-rewritten : 88
% 9.67/2.69 # Generated clauses : 8364
% 9.67/2.69 # ...of the previous two non-trivial : 7195
% 9.67/2.69 # Contextual simplify-reflections : 165
% 9.67/2.69 # Paramodulations : 8212
% 9.67/2.69 # Factorizations : 108
% 9.67/2.69 # Equation resolutions : 43
% 9.67/2.69 # Propositional unsat checks : 0
% 9.67/2.69 # Propositional unsat check successes : 0
% 9.67/2.69 # Current number of processed clauses : 633
% 9.67/2.69 # Positive orientable unit clauses : 59
% 9.67/2.69 # Positive unorientable unit clauses: 0
% 9.67/2.69 # Negative unit clauses : 60
% 9.67/2.69 # Non-unit-clauses : 514
% 9.67/2.69 # Current number of unprocessed clauses: 5125
% 9.67/2.69 # ...number of literals in the above : 19044
% 9.67/2.69 # Current number of archived formulas : 0
% 9.67/2.69 # Current number of archived clauses : 124
% 9.67/2.69 # Clause-clause subsumption calls (NU) : 92134
% 9.67/2.69 # Rec. Clause-clause subsumption calls : 42001
% 9.67/2.69 # Non-unit clause-clause subsumptions : 581
% 9.67/2.69 # Unit Clause-clause subsumption calls : 2801
% 9.67/2.69 # Rewrite failures with RHS unbound : 0
% 9.67/2.69 # BW rewrite match attempts : 41
% 9.67/2.69 # BW rewrite match successes : 15
% 9.67/2.69 # Condensation attempts : 0
% 9.67/2.69 # Condensation successes : 0
% 9.67/2.69 # Termbank termtop insertions : 123144
% 9.67/2.69
% 9.67/2.69 # -------------------------------------------------
% 9.67/2.69 # User time : 0.224 s
% 9.67/2.69 # System time : 0.009 s
% 9.67/2.69 # Total time : 0.233 s
% 9.67/2.69 # ...preprocessing : 0.021 s
% 9.67/2.69 # ...main loop : 0.212 s
% 9.67/2.69 # Maximum resident set size: 9996 pages
% 9.67/2.69
%------------------------------------------------------------------------------