%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO010+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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.77s 2.35s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 7 unt; 4 nHn; 20 RR)
% Number of literals : 55 ( 5 equ; 31 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_43) ).
cnf(i_0_85,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk19_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk18_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_85) ).
cnf(i_0_64,plain,
( leaf_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_64) ).
cnf(i_0_92,negated_conjecture,
occurrence_of(esk18_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_92) ).
cnf(i_0_89,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk18_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_89) ).
cnf(i_0_44,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_44) ).
cnf(i_0_82,plain,
tptp2 != tptp1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qulm_tr6/lgb.p',i_0_82) ).
cnf(c_0_100,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_43 ).
cnf(c_0_101,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk19_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk18_0) ),
i_0_85 ).
cnf(c_0_102,negated_conjecture,
( occurrence_of(X1,tptp2)
| ~ leaf_occ(X1,esk18_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_103,plain,
( leaf_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_64 ).
cnf(c_0_104,negated_conjecture,
occurrence_of(esk18_0,tptp0),
i_0_92 ).
cnf(c_0_105,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk18_0) ),
i_0_89 ).
cnf(c_0_106,plain,
( occurrence_of(esk17_1(esk18_0),tptp2)
| ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104])]) ).
cnf(c_0_107,negated_conjecture,
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,esk18_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(spm,[status(thm)],[c_0_100,c_0_105]) ).
cnf(c_0_108,plain,
( occurrence_of(esk17_1(esk18_0),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_106,c_0_103]) ).
cnf(c_0_109,plain,
( occurrence_of(esk17_1(esk18_0),tptp1)
| ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_103]),c_0_104])]) ).
cnf(c_0_110,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_44 ).
cnf(c_0_111,negated_conjecture,
occurrence_of(esk17_1(esk18_0),tptp2),
inference(spm,[status(thm)],[c_0_108,c_0_104]) ).
cnf(c_0_112,plain,
( occurrence_of(esk17_1(esk18_0),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_109,c_0_103]) ).
cnf(c_0_113,plain,
( X1 = tptp2
| ~ occurrence_of(esk17_1(esk18_0),X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,negated_conjecture,
occurrence_of(esk17_1(esk18_0),tptp1),
inference(spm,[status(thm)],[c_0_112,c_0_104]) ).
cnf(c_0_115,plain,
tptp2 != tptp1,
i_0_82 ).
cnf(c_0_116,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : PRO010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 01:50:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.77/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.77/2.35 # No SInE strategy applied
% 7.77/2.35 # Trying AutoSched0 for 150 seconds
% 7.77/2.35 # AutoSched0-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.77/2.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.77/2.35 #
% 7.77/2.35 # Preprocessing time : 0.024 s
% 7.77/2.35 # Presaturation interreduction done
% 7.77/2.35
% 7.77/2.35 # Proof found!
% 7.77/2.35 # SZS status Theorem
% 7.77/2.35 # SZS output start CNFRefutation
% See solution above
% 7.77/2.35 # Training examples: 0 positive, 0 negative
% 7.77/2.35
% 7.77/2.35 # -------------------------------------------------
% 7.77/2.35 # User time : 0.027 s
% 7.77/2.35 # System time : 0.011 s
% 7.77/2.35 # Total time : 0.038 s
% 7.77/2.35 # Maximum resident set size: 7124 pages
% 7.77/2.35
%------------------------------------------------------------------------------