TSTP Solution File: MSC010+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Sun Jul 17 22:39:44 EDT 2022
% Result : Theorem 7.79s 2.31s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 19 unt; 3 nHn; 22 RR)
% Number of literals : 42 ( 14 equ; 21 neg)
% Maximal clause size : 9 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( pv64 = X1
| a_select3(id_ds1_filter_init,X2,X1) = init
| X2 != pv63
| ~ epred5_0
| ~ leq(X1,pv64)
| ~ leq(X1,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X1)
| ~ leq(n0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
esk1_0 = pv63,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
epred5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_10) ).
cnf(i_0_7,negated_conjecture,
leq(esk1_0,n5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_9) ).
cnf(i_0_6,negated_conjecture,
leq(esk2_0,n5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_6) ).
cnf(i_0_3,negated_conjecture,
leq(esk2_0,pv64),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_3) ).
cnf(i_0_8,negated_conjecture,
leq(n0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_8) ).
cnf(i_0_2,negated_conjecture,
a_select3(id_ds1_filter_init,esk1_0,esk2_0) != init,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
pv64 != esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nz0plj7z/lgb.p',i_0_5) ).
cnf(c_0_21,plain,
( pv64 = X1
| a_select3(id_ds1_filter_init,X2,X1) = init
| X2 != pv63
| ~ epred5_0
| ~ leq(X1,pv64)
| ~ leq(X1,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X1)
| ~ leq(n0,X2) ),
i_0_1 ).
cnf(c_0_22,negated_conjecture,
esk1_0 = pv63,
i_0_4 ).
cnf(c_0_23,negated_conjecture,
epred5_0,
i_0_10 ).
cnf(c_0_24,negated_conjecture,
leq(esk1_0,n5),
i_0_7 ).
cnf(c_0_25,negated_conjecture,
leq(n0,esk1_0),
i_0_9 ).
cnf(c_0_26,plain,
( a_select3(id_ds1_filter_init,esk1_0,X1) = init
| pv64 = X1
| ~ leq(X1,n5)
| ~ leq(X1,pv64)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])])]),c_0_24]),c_0_25])]) ).
cnf(c_0_27,negated_conjecture,
leq(esk2_0,n5),
i_0_6 ).
cnf(c_0_28,negated_conjecture,
leq(esk2_0,pv64),
i_0_3 ).
cnf(c_0_29,negated_conjecture,
leq(n0,esk2_0),
i_0_8 ).
cnf(c_0_30,negated_conjecture,
a_select3(id_ds1_filter_init,esk1_0,esk2_0) != init,
i_0_2 ).
cnf(c_0_31,negated_conjecture,
pv64 != esk2_0,
i_0_5 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 15:46:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.79/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.79/2.31 # No SInE strategy applied
% 7.79/2.31 # Trying AutoSched0 for 150 seconds
% 7.79/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.79/2.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.79/2.31 #
% 7.79/2.31 # Preprocessing time : 0.023 s
% 7.79/2.31 # Presaturation interreduction done
% 7.79/2.31
% 7.79/2.31 # Proof found!
% 7.79/2.31 # SZS status Theorem
% 7.79/2.31 # SZS output start CNFRefutation
% See solution above
% 7.79/2.31 # Training examples: 0 positive, 0 negative
% 7.79/2.31
% 7.79/2.31 # -------------------------------------------------
% 7.79/2.31 # User time : 0.024 s
% 7.79/2.31 # System time : 0.006 s
% 7.79/2.31 # Total time : 0.030 s
% 7.79/2.31 # Maximum resident set size: 7124 pages
% 7.79/2.31
%------------------------------------------------------------------------------