TSTP Solution File: PRO017+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO017+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:47 EDT 2022
% Result : Theorem 7.48s 2.26s
% Output : CNFRefutation 7.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_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-m8072g49/input.p',i_0_66) ).
cnf(i_0_85,negated_conjecture,
occurrence_of(esk17_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_85) ).
cnf(i_0_84,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_84) ).
cnf(i_0_83,negated_conjecture,
arboreal(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_83) ).
cnf(i_0_82,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_82) ).
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-m8072g49/input.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-m8072g49/input.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-m8072g49/input.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-m8072g49/input.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-m8072g49/input.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-m8072g49/input.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-m8072g49/input.p',i_0_31) ).
cnf(i_0_73,plain,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.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-m8072g49/input.p',i_0_61) ).
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-m8072g49/input.p',i_0_62) ).
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-m8072g49/input.p',i_0_54) ).
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-m8072g49/input.p',i_0_65) ).
cnf(i_0_15,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.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-m8072g49/input.p',i_0_20) ).
cnf(i_0_5,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_5) ).
cnf(i_0_74,plain,
tptp3 != tptp4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m8072g49/input.p',i_0_74) ).
cnf(c_0_107,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_108,negated_conjecture,
occurrence_of(esk17_0,tptp0),
i_0_85 ).
cnf(c_0_109,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_107,c_0_108]) ).
cnf(c_0_110,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
i_0_84 ).
cnf(c_0_111,negated_conjecture,
arboreal(esk16_0),
i_0_83 ).
cnf(c_0_112,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
i_0_82 ).
cnf(c_0_113,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_114,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_55 ).
cnf(c_0_115,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_109,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_116,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_117,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_113,c_0_108]) ).
cnf(c_0_118,plain,
( occurrence_of(esk3_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
i_0_12 ).
cnf(c_0_119,plain,
min_precedes(esk16_0,esk13_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_120,negated_conjecture,
( leaf_occ(X1,esk17_0)
| occurrence_of(esk13_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_108]) ).
cnf(c_0_121,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_16 ).
cnf(c_0_122,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_117,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_123,plain,
occurrence_of(esk3_3(tptp0,esk16_0,esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_124,plain,
( subactivity_occurrence(X1,esk3_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
i_0_10 ).
cnf(c_0_125,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_31 ).
cnf(c_0_126,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_120,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_127,plain,
atomic(tptp3),
i_0_73 ).
cnf(c_0_128,plain,
( ~ leaf_occ(esk13_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_129,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_130,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_107,c_0_123]) ).
cnf(c_0_131,plain,
subactivity_occurrence(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_124,c_0_119]) ).
cnf(c_0_132,plain,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127])]) ).
cnf(c_0_133,plain,
~ leaf_occ(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_128,c_0_123]) ).
cnf(c_0_134,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_135,negated_conjecture,
( X1 = esk14_1(X2)
| X1 = esk15_1(X2)
| leaf_occ(X2,esk17_0)
| ~ min_precedes(esk13_1(X2),X1,tptp0)
| ~ subactivity_occurrence(X2,esk17_0)
| ~ arboreal(X2) ),
inference(spm,[status(thm)],[c_0_129,c_0_108]) ).
cnf(c_0_136,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_130,c_0_131]),c_0_132])]),c_0_133]) ).
cnf(c_0_137,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X1,X3)
| ~ next_subocc(X4,X2,X3) ),
i_0_54 ).
cnf(c_0_138,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_134,c_0_108]) ).
cnf(c_0_139,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_140,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_15 ).
cnf(c_0_141,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
i_0_20 ).
cnf(c_0_142,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
i_0_5 ).
cnf(c_0_143,plain,
( leaf_occ(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| occurrence_of(esk13_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_123]) ).
cnf(c_0_144,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_135,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_145,plain,
min_precedes(esk13_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_114,c_0_136]) ).
cnf(c_0_146,plain,
( ~ min_precedes(esk14_1(esk16_0),X1,tptp0)
| ~ next_subocc(esk13_1(esk16_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_137,c_0_122]) ).
cnf(c_0_147,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_138,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_148,negated_conjecture,
( leaf_occ(X1,esk17_0)
| occurrence_of(esk14_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_139,c_0_108]) ).
cnf(c_0_149,plain,
( X1 = esk5_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142]) ).
cnf(c_0_150,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_143,c_0_131]),c_0_132])]),c_0_133]) ).
cnf(c_0_151,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_144,c_0_145]) ).
cnf(c_0_152,plain,
~ next_subocc(esk13_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_153,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_148,c_0_110]),c_0_111])]),c_0_112]) ).
cnf(c_0_154,plain,
esk5_1(esk13_1(esk13_1(esk16_0))) = tptp3,
inference(spm,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_155,plain,
esk13_1(esk13_1(esk16_0)) = esk14_1(esk16_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_151]),c_0_152]) ).
cnf(c_0_156,plain,
esk5_1(esk14_1(esk16_0)) = tptp4,
inference(spm,[status(thm)],[c_0_149,c_0_153]) ).
cnf(c_0_157,plain,
tptp3 != tptp4,
i_0_74 ).
cnf(c_0_158,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_155]),c_0_156]),c_0_157]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : PRO017+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 13 02:49:28 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.38 # ENIGMATIC: Selected complete mode:
% 7.48/2.26 # ENIGMATIC: Solved by autoschedule:
% 7.48/2.26 # No SInE strategy applied
% 7.48/2.26 # Trying AutoSched0 for 150 seconds
% 7.48/2.26 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.48/2.26 # and selection function SelectNewComplexAHPNS.
% 7.48/2.26 #
% 7.48/2.26 # Preprocessing time : 0.015 s
% 7.48/2.26
% 7.48/2.26 # Proof found!
% 7.48/2.26 # SZS status Theorem
% 7.48/2.26 # SZS output start CNFRefutation
% See solution above
% 7.48/2.26 # Training examples: 0 positive, 0 negative
% 7.48/2.26
% 7.48/2.26 # -------------------------------------------------
% 7.48/2.26 # User time : 0.044 s
% 7.48/2.26 # System time : 0.005 s
% 7.48/2.26 # Total time : 0.049 s
% 7.48/2.26 # Maximum resident set size: 7120 pages
% 7.48/2.26
%------------------------------------------------------------------------------