%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO011+3 : 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:42 EDT 2022
% Result : Theorem 7.30s 2.36s
% Output : CNFRefutation 7.30s
% 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_69,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_69) ).
cnf(i_0_105,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_105) ).
cnf(i_0_83,plain,
( leaf_occ(esk19_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_83) ).
cnf(i_0_118,negated_conjecture,
occurrence_of(esk20_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_118) ).
cnf(i_0_114,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk22_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_114) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_5) ).
cnf(i_0_101,plain,
tptp2 != tptp1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ircuuvno/lgb.p',i_0_101) ).
cnf(c_0_126,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_69 ).
cnf(c_0_127,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
i_0_105 ).
cnf(c_0_128,negated_conjecture,
( occurrence_of(X1,tptp2)
| ~ leaf_occ(X1,esk20_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_129,plain,
( leaf_occ(esk19_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_83 ).
cnf(c_0_130,negated_conjecture,
occurrence_of(esk20_0,tptp0),
i_0_118 ).
cnf(c_0_131,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk22_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
i_0_114 ).
cnf(c_0_132,plain,
( occurrence_of(esk19_1(esk20_0),tptp2)
| ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]) ).
cnf(c_0_133,negated_conjecture,
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,esk20_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(spm,[status(thm)],[c_0_126,c_0_131]) ).
cnf(c_0_134,plain,
( occurrence_of(esk19_1(esk20_0),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_132,c_0_129]) ).
cnf(c_0_135,plain,
( occurrence_of(esk19_1(esk20_0),tptp1)
| ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_129]),c_0_130])]) ).
cnf(c_0_136,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_5 ).
cnf(c_0_137,negated_conjecture,
occurrence_of(esk19_1(esk20_0),tptp2),
inference(spm,[status(thm)],[c_0_134,c_0_130]) ).
cnf(c_0_138,plain,
( occurrence_of(esk19_1(esk20_0),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_135,c_0_129]) ).
cnf(c_0_139,plain,
( X1 = tptp2
| ~ occurrence_of(esk19_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_140,negated_conjecture,
occurrence_of(esk19_1(esk20_0),tptp1),
inference(spm,[status(thm)],[c_0_138,c_0_130]) ).
cnf(c_0_141,plain,
tptp2 != tptp1,
i_0_101 ).
cnf(c_0_142,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO011+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 02:10:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.30/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.30/2.36 # No SInE strategy applied
% 7.30/2.36 # Trying AutoSched0 for 150 seconds
% 7.30/2.36 # AutoSched0-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.30/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.30/2.36 #
% 7.30/2.36 # Preprocessing time : 0.018 s
% 7.30/2.36 # Presaturation interreduction done
% 7.30/2.36
% 7.30/2.36 # Proof found!
% 7.30/2.36 # SZS status Theorem
% 7.30/2.36 # SZS output start CNFRefutation
% See solution above
% 7.30/2.36 # Training examples: 0 positive, 0 negative
% 7.30/2.36
% 7.30/2.36 # -------------------------------------------------
% 7.30/2.36 # User time : 0.025 s
% 7.30/2.36 # System time : 0.005 s
% 7.30/2.36 # Total time : 0.030 s
% 7.30/2.36 # Maximum resident set size: 7124 pages
% 7.30/2.36
%------------------------------------------------------------------------------