TSTP Solution File: PRO018+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO018+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:48 EDT 2022
% Result : Theorem 8.48s 2.36s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 73 ( 30 unt; 22 nHn; 73 RR)
% Number of literals : 183 ( 18 equ; 97 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 90 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_69,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_69) ).
cnf(i_0_104,negated_conjecture,
occurrence_of(esk19_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_104) ).
cnf(i_0_103,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_103) ).
cnf(i_0_102,negated_conjecture,
arboreal(esk18_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_102) ).
cnf(i_0_101,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_101) ).
cnf(i_0_67,plain,
( leaf_occ(X1,X2)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_67) ).
cnf(i_0_8,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_8) ).
cnf(i_0_70,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_70) ).
cnf(i_0_49,plain,
( occurrence_of(esk9_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_49) ).
cnf(i_0_43,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_43) ).
cnf(i_0_47,plain,
( subactivity_occurrence(X1,esk9_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_47) ).
cnf(i_0_26,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_26) ).
cnf(i_0_76,plain,
atomic(tptp3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_76) ).
cnf(i_0_64,plain,
( X1 = esk16_1(X2)
| X1 = esk17_1(X2)
| leaf_occ(X2,X3)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk15_1(X2),X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_64) ).
cnf(i_0_7,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X1,X3)
| ~ next_subocc(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_7) ).
cnf(i_0_65,plain,
( leaf_occ(X1,X2)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_65) ).
cnf(i_0_68,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_68) ).
cnf(i_0_44,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_44) ).
cnf(i_0_38,plain,
( occurrence_of(X1,esk7_1(X1))
| ~ activity_occurrence(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_38) ).
cnf(i_0_59,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_59) ).
cnf(i_0_77,plain,
tptp3 != tptp4,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meinfmk9/lgb.p',i_0_77) ).
cnf(c_0_126,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_69 ).
cnf(c_0_127,negated_conjecture,
occurrence_of(esk19_0,tptp0),
i_0_104 ).
cnf(c_0_128,negated_conjecture,
( next_subocc(X1,esk15_1(X1),tptp0)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_129,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
i_0_103 ).
cnf(c_0_130,negated_conjecture,
arboreal(esk18_0),
i_0_102 ).
cnf(c_0_131,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
i_0_101 ).
cnf(c_0_132,plain,
( leaf_occ(X1,X2)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_67 ).
cnf(c_0_133,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_8 ).
cnf(c_0_134,negated_conjecture,
next_subocc(esk18_0,esk15_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_135,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_70 ).
cnf(c_0_136,negated_conjecture,
( min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_132,c_0_127]) ).
cnf(c_0_137,plain,
( occurrence_of(esk9_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
i_0_49 ).
cnf(c_0_138,plain,
min_precedes(esk18_0,esk15_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_139,negated_conjecture,
( occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_135,c_0_127]) ).
cnf(c_0_140,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_43 ).
cnf(c_0_141,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_142,plain,
occurrence_of(esk9_3(tptp0,esk18_0,esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_137,c_0_138]) ).
cnf(c_0_143,plain,
( subactivity_occurrence(X1,esk9_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
i_0_47 ).
cnf(c_0_144,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_26 ).
cnf(c_0_145,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_146,plain,
atomic(tptp3),
i_0_76 ).
cnf(c_0_147,plain,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk15_1(esk18_0),X1) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_148,plain,
( next_subocc(X1,esk15_1(X1),tptp0)
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_142]) ).
cnf(c_0_149,plain,
subactivity_occurrence(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_143,c_0_138]) ).
cnf(c_0_150,plain,
arboreal(esk15_1(esk18_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146])]) ).
cnf(c_0_151,plain,
~ leaf_occ(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_147,c_0_142]) ).
cnf(c_0_152,plain,
( X1 = esk16_1(X2)
| X1 = esk17_1(X2)
| leaf_occ(X2,X3)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk15_1(X2),X1,tptp0) ),
i_0_64 ).
cnf(c_0_153,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X1,X3)
| ~ next_subocc(X4,X2,X3) ),
i_0_7 ).
cnf(c_0_154,plain,
next_subocc(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150])]),c_0_151]) ).
cnf(c_0_155,negated_conjecture,
( X1 = esk16_1(X2)
| X1 = esk17_1(X2)
| leaf_occ(X2,esk19_0)
| ~ subactivity_occurrence(X2,esk19_0)
| ~ arboreal(X2)
| ~ min_precedes(esk15_1(X2),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_152,c_0_127]) ).
cnf(c_0_156,plain,
( leaf_occ(X1,X2)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_65 ).
cnf(c_0_157,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_68 ).
cnf(c_0_158,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_44 ).
cnf(c_0_159,plain,
( occurrence_of(X1,esk7_1(X1))
| ~ activity_occurrence(X1) ),
i_0_38 ).
cnf(c_0_160,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
i_0_59 ).
cnf(c_0_161,plain,
( occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_135,c_0_142]) ).
cnf(c_0_162,plain,
( ~ min_precedes(X1,esk15_1(esk15_1(esk18_0)),tptp0)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_163,negated_conjecture,
( X1 = esk17_1(esk18_0)
| X1 = esk16_1(esk18_0)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_164,plain,
min_precedes(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_133,c_0_154]) ).
cnf(c_0_165,negated_conjecture,
( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_156,c_0_127]) ).
cnf(c_0_166,negated_conjecture,
( occurrence_of(esk16_1(X1),tptp4)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_157,c_0_127]) ).
cnf(c_0_167,plain,
( X1 = esk7_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_160]) ).
cnf(c_0_168,plain,
occurrence_of(esk15_1(esk15_1(esk18_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_149]),c_0_150])]),c_0_151]) ).
cnf(c_0_169,negated_conjecture,
~ min_precedes(esk16_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_162,c_0_141]) ).
cnf(c_0_170,negated_conjecture,
( esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0)
| esk15_1(esk15_1(esk18_0)) = esk17_1(esk18_0) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_171,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_172,negated_conjecture,
occurrence_of(esk16_1(esk18_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_173,plain,
esk7_1(esk15_1(esk15_1(esk18_0))) = tptp3,
inference(spm,[status(thm)],[c_0_167,c_0_168]) ).
cnf(c_0_174,negated_conjecture,
esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171])]) ).
cnf(c_0_175,plain,
esk7_1(esk16_1(esk18_0)) = tptp4,
inference(spm,[status(thm)],[c_0_167,c_0_172]) ).
cnf(c_0_176,plain,
tptp3 != tptp4,
i_0_77 ).
cnf(c_0_177,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_174]),c_0_175]),c_0_176]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PRO018+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jun 13 03:24:25 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 8.48/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.48/2.36 # No SInE strategy applied
% 8.48/2.36 # Trying AutoSched0 for 150 seconds
% 8.48/2.36 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.48/2.36 # and selection function SelectNewComplexAHPNS.
% 8.48/2.36 #
% 8.48/2.36 # Preprocessing time : 0.013 s
% 8.48/2.36
% 8.48/2.36 # Proof found!
% 8.48/2.36 # SZS status Theorem
% 8.48/2.36 # SZS output start CNFRefutation
% See solution above
% 8.48/2.36 # Training examples: 0 positive, 0 negative
% 8.48/2.36
% 8.48/2.36 # -------------------------------------------------
% 8.48/2.36 # User time : 0.134 s
% 8.48/2.36 # System time : 0.012 s
% 8.48/2.36 # Total time : 0.146 s
% 8.48/2.36 # Maximum resident set size: 7124 pages
% 8.48/2.36
%------------------------------------------------------------------------------