TSTP Solution File: PRO014+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO014+2 : 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:44 EDT 2022
% Result : Theorem 7.47s 2.34s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 19 unt; 18 nHn; 46 RR)
% Number of literals : 138 ( 0 equ; 79 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_65,plain,
( leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_65) ).
cnf(i_0_88,negated_conjecture,
occurrence_of(esk19_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_88) ).
cnf(i_0_87,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_87) ).
cnf(i_0_86,negated_conjecture,
arboreal(esk18_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_86) ).
cnf(i_0_85,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_85) ).
cnf(i_0_67,plain,
( leaf_occ(X1,X2)
| next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_67) ).
cnf(i_0_8,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_8) ).
cnf(i_0_1,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_1) ).
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/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_69) ).
cnf(i_0_64,plain,
( leaf_occ(X1,X2)
| leaf(esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_64) ).
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/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_70) ).
cnf(i_0_66,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_66) ).
cnf(i_0_83,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk18_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_83) ).
cnf(i_0_84,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk18_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kbndi18w/input.p',i_0_84) ).
cnf(c_0_103,plain,
( leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_65 ).
cnf(c_0_104,negated_conjecture,
occurrence_of(esk19_0,tptp0),
i_0_88 ).
cnf(c_0_105,negated_conjecture,
( next_subocc(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_103,c_0_104]) ).
cnf(c_0_106,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
i_0_87 ).
cnf(c_0_107,negated_conjecture,
arboreal(esk18_0),
i_0_86 ).
cnf(c_0_108,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
i_0_85 ).
cnf(c_0_109,plain,
( leaf_occ(X1,X2)
| next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_67 ).
cnf(c_0_110,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_8 ).
cnf(c_0_111,negated_conjecture,
next_subocc(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_105,c_0_106]),c_0_107])]),c_0_108]) ).
cnf(c_0_112,negated_conjecture,
( next_subocc(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_109,c_0_104]) ).
cnf(c_0_113,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
i_0_1 ).
cnf(c_0_114,plain,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_115,negated_conjecture,
next_subocc(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_112,c_0_106]),c_0_107])]),c_0_108]) ).
cnf(c_0_116,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_117,plain,
( leaf_occ(X1,X2)
| leaf(esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_64 ).
cnf(c_0_118,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_119,plain,
( min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ min_precedes(X1,esk16_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_120,plain,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_110,c_0_115]) ).
cnf(c_0_121,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_116,c_0_104]) ).
cnf(c_0_122,negated_conjecture,
( leaf(esk17_1(X1),tptp0)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_117,c_0_104]) ).
cnf(c_0_123,negated_conjecture,
( leaf_occ(X1,esk19_0)
| occurrence_of(esk15_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_104]) ).
cnf(c_0_124,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_66 ).
cnf(c_0_125,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk18_0,X1,tptp0) ),
i_0_83 ).
cnf(c_0_126,plain,
min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_127,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_121,c_0_106]),c_0_107])]),c_0_108]) ).
cnf(c_0_128,negated_conjecture,
leaf(esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_106]),c_0_107])]),c_0_108]) ).
cnf(c_0_129,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_123,c_0_106]),c_0_107])]),c_0_108]) ).
cnf(c_0_130,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk18_0,X1,tptp0) ),
i_0_84 ).
cnf(c_0_131,negated_conjecture,
( leaf_occ(X1,esk19_0)
| occurrence_of(esk17_1(X1),tptp1)
| occurrence_of(esk17_1(X1),tptp2)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_124,c_0_104]) ).
cnf(c_0_132,negated_conjecture,
~ occurrence_of(esk17_1(esk18_0),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]),c_0_128]),c_0_129])]) ).
cnf(c_0_133,negated_conjecture,
~ occurrence_of(esk17_1(esk18_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_126]),c_0_127]),c_0_128]),c_0_129])]) ).
cnf(c_0_134,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_106]),c_0_107])]),c_0_108]),c_0_132]),c_0_133]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/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 01:09:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.47/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.47/2.34 # No SInE strategy applied
% 7.47/2.34 # Trying AutoSched0 for 150 seconds
% 7.47/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.47/2.34 # and selection function SelectCQArNTNpEqFirst.
% 7.47/2.34 #
% 7.47/2.34 # Preprocessing time : 0.019 s
% 7.47/2.34 # Presaturation interreduction done
% 7.47/2.34
% 7.47/2.34 # Proof found!
% 7.47/2.34 # SZS status Theorem
% 7.47/2.34 # SZS output start CNFRefutation
% See solution above
% 7.47/2.34 # Training examples: 0 positive, 0 negative
% 7.47/2.34
% 7.47/2.34 # -------------------------------------------------
% 7.47/2.34 # User time : 0.055 s
% 7.47/2.34 # System time : 0.008 s
% 7.47/2.34 # Total time : 0.064 s
% 7.47/2.34 # Maximum resident set size: 7124 pages
% 7.47/2.34
%------------------------------------------------------------------------------