%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO010+1 : 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:40 EDT 2022
% Result : Theorem 4.55s 2.49s
% Output : CNFRefutation 4.55s
% 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_67,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_67) ).
cnf(i_0_95,negated_conjecture,
occurrence_of(esk19_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_95) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_5) ).
cnf(i_0_66,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_66) ).
cnf(i_0_92,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_92) ).
cnf(i_0_34,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_34) ).
cnf(i_0_64,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_64) ).
cnf(i_0_88,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_88) ).
cnf(i_0_85,plain,
tptp2 != tptp1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1w5t5v_e/input.p',i_0_85) ).
cnf(c_0_105,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_67 ).
cnf(c_0_106,negated_conjecture,
occurrence_of(esk19_0,tptp0),
i_0_95 ).
cnf(c_0_107,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_5 ).
cnf(c_0_108,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
i_0_66 ).
cnf(c_0_109,negated_conjecture,
leaf_occ(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
i_0_92 ).
cnf(c_0_111,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_106]) ).
cnf(c_0_112,negated_conjecture,
occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
i_0_34 ).
cnf(c_0_114,negated_conjecture,
( min_precedes(X1,esk21_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_110,c_0_109]) ).
cnf(c_0_115,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
i_0_64 ).
cnf(c_0_116,negated_conjecture,
esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_117,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
i_0_88 ).
cnf(c_0_118,plain,
( occurrence_of(esk18_1(esk19_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_119,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_109]),c_0_116]) ).
cnf(c_0_120,negated_conjecture,
( min_precedes(X1,esk20_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_117,c_0_109]) ).
cnf(c_0_121,plain,
occurrence_of(esk18_1(esk19_0),tptp1),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_122,plain,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_113,c_0_120]) ).
cnf(c_0_123,plain,
( X1 = tptp1
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_121]) ).
cnf(c_0_124,plain,
occurrence_of(esk18_1(esk19_0),tptp2),
inference(spm,[status(thm)],[c_0_122,c_0_119]) ).
cnf(c_0_125,plain,
tptp2 != tptp1,
i_0_85 ).
cnf(c_0_126,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO010+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 03:43:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 4.55/2.49 # ENIGMATIC: Solved by autoschedule:
% 4.55/2.49 # No SInE strategy applied
% 4.55/2.49 # Trying AutoSched0 for 150 seconds
% 4.55/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 4.55/2.49 # and selection function SelectCQArNTNpEqFirst.
% 4.55/2.49 #
% 4.55/2.49 # Preprocessing time : 0.014 s
% 4.55/2.49 # Presaturation interreduction done
% 4.55/2.49
% 4.55/2.49 # Proof found!
% 4.55/2.49 # SZS status Theorem
% 4.55/2.49 # SZS output start CNFRefutation
% See solution above
% 4.55/2.49 # Training examples: 0 positive, 0 negative
% 4.55/2.49
% 4.55/2.49 # -------------------------------------------------
% 4.55/2.49 # User time : 0.029 s
% 4.55/2.49 # System time : 0.004 s
% 4.55/2.49 # Total time : 0.033 s
% 4.55/2.49 # Maximum resident set size: 7120 pages
% 4.55/2.49
%------------------------------------------------------------------------------