%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO010+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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.36s 2.44s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 7 unt; 6 nHn; 25 RR)
% Number of literals : 61 ( 7 equ; 28 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 : 40 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_15) ).
cnf(i_0_89,negated_conjecture,
occurrence_of(esk16_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_89) ).
cnf(i_0_86,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk18_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk16_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_86) ).
cnf(i_0_61,plain,
( leaf_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_61) ).
cnf(i_0_37,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_37) ).
cnf(i_0_29,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_29) ).
cnf(i_0_35,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_35) ).
cnf(i_0_82,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk17_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk16_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_82) ).
cnf(i_0_79,plain,
tptp2 != tptp1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8tsdbsgv/lgb.p',i_0_79) ).
cnf(c_0_99,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_15 ).
cnf(c_0_100,negated_conjecture,
occurrence_of(esk16_0,tptp0),
i_0_89 ).
cnf(c_0_101,negated_conjecture,
( occurrence_of(X1,tptp1)
| min_precedes(X2,esk18_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk16_0) ),
i_0_86 ).
cnf(c_0_102,plain,
( leaf_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_61 ).
cnf(c_0_103,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
i_0_37 ).
cnf(c_0_105,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
i_0_29 ).
cnf(c_0_106,plain,
( min_precedes(X1,esk18_2(X1,esk15_1(esk16_0)),tptp0)
| occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_100])]) ).
cnf(c_0_107,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
i_0_35 ).
cnf(c_0_108,plain,
( esk9_2(X1,esk16_0) = tptp0
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk17_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk16_0) ),
i_0_82 ).
cnf(c_0_110,plain,
( occurrence_of(esk15_1(esk16_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
( leaf(X1,tptp0)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_112,plain,
( min_precedes(X1,esk17_2(X1,esk15_1(esk16_0)),tptp0)
| occurrence_of(esk15_1(esk16_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_102]),c_0_100])]) ).
cnf(c_0_113,plain,
( occurrence_of(esk15_1(esk16_0),tptp1)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,plain,
( occurrence_of(esk15_1(esk16_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_105,c_0_112]) ).
cnf(c_0_115,plain,
occurrence_of(esk15_1(esk16_0),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_102]),c_0_100])]) ).
cnf(c_0_116,plain,
( occurrence_of(esk15_1(esk16_0),tptp2)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_114,c_0_111]) ).
cnf(c_0_117,plain,
( X1 = tptp1
| ~ occurrence_of(esk15_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_115]) ).
cnf(c_0_118,plain,
occurrence_of(esk15_1(esk16_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_102]),c_0_100])]) ).
cnf(c_0_119,plain,
tptp2 != tptp1,
i_0_79 ).
cnf(c_0_120,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO010+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n027.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 01:41:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.36/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.36/2.44 # No SInE strategy applied
% 7.36/2.44 # Trying AutoSched0 for 150 seconds
% 7.36/2.44 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 7.36/2.44 # and selection function SelectNewComplexAHPExceptRRHorn.
% 7.36/2.44 #
% 7.36/2.44 # Preprocessing time : 0.024 s
% 7.36/2.44 # Presaturation interreduction done
% 7.36/2.44
% 7.36/2.44 # Proof found!
% 7.36/2.44 # SZS status Theorem
% 7.36/2.44 # SZS output start CNFRefutation
% See solution above
% 7.36/2.44 # Training examples: 0 positive, 0 negative
% 7.36/2.44
% 7.36/2.44 # -------------------------------------------------
% 7.36/2.44 # User time : 0.035 s
% 7.36/2.44 # System time : 0.008 s
% 7.36/2.44 # Total time : 0.043 s
% 7.36/2.44 # Maximum resident set size: 7128 pages
% 7.36/2.44
%------------------------------------------------------------------------------