%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:41 EDT 2022
% Result : Theorem 7.30s 2.07s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 11 unt; 6 nHn; 25 RR)
% Number of literals : 57 ( 7 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 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-1eu2nxv5/input.p',i_0_83) ).
cnf(i_0_111,negated_conjecture,
occurrence_of(esk20_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_111) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_5) ).
cnf(i_0_66,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_66) ).
cnf(i_0_108,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-1eu2nxv5/input.p',i_0_108) ).
cnf(i_0_34,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_34) ).
cnf(i_0_64,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_64) ).
cnf(i_0_104,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-1eu2nxv5/input.p',i_0_104) ).
cnf(i_0_101,plain,
tptp2 != tptp1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1eu2nxv5/input.p',i_0_101) ).
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_111 ).
cnf(c_0_123,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_5 ).
cnf(c_0_124,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
i_0_66 ).
cnf(c_0_125,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_126,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk22_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
i_0_108 ).
cnf(c_0_127,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_122]) ).
cnf(c_0_128,negated_conjecture,
occurrence_of(esk20_0,esk15_2(esk19_1(esk20_0),esk20_0)),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
i_0_34 ).
cnf(c_0_130,negated_conjecture,
( min_precedes(X1,esk22_2(X1,esk19_1(esk20_0)),tptp0)
| occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(spm,[status(thm)],[c_0_126,c_0_125]) ).
cnf(c_0_131,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
i_0_64 ).
cnf(c_0_132,negated_conjecture,
esk15_2(esk19_1(esk20_0),esk20_0) = tptp0,
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_133,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk20_0) ),
i_0_104 ).
cnf(c_0_134,plain,
( occurrence_of(esk19_1(esk20_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_135,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_125]),c_0_132]) ).
cnf(c_0_136,negated_conjecture,
( min_precedes(X1,esk21_2(X1,esk19_1(esk20_0)),tptp0)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(spm,[status(thm)],[c_0_133,c_0_125]) ).
cnf(c_0_137,negated_conjecture,
occurrence_of(esk19_1(esk20_0),tptp1),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_138,plain,
( occurrence_of(esk19_1(esk20_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_129,c_0_136]) ).
cnf(c_0_139,plain,
( X1 = tptp1
| ~ occurrence_of(esk19_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_137]) ).
cnf(c_0_140,negated_conjecture,
occurrence_of(esk19_1(esk20_0),tptp2),
inference(spm,[status(thm)],[c_0_138,c_0_135]) ).
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.07/0.09 % Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 600
% 0.09/0.27 % DateTime : Mon Jun 13 02:54:28 EDT 2022
% 0.09/0.27 % CPUTime :
% 0.12/0.35 # ENIGMATIC: Selected complete mode:
% 7.30/2.07 # ENIGMATIC: Solved by autoschedule:
% 7.30/2.07 # No SInE strategy applied
% 7.30/2.07 # Trying AutoSched0 for 150 seconds
% 7.30/2.07 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.30/2.07 # and selection function SelectCQArNTNpEqFirst.
% 7.30/2.07 #
% 7.30/2.07 # Preprocessing time : 0.013 s
% 7.30/2.07 # Presaturation interreduction done
% 7.30/2.07
% 7.30/2.07 # Proof found!
% 7.30/2.07 # SZS status Theorem
% 7.30/2.07 # SZS output start CNFRefutation
% See solution above
% 7.30/2.07 # Training examples: 0 positive, 0 negative
% 7.30/2.07
% 7.30/2.07 # -------------------------------------------------
% 7.30/2.07 # User time : 0.037 s
% 7.30/2.07 # System time : 0.002 s
% 7.30/2.07 # Total time : 0.039 s
% 7.30/2.07 # Maximum resident set size: 7116 pages
% 7.30/2.07
%------------------------------------------------------------------------------