TSTP Solution File: SWV460+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:31 EDT 2022
% Result : Theorem 10.87s 2.87s
% Output : CNFRefutation 10.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 44 ( 25 unt; 4 nHn; 38 RR)
% Number of literals : 94 ( 21 equ; 50 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-2 aty)
% Number of variables : 66 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_52) ).
cnf(i_0_112,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_112) ).
cnf(i_0_111,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_111) ).
cnf(i_0_88,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_88) ).
cnf(i_0_97,negated_conjecture,
leq(s(host(esk6_0)),index(pendack,host(esk9_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_97) ).
cnf(i_0_106,negated_conjecture,
( X1 = host(esk7_0)
| leq(host(esk6_0),X1)
| setIn(X1,index(down,host(esk6_0)))
| ~ leq(s(zero),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_106) ).
cnf(i_0_2,plain,
leq(s(zero),host(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_2) ).
cnf(i_0_114,plain,
( leq(index(pendack,host(X1)),host(X2))
| host(X1) != host(X3)
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X3),queue(host(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_114) ).
cnf(i_0_110,negated_conjecture,
setIn(esk6_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_110) ).
cnf(i_0_90,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_90) ).
cnf(i_0_118,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(host(X1),index(down,host(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_118) ).
cnf(i_0_82,plain,
~ leq(s(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_82) ).
cnf(i_0_101,negated_conjecture,
~ leq(host(esk8_0),host(esk9_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_101) ).
cnf(i_0_103,negated_conjecture,
host(esk6_0) = host(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_103) ).
cnf(i_0_98,negated_conjecture,
index(status,host(esk9_0)) = elec_2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_98) ).
cnf(i_0_99,negated_conjecture,
setIn(esk9_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlj1oofr/input.p',i_0_99) ).
cnf(c_0_135,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
i_0_52 ).
cnf(c_0_136,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_112 ).
cnf(c_0_137,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
i_0_111 ).
cnf(c_0_138,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_135]) ).
cnf(c_0_139,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_140,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_88 ).
cnf(c_0_141,negated_conjecture,
leq(s(host(esk6_0)),index(pendack,host(esk9_0))),
i_0_97 ).
cnf(c_0_142,negated_conjecture,
( X1 = host(esk7_0)
| leq(host(esk6_0),X1)
| setIn(X1,index(down,host(esk6_0)))
| ~ leq(s(zero),X1) ),
i_0_106 ).
cnf(c_0_143,plain,
leq(s(zero),host(X1)),
i_0_2 ).
cnf(c_0_144,plain,
( leq(index(pendack,host(X1)),host(X2))
| host(X1) != host(X3)
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X3),queue(host(X2))) ),
i_0_114 ).
cnf(c_0_145,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_146,negated_conjecture,
setIn(esk6_0,alive),
i_0_110 ).
cnf(c_0_147,negated_conjecture,
( leq(X1,index(pendack,host(esk9_0)))
| ~ leq(X1,s(host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_148,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
i_0_90 ).
cnf(c_0_149,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(host(X1),index(down,host(X2))) ),
i_0_118 ).
cnf(c_0_150,plain,
( host(X1) = host(esk7_0)
| leq(host(esk6_0),host(X1))
| setIn(host(X1),index(down,host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_151,plain,
( leq(index(pendack,host(X1)),host(esk6_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(esk7_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146])]) ).
cnf(c_0_152,plain,
~ leq(s(X1),X1),
i_0_82 ).
cnf(c_0_153,plain,
( leq(s(X1),index(pendack,host(esk9_0)))
| ~ leq(X1,host(esk6_0)) ),
inference(spm,[status(thm)],[c_0_147,c_0_148]) ).
cnf(c_0_154,negated_conjecture,
~ leq(host(esk8_0),host(esk9_0)),
i_0_101 ).
cnf(c_0_155,negated_conjecture,
host(esk6_0) = host(esk8_0),
i_0_103 ).
cnf(c_0_156,plain,
( leq(index(pendack,host(X1)),host(esk6_0))
| leq(host(esk6_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_146])]),c_0_151]) ).
cnf(c_0_157,negated_conjecture,
index(status,host(esk9_0)) = elec_2,
i_0_98 ).
cnf(c_0_158,negated_conjecture,
setIn(esk9_0,alive),
i_0_99 ).
cnf(c_0_159,plain,
~ leq(index(pendack,host(esk9_0)),host(esk6_0)),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_160,negated_conjecture,
~ leq(host(esk6_0),host(esk9_0)),
inference(rw,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_161,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158])]),c_0_159]),c_0_160]) ).
cnf(c_0_162,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_137,c_0_161]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 21:04:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.87/2.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 10.87/2.87 # Version: 2.1pre011
% 10.87/2.87 # Preprocessing time : 0.017 s
% 10.87/2.87
% 10.87/2.87 # Proof found!
% 10.87/2.87 # SZS status Theorem
% 10.87/2.87 # SZS output start CNFRefutation
% See solution above
% 10.87/2.87 # Proof object total steps : 44
% 10.87/2.87 # Proof object clause steps : 28
% 10.87/2.87 # Proof object formula steps : 16
% 10.87/2.87 # Proof object conjectures : 22
% 10.87/2.87 # Proof object clause conjectures : 14
% 10.87/2.87 # Proof object formula conjectures : 8
% 10.87/2.87 # Proof object initial clauses used : 16
% 10.87/2.87 # Proof object initial formulas used : 16
% 10.87/2.87 # Proof object generating inferences : 9
% 10.87/2.87 # Proof object simplifying inferences : 12
% 10.87/2.87 # Training examples: 0 positive, 0 negative
% 10.87/2.87 # Parsed axioms : 119
% 10.87/2.87 # Removed by relevancy pruning/SinE : 0
% 10.87/2.87 # Initial clauses : 119
% 10.87/2.87 # Removed in clause preprocessing : 0
% 10.87/2.87 # Initial clauses in saturation : 119
% 10.87/2.87 # Processed clauses : 1705
% 10.87/2.87 # ...of these trivial : 57
% 10.87/2.87 # ...subsumed : 1021
% 10.87/2.87 # ...remaining for further processing : 627
% 10.87/2.87 # Other redundant clauses eliminated : 10
% 10.87/2.87 # Clauses deleted for lack of memory : 0
% 10.87/2.87 # Backward-subsumed : 27
% 10.87/2.87 # Backward-rewritten : 12
% 10.87/2.87 # Generated clauses : 16644
% 10.87/2.87 # ...of the previous two non-trivial : 11245
% 10.87/2.87 # Contextual simplify-reflections : 287
% 10.87/2.87 # Paramodulations : 16525
% 10.87/2.87 # Factorizations : 79
% 10.87/2.87 # Equation resolutions : 38
% 10.87/2.87 # Propositional unsat checks : 0
% 10.87/2.87 # Propositional unsat check successes : 0
% 10.87/2.87 # Current number of processed clauses : 582
% 10.87/2.87 # Positive orientable unit clauses : 73
% 10.87/2.87 # Positive unorientable unit clauses: 0
% 10.87/2.87 # Negative unit clauses : 79
% 10.87/2.87 # Non-unit-clauses : 430
% 10.87/2.87 # Current number of unprocessed clauses: 8793
% 10.87/2.87 # ...number of literals in the above : 29931
% 10.87/2.87 # Current number of archived formulas : 0
% 10.87/2.87 # Current number of archived clauses : 41
% 10.87/2.87 # Clause-clause subsumption calls (NU) : 99064
% 10.87/2.87 # Rec. Clause-clause subsumption calls : 75815
% 10.87/2.87 # Non-unit clause-clause subsumptions : 892
% 10.87/2.87 # Unit Clause-clause subsumption calls : 4417
% 10.87/2.87 # Rewrite failures with RHS unbound : 0
% 10.87/2.87 # BW rewrite match attempts : 77
% 10.87/2.87 # BW rewrite match successes : 12
% 10.87/2.87 # Condensation attempts : 0
% 10.87/2.87 # Condensation successes : 0
% 10.87/2.87 # Termbank termtop insertions : 216130
% 10.87/2.87
% 10.87/2.87 # -------------------------------------------------
% 10.87/2.87 # User time : 0.293 s
% 10.87/2.87 # System time : 0.005 s
% 10.87/2.87 # Total time : 0.298 s
% 10.87/2.87 # ...preprocessing : 0.017 s
% 10.87/2.87 # ...main loop : 0.281 s
% 10.87/2.87 # Maximum resident set size: 12372 pages
% 10.87/2.87
%------------------------------------------------------------------------------