%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:39 EDT 2022
% Result : Theorem 7.92s 2.32s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 13 unt; 3 nHn; 35 RR)
% Number of literals : 73 ( 0 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_65,plain,
( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_65) ).
cnf(i_0_85,negated_conjecture,
occurrence_of(esk18_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_85) ).
cnf(i_0_8,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_8) ).
cnf(i_0_67,plain,
( next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_67) ).
cnf(i_0_1,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_1) ).
cnf(i_0_64,plain,
( leaf_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_64) ).
cnf(i_0_69,plain,
( root_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_69) ).
cnf(i_0_70,plain,
( occurrence_of(esk15_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_70) ).
cnf(i_0_66,plain,
( occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_66) ).
cnf(i_0_84,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk18_0)
| ~ leaf_occ(X2,esk18_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_84) ).
cnf(i_0_83,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk18_0)
| ~ leaf_occ(X2,esk18_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ympibp33/lgb.p',i_0_83) ).
cnf(c_0_97,plain,
( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_65 ).
cnf(c_0_98,negated_conjecture,
occurrence_of(esk18_0,tptp0),
i_0_85 ).
cnf(c_0_99,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_8 ).
cnf(c_0_100,negated_conjecture,
next_subocc(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_67 ).
cnf(c_0_102,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
i_0_1 ).
cnf(c_0_103,plain,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_101,c_0_98]) ).
cnf(c_0_105,plain,
( min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ min_precedes(X1,esk16_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_99,c_0_104]) ).
cnf(c_0_107,plain,
( leaf_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_64 ).
cnf(c_0_108,plain,
( root_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_69 ).
cnf(c_0_109,plain,
( occurrence_of(esk15_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
i_0_70 ).
cnf(c_0_110,plain,
( occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
i_0_66 ).
cnf(c_0_111,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk18_0)
| ~ leaf_occ(X2,esk18_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_84 ).
cnf(c_0_112,plain,
min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_113,negated_conjecture,
leaf_occ(esk17_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_107,c_0_98]) ).
cnf(c_0_114,negated_conjecture,
root_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_108,c_0_98]) ).
cnf(c_0_115,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(spm,[status(thm)],[c_0_109,c_0_98]) ).
cnf(c_0_116,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk18_0)
| ~ leaf_occ(X2,esk18_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_83 ).
cnf(c_0_117,negated_conjecture,
( occurrence_of(esk17_1(esk18_0),tptp1)
| occurrence_of(esk17_1(esk18_0),tptp2) ),
inference(spm,[status(thm)],[c_0_110,c_0_98]) ).
cnf(c_0_118,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_111,c_0_112]),c_0_113]),c_0_114]),c_0_115])]) ).
cnf(c_0_119,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_116,c_0_112]),c_0_113]),c_0_114]),c_0_115])]) ).
cnf(c_0_120,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_117,c_0_118]),c_0_119]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 03:41:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.92/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.32 # No SInE strategy applied
% 7.92/2.32 # Trying AutoSched0 for 150 seconds
% 7.92/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.92/2.32 # and selection function SelectCQArNTNpEqFirst.
% 7.92/2.32 #
% 7.92/2.32 # Preprocessing time : 0.024 s
% 7.92/2.32 # Presaturation interreduction done
% 7.92/2.32
% 7.92/2.32 # Proof found!
% 7.92/2.32 # SZS status Theorem
% 7.92/2.32 # SZS output start CNFRefutation
% See solution above
% 7.92/2.32 # Training examples: 0 positive, 0 negative
% 7.92/2.32
% 7.92/2.32 # -------------------------------------------------
% 7.92/2.32 # User time : 0.040 s
% 7.92/2.32 # System time : 0.007 s
% 7.92/2.32 # Total time : 0.047 s
% 7.92/2.32 # Maximum resident set size: 7124 pages
% 7.92/2.32
%------------------------------------------------------------------------------