TSTP Solution File: PRO009+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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.44s 2.22s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of clauses : 70 ( 24 unt; 11 nHn; 70 RR)
% Number of literals : 156 ( 10 equ; 89 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_61,plain,
( leaf_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_61) ).
cnf(i_0_82,negated_conjecture,
occurrence_of(esk16_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_82) ).
cnf(i_0_15,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_15) ).
cnf(i_0_37,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_37) ).
cnf(i_0_66,plain,
( root_occ(esk13_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_66) ).
cnf(i_0_67,plain,
( occurrence_of(esk13_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_67) ).
cnf(i_0_64,plain,
( next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_64) ).
cnf(i_0_40,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_40) ).
cnf(i_0_31,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_31) ).
cnf(i_0_73,plain,
atomic(tptp3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_73) ).
cnf(i_0_80,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk16_0)
| ~ leaf_occ(X2,esk16_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_80) ).
cnf(i_0_63,plain,
( occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_63) ).
cnf(i_0_81,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk16_0)
| ~ leaf_occ(X2,esk16_0)
| ~ min_precedes(X1,X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_81) ).
cnf(i_0_55,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_55) ).
cnf(i_0_35,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_35) ).
cnf(i_0_4,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X1,X4)
| ~ leaf_occ(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_4) ).
cnf(i_0_5,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_5) ).
cnf(i_0_16,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_16) ).
cnf(i_0_14,plain,
( atomic(X1)
| occurrence_of(esk4_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_14) ).
cnf(i_0_69,plain,
~ atomic(tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_69) ).
cnf(i_0_20,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_20) ).
cnf(i_0_13,plain,
( atomic(X1)
| leaf_occ(X2,esk4_2(X2,X1))
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k0rbp2ok/lgb.p',i_0_13) ).
cnf(c_0_105,plain,
( leaf_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_61 ).
cnf(c_0_106,negated_conjecture,
occurrence_of(esk16_0,tptp0),
i_0_82 ).
cnf(c_0_107,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_15 ).
cnf(c_0_108,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
i_0_37 ).
cnf(c_0_109,negated_conjecture,
leaf_occ(esk15_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
( root_occ(esk13_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
i_0_66 ).
cnf(c_0_111,plain,
( occurrence_of(esk13_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
i_0_67 ).
cnf(c_0_112,plain,
( next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
i_0_64 ).
cnf(c_0_113,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_106]) ).
cnf(c_0_114,plain,
occurrence_of(esk16_0,esk9_2(esk15_1(esk16_0),esk16_0)),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
i_0_40 ).
cnf(c_0_116,negated_conjecture,
root_occ(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_110,c_0_106]) ).
cnf(c_0_117,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_31 ).
cnf(c_0_118,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(spm,[status(thm)],[c_0_111,c_0_106]) ).
cnf(c_0_119,plain,
atomic(tptp3),
i_0_73 ).
cnf(c_0_120,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,esk16_0)
| ~ leaf_occ(X2,esk16_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_80 ).
cnf(c_0_121,plain,
( occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
i_0_63 ).
cnf(c_0_122,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,esk16_0)
| ~ leaf_occ(X2,esk16_0)
| ~ min_precedes(X1,X2,tptp0) ),
i_0_81 ).
cnf(c_0_123,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_55 ).
cnf(c_0_124,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_112,c_0_106]) ).
cnf(c_0_125,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
i_0_35 ).
cnf(c_0_126,negated_conjecture,
esk9_2(esk15_1(esk16_0),esk16_0) = tptp0,
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_127,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X1,X4)
| ~ leaf_occ(X2,X4) ),
i_0_4 ).
cnf(c_0_128,plain,
subactivity_occurrence(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_129,plain,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119])]) ).
cnf(c_0_130,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
i_0_5 ).
cnf(c_0_131,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ root_occ(X1,esk16_0)
| ~ occurrence_of(esk15_1(esk16_0),tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_120,c_0_109]) ).
cnf(c_0_132,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp2)
| occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(spm,[status(thm)],[c_0_121,c_0_106]) ).
cnf(c_0_133,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ root_occ(X1,esk16_0)
| ~ occurrence_of(esk15_1(esk16_0),tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_122,c_0_109]) ).
cnf(c_0_134,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_16 ).
cnf(c_0_135,plain,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_136,plain,
( atomic(X1)
| occurrence_of(esk4_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
i_0_14 ).
cnf(c_0_137,plain,
leaf(esk15_1(esk16_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_109]),c_0_126]) ).
cnf(c_0_138,plain,
~ atomic(tptp0),
i_0_69 ).
cnf(c_0_139,plain,
( esk13_1(esk16_0) = X1
| min_precedes(esk13_1(esk16_0),X1,X2)
| ~ leaf_occ(X1,esk16_0)
| ~ occurrence_of(esk16_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129])]) ).
cnf(c_0_140,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
i_0_20 ).
cnf(c_0_141,negated_conjecture,
activity_occurrence(esk16_0),
inference(spm,[status(thm)],[c_0_130,c_0_106]) ).
cnf(c_0_142,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ root_occ(X1,esk16_0)
| ~ occurrence_of(X1,tptp3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]) ).
cnf(c_0_143,plain,
( ~ leaf_occ(esk13_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_144,plain,
occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138]) ).
cnf(c_0_145,negated_conjecture,
( esk13_1(esk16_0) = esk15_1(esk16_0)
| min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),X1)
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_139,c_0_109]) ).
cnf(c_0_146,plain,
esk5_1(esk16_0) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_140]),c_0_141])]) ).
cnf(c_0_147,negated_conjecture,
~ min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_116]),c_0_118])]) ).
cnf(c_0_148,plain,
( atomic(X1)
| leaf_occ(X2,esk4_2(X2,X1))
| ~ leaf(X2,X1) ),
i_0_13 ).
cnf(c_0_149,plain,
~ leaf_occ(esk13_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_150,plain,
esk13_1(esk16_0) = esk15_1(esk16_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_140]),c_0_146]),c_0_141])]),c_0_147]) ).
cnf(c_0_151,plain,
leaf_occ(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_137]),c_0_138]) ).
cnf(c_0_152,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150]),c_0_151])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.30 % Computer : n011.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Mon Jun 13 03:16:50 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.16/0.41 # ENIGMATIC: Selected complete mode:
% 4.44/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.44/2.22 # No SInE strategy applied
% 4.44/2.22 # Trying AutoSched0 for 150 seconds
% 4.44/2.22 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 4.44/2.22 # and selection function SelectNewComplexAHPNS.
% 4.44/2.22 #
% 4.44/2.22 # Preprocessing time : 0.026 s
% 4.44/2.22
% 4.44/2.22 # Proof found!
% 4.44/2.22 # SZS status Theorem
% 4.44/2.22 # SZS output start CNFRefutation
% See solution above
% 4.44/2.22 # Training examples: 0 positive, 0 negative
% 4.44/2.22
% 4.44/2.22 # -------------------------------------------------
% 4.44/2.22 # User time : 0.041 s
% 4.44/2.22 # System time : 0.005 s
% 4.44/2.22 # Total time : 0.046 s
% 4.44/2.22 # Maximum resident set size: 7124 pages
% 4.44/2.22
%------------------------------------------------------------------------------