%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO018+4 : 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 7.81s 2.41s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 75 ( 31 unt; 22 nHn; 75 RR)
% Number of literals : 186 ( 19 equ; 98 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 : 91 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_66) ).
cnf(i_0_101,negated_conjecture,
occurrence_of(esk17_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_101) ).
cnf(i_0_100,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_100) ).
cnf(i_0_99,negated_conjecture,
arboreal(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_99) ).
cnf(i_0_98,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_98) ).
cnf(i_0_64,plain,
( leaf_occ(X1,X2)
| min_precedes(esk13_1(X1),esk14_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_64) ).
cnf(i_0_55,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_55) ).
cnf(i_0_67,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_67) ).
cnf(i_0_12,plain,
( occurrence_of(esk3_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_12) ).
cnf(i_0_16,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_16) ).
cnf(i_0_10,plain,
( subactivity_occurrence(X1,esk3_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_10) ).
cnf(i_0_31,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_31) ).
cnf(i_0_73,plain,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_73) ).
cnf(i_0_61,plain,
( X1 = esk14_1(X2)
| X1 = esk15_1(X2)
| leaf_occ(X2,X3)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk13_1(X2),X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_61) ).
cnf(i_0_65,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk14_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_65) ).
cnf(i_0_54,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X1,X3)
| ~ next_subocc(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_54) ).
cnf(i_0_62,plain,
( leaf_occ(X1,X2)
| min_precedes(esk14_1(X1),esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_62) ).
cnf(i_0_15,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_15) ).
cnf(i_0_20,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_20) ).
cnf(i_0_5,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_5) ).
cnf(i_0_74,plain,
tptp3 != tptp4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-va5ojcbx/lgb.p',i_0_74) ).
cnf(c_0_123,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_66 ).
cnf(c_0_124,negated_conjecture,
occurrence_of(esk17_0,tptp0),
i_0_101 ).
cnf(c_0_125,negated_conjecture,
( next_subocc(X1,esk13_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_126,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
i_0_100 ).
cnf(c_0_127,negated_conjecture,
arboreal(esk16_0),
i_0_99 ).
cnf(c_0_128,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
i_0_98 ).
cnf(c_0_129,plain,
( leaf_occ(X1,X2)
| min_precedes(esk13_1(X1),esk14_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_64 ).
cnf(c_0_130,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_55 ).
cnf(c_0_131,negated_conjecture,
next_subocc(esk16_0,esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_132,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_67 ).
cnf(c_0_133,negated_conjecture,
( min_precedes(esk13_1(X1),esk14_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_124]) ).
cnf(c_0_134,plain,
( occurrence_of(esk3_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
i_0_12 ).
cnf(c_0_135,plain,
min_precedes(esk16_0,esk13_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_136,negated_conjecture,
( occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,esk17_0)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_132,c_0_124]) ).
cnf(c_0_137,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_16 ).
cnf(c_0_138,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_139,plain,
occurrence_of(esk3_3(tptp0,esk16_0,esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_140,plain,
( subactivity_occurrence(X1,esk3_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
i_0_10 ).
cnf(c_0_141,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_31 ).
cnf(c_0_142,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_143,plain,
atomic(tptp3),
i_0_73 ).
cnf(c_0_144,plain,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk13_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_137,c_0_138]) ).
cnf(c_0_145,plain,
( next_subocc(X1,esk13_1(X1),tptp0)
| leaf_occ(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ subactivity_occurrence(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_139]) ).
cnf(c_0_146,plain,
subactivity_occurrence(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_140,c_0_135]) ).
cnf(c_0_147,plain,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143])]) ).
cnf(c_0_148,plain,
~ leaf_occ(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_144,c_0_139]) ).
cnf(c_0_149,plain,
( X1 = esk14_1(X2)
| X1 = esk15_1(X2)
| leaf_occ(X2,X3)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk13_1(X2),X1,tptp0) ),
i_0_61 ).
cnf(c_0_150,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk14_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_65 ).
cnf(c_0_151,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X1,X3)
| ~ next_subocc(X4,X2,X3) ),
i_0_54 ).
cnf(c_0_152,plain,
next_subocc(esk13_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147])]),c_0_148]) ).
cnf(c_0_153,negated_conjecture,
( X1 = esk14_1(X2)
| X1 = esk15_1(X2)
| leaf_occ(X2,esk17_0)
| ~ subactivity_occurrence(X2,esk17_0)
| ~ arboreal(X2)
| ~ min_precedes(esk13_1(X2),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_149,c_0_124]) ).
cnf(c_0_154,plain,
( leaf_occ(X1,X2)
| min_precedes(esk14_1(X1),esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_62 ).
cnf(c_0_155,negated_conjecture,
( occurrence_of(esk14_1(X1),tptp4)
| leaf_occ(X1,esk17_0)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_150,c_0_124]) ).
cnf(c_0_156,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_15 ).
cnf(c_0_157,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
i_0_20 ).
cnf(c_0_158,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
i_0_5 ).
cnf(c_0_159,plain,
( occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ subactivity_occurrence(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_132,c_0_139]) ).
cnf(c_0_160,plain,
( ~ min_precedes(X1,esk13_1(esk13_1(esk16_0)),tptp0)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_161,negated_conjecture,
( X1 = esk15_1(esk16_0)
| X1 = esk14_1(esk16_0)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_162,plain,
min_precedes(esk13_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_130,c_0_152]) ).
cnf(c_0_163,negated_conjecture,
( min_precedes(esk14_1(X1),esk15_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_154,c_0_124]) ).
cnf(c_0_164,negated_conjecture,
occurrence_of(esk14_1(esk16_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_165,plain,
( X1 = esk5_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158]) ).
cnf(c_0_166,plain,
occurrence_of(esk13_1(esk13_1(esk16_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_146]),c_0_147])]),c_0_148]) ).
cnf(c_0_167,negated_conjecture,
~ min_precedes(esk14_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_160,c_0_138]) ).
cnf(c_0_168,negated_conjecture,
( esk13_1(esk13_1(esk16_0)) = esk14_1(esk16_0)
| esk13_1(esk13_1(esk16_0)) = esk15_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_161,c_0_162]) ).
cnf(c_0_169,negated_conjecture,
min_precedes(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_170,plain,
( X1 = tptp4
| ~ occurrence_of(esk14_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_156,c_0_164]) ).
cnf(c_0_171,plain,
activity_occurrence(esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_158,c_0_164]) ).
cnf(c_0_172,plain,
esk5_1(esk13_1(esk13_1(esk16_0))) = tptp3,
inference(spm,[status(thm)],[c_0_165,c_0_166]) ).
cnf(c_0_173,negated_conjecture,
esk13_1(esk13_1(esk16_0)) = esk14_1(esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169])]) ).
cnf(c_0_174,plain,
esk5_1(esk14_1(esk16_0)) = tptp4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_157]),c_0_171])]) ).
cnf(c_0_175,plain,
tptp3 != tptp4,
i_0_74 ).
cnf(c_0_176,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_173]),c_0_174]),c_0_175]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PRO018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 00:53:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 7.81/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.41 # No SInE strategy applied
% 7.81/2.41 # Trying AutoSched0 for 150 seconds
% 7.81/2.41 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.81/2.41 # and selection function SelectNewComplexAHPNS.
% 7.81/2.41 #
% 7.81/2.41 # Preprocessing time : 0.013 s
% 7.81/2.41
% 7.81/2.41 # Proof found!
% 7.81/2.41 # SZS status Theorem
% 7.81/2.41 # SZS output start CNFRefutation
% See solution above
% 7.81/2.41 # Training examples: 0 positive, 0 negative
% 7.81/2.41
% 7.81/2.41 # -------------------------------------------------
% 7.81/2.41 # User time : 0.044 s
% 7.81/2.41 # System time : 0.006 s
% 7.81/2.41 # Total time : 0.050 s
% 7.81/2.41 # Maximum resident set size: 7128 pages
% 7.81/2.41
%------------------------------------------------------------------------------