TSTP Solution File: SWV454+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:29 EDT 2022
% Result : Theorem 8.02s 2.55s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 41 ( 27 unt; 0 nHn; 39 RR)
% Number of literals : 85 ( 33 equ; 50 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 58 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_116,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_116) ).
cnf(i_0_115,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_115) ).
cnf(i_0_106,negated_conjecture,
host(esk6_0) = host(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_106) ).
cnf(i_0_51,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_51) ).
cnf(i_0_118,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_118) ).
cnf(i_0_117,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_117) ).
cnf(i_0_102,negated_conjecture,
setIn(esk8_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_102) ).
cnf(i_0_103,negated_conjecture,
host(esk10_0) != host(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_103) ).
cnf(i_0_99,negated_conjecture,
host(esk10_0) = host(esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_99) ).
cnf(i_0_101,negated_conjecture,
setIn(esk10_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_101) ).
cnf(i_0_97,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk10_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_97) ).
cnf(i_0_114,negated_conjecture,
setIn(esk6_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_114) ).
cnf(i_0_100,negated_conjecture,
host(esk9_0) = host(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_100) ).
cnf(i_0_98,negated_conjecture,
elem(m_Down(esk11_0),esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1gj5pzis/lgb.p',i_0_98) ).
cnf(c_0_133,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_116 ).
cnf(c_0_134,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
i_0_115 ).
cnf(c_0_135,negated_conjecture,
host(esk6_0) = host(esk8_0),
i_0_106 ).
cnf(c_0_136,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
i_0_51 ).
cnf(c_0_137,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk8_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135]) ).
cnf(c_0_138,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
i_0_118 ).
cnf(c_0_139,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
i_0_117 ).
cnf(c_0_140,plain,
( elem(X1,queue(host(esk8_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,negated_conjecture,
setIn(esk8_0,alive),
i_0_102 ).
cnf(c_0_142,negated_conjecture,
host(esk10_0) != host(esk8_0),
i_0_103 ).
cnf(c_0_143,negated_conjecture,
host(esk10_0) = host(esk11_0),
i_0_99 ).
cnf(c_0_144,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_138,c_0_134]) ).
cnf(c_0_145,plain,
( host(X1) = host(esk8_0)
| host(esk8_0) != host(X2)
| host(X1) != host(X3)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),esk5_0)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141])]) ).
cnf(c_0_146,negated_conjecture,
setIn(esk10_0,alive),
i_0_101 ).
cnf(c_0_147,negated_conjecture,
host(esk8_0) != host(esk11_0),
inference(rw,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_148,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk10_0))),
i_0_97 ).
cnf(c_0_149,negated_conjecture,
( X1 = esk8_0
| host(X1) != host(esk8_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_144,c_0_141]) ).
cnf(c_0_150,negated_conjecture,
setIn(esk6_0,alive),
i_0_114 ).
cnf(c_0_151,negated_conjecture,
( host(esk8_0) != host(X1)
| host(esk11_0) != host(X2)
| ~ elem(m_Down(X1),queue(host(esk11_0)))
| ~ elem(m_Down(X2),esk5_0)
| ~ epred1_3(X3,X4,X5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_143]),c_0_146])]),c_0_147]) ).
cnf(c_0_152,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk11_0))),
inference(rw,[status(thm)],[c_0_148,c_0_143]) ).
cnf(c_0_153,negated_conjecture,
host(esk9_0) = host(esk8_0),
i_0_100 ).
cnf(c_0_154,negated_conjecture,
esk6_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_135])]) ).
cnf(c_0_155,negated_conjecture,
( host(esk11_0) != host(X1)
| ~ elem(m_Down(X1),esk5_0)
| ~ epred1_3(X2,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153])]) ).
cnf(c_0_156,negated_conjecture,
elem(m_Down(esk11_0),esk5_0),
i_0_98 ).
cnf(c_0_157,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk8_0),
inference(rw,[status(thm)],[c_0_134,c_0_154]) ).
cnf(c_0_158,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(spm,[status(thm)],[c_0_155,c_0_156]) ).
cnf(c_0_159,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_157,c_0_158]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 14:16:41 EDT 2022
% 0.13/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
% 8.02/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.02/2.55 # No SInE strategy applied
% 8.02/2.55 # Trying AutoSched0 for 150 seconds
% 8.02/2.55 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.02/2.55 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.02/2.55 #
% 8.02/2.55 # Preprocessing time : 0.023 s
% 8.02/2.55
% 8.02/2.55 # Proof found!
% 8.02/2.55 # SZS status Theorem
% 8.02/2.55 # SZS output start CNFRefutation
% See solution above
% 8.02/2.55 # Training examples: 0 positive, 0 negative
% 8.02/2.55
% 8.02/2.55 # -------------------------------------------------
% 8.02/2.55 # User time : 0.030 s
% 8.02/2.55 # System time : 0.008 s
% 8.02/2.55 # Total time : 0.038 s
% 8.02/2.55 # Maximum resident set size: 7124 pages
% 8.02/2.55
%------------------------------------------------------------------------------