TSTP Solution File: SWV449+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV449+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:28 EDT 2022
% Result : Theorem 7.86s 2.49s
% Output : CNFRefutation 7.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 25 unt; 2 nHn; 34 RR)
% Number of literals : 66 ( 26 equ; 34 neg)
% Maximal clause size : 8 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 56 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_100,negated_conjecture,
host(esk11_0) = host(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_100) ).
cnf(i_0_106,negated_conjecture,
host(esk7_0) = host(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_106) ).
cnf(i_0_115,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_115) ).
cnf(i_0_114,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_114) ).
cnf(i_0_116,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_4(X5,X6,X7,X8)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_116) ).
cnf(i_0_98,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_98) ).
cnf(i_0_101,negated_conjecture,
setIn(esk12_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_101) ).
cnf(i_0_51,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_51) ).
cnf(i_0_113,negated_conjecture,
setIn(esk7_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_113) ).
cnf(i_0_104,negated_conjecture,
host(esk12_0) != host(esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_104) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_56) ).
cnf(i_0_97,negated_conjecture,
elem(m_Down(esk13_0),snoc(esk5_0,m_Ldr(esk7_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_97) ).
cnf(i_0_18,plain,
m_Ldr(X1) != m_Down(X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_18) ).
cnf(i_0_99,negated_conjecture,
host(esk12_0) = host(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p7c675gu/input.p',i_0_99) ).
cnf(c_0_131,negated_conjecture,
host(esk11_0) = host(esk10_0),
i_0_100 ).
cnf(c_0_132,negated_conjecture,
host(esk7_0) = host(esk10_0),
i_0_106 ).
cnf(c_0_133,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
i_0_115 ).
cnf(c_0_134,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
i_0_114 ).
cnf(c_0_135,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_4(X5,X6,X7,X8)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
i_0_116 ).
cnf(c_0_136,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
i_0_98 ).
cnf(c_0_137,negated_conjecture,
host(esk11_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_138,negated_conjecture,
setIn(esk12_0,alive),
i_0_101 ).
cnf(c_0_139,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
i_0_51 ).
cnf(c_0_140,negated_conjecture,
cons(m_Ack(esk6_0,esk8_0),esk5_0) = queue(host(esk7_0)),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_141,negated_conjecture,
( host(X1) = host(esk12_0)
| host(esk12_0) != host(X2)
| host(X1) != host(esk7_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137]),c_0_138])]) ).
cnf(c_0_142,plain,
( elem(X1,queue(host(esk7_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_143,negated_conjecture,
setIn(esk7_0,alive),
i_0_113 ).
cnf(c_0_144,negated_conjecture,
host(esk12_0) != host(esk7_0),
i_0_104 ).
cnf(c_0_145,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_146,negated_conjecture,
elem(m_Down(esk13_0),snoc(esk5_0,m_Ldr(esk7_0))),
i_0_97 ).
cnf(c_0_147,plain,
m_Ldr(X1) != m_Down(X2),
i_0_18 ).
cnf(c_0_148,plain,
( host(esk12_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143])]),c_0_144]) ).
cnf(c_0_149,negated_conjecture,
elem(m_Down(esk13_0),esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147]) ).
cnf(c_0_150,negated_conjecture,
host(esk12_0) = host(esk13_0),
i_0_99 ).
cnf(c_0_151,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150])]) ).
cnf(c_0_152,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_134,c_0_151]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV449+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 17:35:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.86/2.49 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.86/2.49 # Version: 2.1pre011
% 7.86/2.49 # Preprocessing time : 0.012 s
% 7.86/2.49
% 7.86/2.49 # Proof found!
% 7.86/2.49 # SZS status Theorem
% 7.86/2.49 # SZS output start CNFRefutation
% See solution above
% 7.86/2.49 # Proof object total steps : 36
% 7.86/2.49 # Proof object clause steps : 22
% 7.86/2.49 # Proof object formula steps : 14
% 7.86/2.49 # Proof object conjectures : 24
% 7.86/2.49 # Proof object clause conjectures : 15
% 7.86/2.49 # Proof object formula conjectures : 9
% 7.86/2.49 # Proof object initial clauses used : 14
% 7.86/2.49 # Proof object initial formulas used : 14
% 7.86/2.49 # Proof object generating inferences : 6
% 7.86/2.49 # Proof object simplifying inferences : 11
% 7.86/2.49 # Training examples: 0 positive, 0 negative
% 7.86/2.49 # Parsed axioms : 117
% 7.86/2.49 # Removed by relevancy pruning/SinE : 0
% 7.86/2.49 # Initial clauses : 117
% 7.86/2.49 # Removed in clause preprocessing : 0
% 7.86/2.49 # Initial clauses in saturation : 117
% 7.86/2.49 # Processed clauses : 334
% 7.86/2.49 # ...of these trivial : 9
% 7.86/2.49 # ...subsumed : 85
% 7.86/2.49 # ...remaining for further processing : 240
% 7.86/2.49 # Other redundant clauses eliminated : 9
% 7.86/2.49 # Clauses deleted for lack of memory : 0
% 7.86/2.49 # Backward-subsumed : 2
% 7.86/2.49 # Backward-rewritten : 15
% 7.86/2.49 # Generated clauses : 674
% 7.86/2.49 # ...of the previous two non-trivial : 534
% 7.86/2.49 # Contextual simplify-reflections : 23
% 7.86/2.49 # Paramodulations : 642
% 7.86/2.49 # Factorizations : 2
% 7.86/2.49 # Equation resolutions : 29
% 7.86/2.49 # Propositional unsat checks : 0
% 7.86/2.49 # Propositional unsat check successes : 0
% 7.86/2.49 # Current number of processed clauses : 218
% 7.86/2.49 # Positive orientable unit clauses : 42
% 7.86/2.49 # Positive unorientable unit clauses: 0
% 7.86/2.49 # Negative unit clauses : 46
% 7.86/2.49 # Non-unit-clauses : 130
% 7.86/2.49 # Current number of unprocessed clauses: 304
% 7.86/2.49 # ...number of literals in the above : 987
% 7.86/2.49 # Current number of archived formulas : 0
% 7.86/2.49 # Current number of archived clauses : 18
% 7.86/2.49 # Clause-clause subsumption calls (NU) : 3620
% 7.86/2.49 # Rec. Clause-clause subsumption calls : 2662
% 7.86/2.49 # Non-unit clause-clause subsumptions : 82
% 7.86/2.49 # Unit Clause-clause subsumption calls : 1036
% 7.86/2.49 # Rewrite failures with RHS unbound : 0
% 7.86/2.49 # BW rewrite match attempts : 13
% 7.86/2.49 # BW rewrite match successes : 5
% 7.86/2.49 # Condensation attempts : 0
% 7.86/2.49 # Condensation successes : 0
% 7.86/2.49 # Termbank termtop insertions : 9180
% 7.86/2.49
% 7.86/2.49 # -------------------------------------------------
% 7.86/2.49 # User time : 0.021 s
% 7.86/2.49 # System time : 0.004 s
% 7.86/2.49 # Total time : 0.025 s
% 7.86/2.49 # ...preprocessing : 0.012 s
% 7.86/2.49 # ...main loop : 0.013 s
% 7.86/2.49 # Maximum resident set size: 7128 pages
% 7.86/2.49
%------------------------------------------------------------------------------