%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO009+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 17:43:39 EDT 2022
% Result : Theorem 10.32s 2.76s
% Output : CNFRefutation 10.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 27
% Syntax : Number of clauses : 93 ( 29 unt; 16 nHn; 93 RR)
% Number of literals : 202 ( 20 equ; 96 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 101 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_67,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_67) ).
cnf(i_0_88,negated_conjecture,
occurrence_of(esk19_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_88) ).
cnf(i_0_65,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_65) ).
cnf(i_0_68,plain,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_68) ).
cnf(i_0_45,plain,
( activity_occurrence(X1)
| ~ subactivity_occurrence(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_45) ).
cnf(i_0_39,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_39) ).
cnf(i_0_3,plain,
( occurrence_of(X1,esk1_1(X1))
| ~ activity_occurrence(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_3) ).
cnf(i_0_26,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_26) ).
cnf(i_0_11,plain,
( atomic(X1)
| ~ arboreal(X2)
| ~ occurrence_of(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_11) ).
cnf(i_0_15,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_15) ).
cnf(i_0_12,plain,
( arboreal(X1)
| ~ legal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_12) ).
cnf(i_0_53,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_53) ).
cnf(i_0_10,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_10) ).
cnf(i_0_72,plain,
( root_occ(esk16_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_72) ).
cnf(i_0_73,plain,
( occurrence_of(esk16_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_73) ).
cnf(i_0_61,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_61) ).
cnf(i_0_79,plain,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_79) ).
cnf(i_0_69,plain,
( occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_69) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_5) ).
cnf(i_0_66,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_66) ).
cnf(i_0_87,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk19_0)
| ~ leaf_occ(X2,esk19_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_87) ).
cnf(i_0_70,plain,
( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_70) ).
cnf(i_0_64,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_64) ).
cnf(i_0_34,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_34) ).
cnf(i_0_86,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk19_0)
| ~ leaf_occ(X2,esk19_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_86) ).
cnf(i_0_16,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_16) ).
cnf(i_0_7,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dfjh2ken/lgb.p',i_0_7) ).
cnf(c_0_116,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_67 ).
cnf(c_0_117,negated_conjecture,
occurrence_of(esk19_0,tptp0),
i_0_88 ).
cnf(c_0_118,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
i_0_65 ).
cnf(c_0_119,negated_conjecture,
leaf_occ(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_120,plain,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_68 ).
cnf(c_0_121,plain,
( activity_occurrence(X1)
| ~ subactivity_occurrence(X1,X2) ),
i_0_45 ).
cnf(c_0_122,plain,
subactivity_occurrence(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_123,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_39 ).
cnf(c_0_124,negated_conjecture,
next_subocc(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_120,c_0_117]) ).
cnf(c_0_125,plain,
( occurrence_of(X1,esk1_1(X1))
| ~ activity_occurrence(X1) ),
i_0_3 ).
cnf(c_0_126,plain,
activity_occurrence(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_127,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
i_0_26 ).
cnf(c_0_128,plain,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_129,plain,
( atomic(X1)
| ~ arboreal(X2)
| ~ occurrence_of(X2,X1) ),
i_0_11 ).
cnf(c_0_130,plain,
occurrence_of(esk18_1(esk19_0),esk1_1(esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_131,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
i_0_15 ).
cnf(c_0_132,plain,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_133,plain,
( atomic(esk1_1(esk18_1(esk19_0)))
| ~ arboreal(esk18_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_134,plain,
( arboreal(X1)
| ~ legal(X1) ),
i_0_12 ).
cnf(c_0_135,plain,
legal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_136,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4) ),
i_0_53 ).
cnf(c_0_137,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_10 ).
cnf(c_0_138,plain,
atomic(esk1_1(esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135])]) ).
cnf(c_0_139,plain,
( root_occ(esk16_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_72 ).
cnf(c_0_140,plain,
( occurrence_of(esk16_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
i_0_73 ).
cnf(c_0_141,negated_conjecture,
( X1 = X2
| min_precedes(X1,X2,tptp0)
| min_precedes(X2,X1,tptp0)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X2,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_136,c_0_117]) ).
cnf(c_0_142,plain,
arboreal(esk18_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_130]),c_0_138])]) ).
cnf(c_0_143,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
i_0_61 ).
cnf(c_0_144,negated_conjecture,
root_occ(esk16_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_139,c_0_117]) ).
cnf(c_0_145,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(spm,[status(thm)],[c_0_140,c_0_117]) ).
cnf(c_0_146,plain,
atomic(tptp3),
i_0_79 ).
cnf(c_0_147,plain,
( occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
i_0_69 ).
cnf(c_0_148,plain,
( X1 = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),X1,tptp0)
| min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_122]),c_0_142])]) ).
cnf(c_0_149,plain,
subactivity_occurrence(esk16_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_150,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_145]),c_0_146])]) ).
cnf(c_0_151,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_5 ).
cnf(c_0_152,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_147,c_0_117]) ).
cnf(c_0_153,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
i_0_66 ).
cnf(c_0_154,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk19_0)
| ~ leaf_occ(X2,esk19_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_87 ).
cnf(c_0_155,plain,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150])]) ).
cnf(c_0_156,plain,
( X1 = tptp1
| occurrence_of(esk18_1(esk19_0),tptp2)
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_157,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_151,c_0_117]) ).
cnf(c_0_158,negated_conjecture,
occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_153,c_0_119]) ).
cnf(c_0_159,plain,
( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_70 ).
cnf(c_0_160,negated_conjecture,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0)
| ~ occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_119]),c_0_144]),c_0_145])]) ).
cnf(c_0_161,plain,
( esk1_1(esk18_1(esk19_0)) = tptp1
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_156,c_0_130]) ).
cnf(c_0_162,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
i_0_64 ).
cnf(c_0_163,negated_conjecture,
esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_164,negated_conjecture,
next_subocc(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_159,c_0_117]) ).
cnf(c_0_165,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
i_0_34 ).
cnf(c_0_166,plain,
( esk1_1(esk18_1(esk19_0)) = tptp1
| esk16_1(esk19_0) = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_167,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_119]),c_0_163]) ).
cnf(c_0_168,plain,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_123,c_0_164]) ).
cnf(c_0_169,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk19_0)
| ~ leaf_occ(X2,esk19_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_86 ).
cnf(c_0_170,plain,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| esk1_1(esk18_1(esk19_0)) = tptp1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_167])]) ).
cnf(c_0_171,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
i_0_16 ).
cnf(c_0_172,plain,
precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_127,c_0_168]) ).
cnf(c_0_173,negated_conjecture,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0)
| ~ occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_155]),c_0_119]),c_0_144]),c_0_145])]) ).
cnf(c_0_174,plain,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_130,c_0_170]) ).
cnf(c_0_175,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
i_0_7 ).
cnf(c_0_176,plain,
earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_177,negated_conjecture,
( esk16_1(esk19_0) = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0) ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_178,plain,
~ earlier(esk17_1(esk19_0),esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_179,plain,
esk16_1(esk19_0) = esk18_1(esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_177]),c_0_167])]) ).
cnf(c_0_180,plain,
earlier(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_171,c_0_132]) ).
cnf(c_0_181,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_179]),c_0_180])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PRO009+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Mon Jun 13 03:35:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 10.32/2.75 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.32/2.76 # No SInE strategy applied
% 10.32/2.76 # Trying AutoSched0 for 150 seconds
% 10.32/2.76 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 10.32/2.76 # and selection function SelectCQArNTNpEqFirst.
% 10.32/2.76 #
% 10.32/2.76 # Preprocessing time : 0.014 s
% 10.32/2.76 # Presaturation interreduction done
% 10.32/2.76
% 10.32/2.76 # Proof found!
% 10.32/2.76 # SZS status Theorem
% 10.32/2.76 # SZS output start CNFRefutation
% See solution above
% 10.32/2.76 # Training examples: 0 positive, 0 negative
% 10.32/2.76
% 10.32/2.76 # -------------------------------------------------
% 10.32/2.76 # User time : 0.360 s
% 10.32/2.76 # System time : 0.015 s
% 10.32/2.76 # Total time : 0.375 s
% 10.32/2.76 # Maximum resident set size: 7128 pages
% 10.32/2.76
%------------------------------------------------------------------------------