%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO009+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:40 EDT 2022
% Result : Theorem 7.44s 2.37s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 17 unt; 12 nHn; 54 RR)
% Number of literals : 128 ( 13 equ; 71 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_83,plain,
( leaf_occ(esk19_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_83) ).
cnf(i_0_104,negated_conjecture,
occurrence_of(esk20_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_104) ).
cnf(i_0_73,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| ~ occurrence_of(X4,X3)
| ~ root_occ(X2,X4)
| ~ leaf_occ(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_73) ).
cnf(i_0_67,plain,
( X1 = X2
| ~ occurrence_of(X3,X4)
| ~ root_occ(X2,X3)
| ~ root_occ(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_67) ).
cnf(i_0_88,plain,
( root_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_88) ).
cnf(i_0_59,plain,
( root_occ(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_59) ).
cnf(i_0_52,plain,
( atomic(X1)
| root(esk12_2(X1,X2),X1)
| ~ occurrence_of(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_52) ).
cnf(i_0_91,plain,
~ atomic(tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_91) ).
cnf(i_0_51,plain,
( atomic(X1)
| subactivity_occurrence(esk12_2(X1,X2),X2)
| ~ occurrence_of(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_51) ).
cnf(i_0_89,plain,
( occurrence_of(esk17_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_89) ).
cnf(i_0_84,plain,
( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_84) ).
cnf(i_0_102,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk20_0)
| ~ leaf_occ(X2,esk20_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_102) ).
cnf(i_0_85,plain,
( occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_85) ).
cnf(i_0_103,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk20_0)
| ~ leaf_occ(X2,esk20_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_103) ).
cnf(i_0_39,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_39) ).
cnf(i_0_25,plain,
( ~ root(X1,X2)
| ~ min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-45tnzrde/input.p',i_0_25) ).
cnf(c_0_121,plain,
( leaf_occ(esk19_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_83 ).
cnf(c_0_122,negated_conjecture,
occurrence_of(esk20_0,tptp0),
i_0_104 ).
cnf(c_0_123,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| ~ occurrence_of(X4,X3)
| ~ root_occ(X2,X4)
| ~ leaf_occ(X1,X4) ),
i_0_73 ).
cnf(c_0_124,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,plain,
( X1 = X2
| ~ occurrence_of(X3,X4)
| ~ root_occ(X2,X3)
| ~ root_occ(X1,X3) ),
i_0_67 ).
cnf(c_0_126,plain,
( root_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_88 ).
cnf(c_0_127,plain,
( root_occ(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2) ),
i_0_59 ).
cnf(c_0_128,plain,
( atomic(X1)
| root(esk12_2(X1,X2),X1)
| ~ occurrence_of(X2,X1) ),
i_0_52 ).
cnf(c_0_129,plain,
~ atomic(tptp0),
i_0_91 ).
cnf(c_0_130,plain,
( atomic(X1)
| subactivity_occurrence(esk12_2(X1,X2),X2)
| ~ occurrence_of(X2,X1) ),
i_0_51 ).
cnf(c_0_131,negated_conjecture,
( esk19_1(esk20_0) = X1
| min_precedes(X1,esk19_1(esk20_0),X2)
| ~ root_occ(X1,esk20_0)
| ~ occurrence_of(esk20_0,X2) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_132,negated_conjecture,
( X1 = X2
| ~ root_occ(X2,esk20_0)
| ~ root_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_125,c_0_122]) ).
cnf(c_0_133,negated_conjecture,
root_occ(esk17_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_126,c_0_122]) ).
cnf(c_0_134,negated_conjecture,
( root_occ(X1,esk20_0)
| ~ root(X1,tptp0)
| ~ subactivity_occurrence(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_127,c_0_122]) ).
cnf(c_0_135,negated_conjecture,
root(esk12_2(tptp0,esk20_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_122]),c_0_129]) ).
cnf(c_0_136,negated_conjecture,
subactivity_occurrence(esk12_2(tptp0,esk20_0),esk20_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_122]),c_0_129]) ).
cnf(c_0_137,negated_conjecture,
( esk19_1(esk20_0) = X1
| min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ root_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_131,c_0_122]) ).
cnf(c_0_138,plain,
( occurrence_of(esk17_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
i_0_89 ).
cnf(c_0_139,plain,
( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_84 ).
cnf(c_0_140,negated_conjecture,
( X1 = esk17_1(esk20_0)
| ~ root_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_141,negated_conjecture,
root_occ(esk12_2(tptp0,esk20_0),esk20_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136])]) ).
cnf(c_0_142,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk20_0)
| ~ leaf_occ(X2,esk20_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_102 ).
cnf(c_0_143,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0) ),
inference(spm,[status(thm)],[c_0_137,c_0_133]) ).
cnf(c_0_144,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(spm,[status(thm)],[c_0_138,c_0_122]) ).
cnf(c_0_145,plain,
( occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
i_0_85 ).
cnf(c_0_146,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk20_0)
| ~ leaf_occ(X2,esk20_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_103 ).
cnf(c_0_147,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_39 ).
cnf(c_0_148,negated_conjecture,
next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_139,c_0_122]) ).
cnf(c_0_149,negated_conjecture,
esk12_2(tptp0,esk20_0) = esk17_1(esk20_0),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_150,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| ~ occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_124]),c_0_133]),c_0_144])]) ).
cnf(c_0_151,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp1)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(spm,[status(thm)],[c_0_145,c_0_122]) ).
cnf(c_0_152,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| ~ occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_143]),c_0_124]),c_0_133]),c_0_144])]) ).
cnf(c_0_153,plain,
( ~ root(X1,X2)
| ~ min_precedes(X3,X1,X2) ),
i_0_25 ).
cnf(c_0_154,plain,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_147,c_0_148]) ).
cnf(c_0_155,negated_conjecture,
root(esk17_1(esk20_0),tptp0),
inference(rw,[status(thm)],[c_0_135,c_0_149]) ).
cnf(c_0_156,negated_conjecture,
esk17_1(esk20_0) = esk19_1(esk20_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_152]) ).
cnf(c_0_157,plain,
~ root(esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_158,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_156]),c_0_157]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO009+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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:41:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.44/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.44/2.37 # No SInE strategy applied
% 7.44/2.37 # Trying AutoSched0 for 150 seconds
% 7.44/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.44/2.37 # and selection function SelectCQArNTNpEqFirst.
% 7.44/2.37 #
% 7.44/2.37 # Preprocessing time : 0.013 s
% 7.44/2.37 # Presaturation interreduction done
% 7.44/2.37
% 7.44/2.37 # Proof found!
% 7.44/2.37 # SZS status Theorem
% 7.44/2.37 # SZS output start CNFRefutation
% See solution above
% 7.44/2.37 # Training examples: 0 positive, 0 negative
% 7.44/2.37
% 7.44/2.37 # -------------------------------------------------
% 7.44/2.37 # User time : 0.047 s
% 7.44/2.37 # System time : 0.007 s
% 7.44/2.37 # Total time : 0.054 s
% 7.44/2.37 # Maximum resident set size: 7120 pages
% 7.44/2.37
%------------------------------------------------------------------------------