TSTP Solution File: SWV489+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV489+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : Wed Jul 20 17:47:46 EDT 2022
% Result : Theorem 9.93s 2.66s
% Output : CNFRefutation 9.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of clauses : 49 ( 22 unt; 4 nHn; 41 RR)
% Number of literals : 123 ( 29 equ; 77 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_leq(X2,X4)
| ~ int_less(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_10) ).
cnf(i_0_8,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_8) ).
cnf(i_0_24,plain,
( a(X1,plus(X1,X2)) = real_zero
| X3 != plus(X4,X2)
| ~ int_leq(X1,X4)
| ~ epred1_2(X4,X3)
| ~ int_leq(int_one,X1)
| ~ int_less(int_zero,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_24) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_13) ).
cnf(i_0_12,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_12) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_1) ).
cnf(i_0_26,plain,
( a(plus(X1,X2),X1) = real_zero
| X3 != plus(X4,X2)
| ~ int_leq(X1,X4)
| ~ epred1_2(X3,X4)
| ~ int_leq(int_one,X1)
| ~ int_less(int_zero,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_26) ).
cnf(i_0_9,plain,
plus(X1,int_zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_9) ).
cnf(i_0_17,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_17) ).
cnf(i_0_18,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_18) ).
cnf(i_0_23,negated_conjecture,
int_leq(int_one,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_23) ).
cnf(i_0_20,negated_conjecture,
int_leq(esk3_0,n),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_20) ).
cnf(i_0_22,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_22) ).
cnf(i_0_21,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_21) ).
cnf(i_0_3,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
esk3_0 != esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_19) ).
cnf(i_0_6,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y42sr8bo/input.p',i_0_6) ).
cnf(c_0_44,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_leq(X2,X4)
| ~ int_less(X1,X3) ),
i_0_10 ).
cnf(c_0_45,plain,
plus(X1,X2) = plus(X2,X1),
i_0_8 ).
cnf(c_0_46,plain,
( a(X1,plus(X1,X2)) = real_zero
| X3 != plus(X4,X2)
| ~ int_leq(X1,X4)
| ~ epred1_2(X4,X3)
| ~ int_leq(int_one,X1)
| ~ int_less(int_zero,X2) ),
i_0_24 ).
cnf(c_0_47,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
cnf(c_0_48,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
i_0_12 ).
cnf(c_0_49,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_50,plain,
( a(plus(X1,X2),X1) = real_zero
| X3 != plus(X4,X2)
| ~ int_leq(X1,X4)
| ~ epred1_2(X3,X4)
| ~ int_leq(int_one,X1)
| ~ int_less(int_zero,X2) ),
i_0_26 ).
cnf(c_0_51,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
plus(X1,int_zero) = X1,
i_0_9 ).
cnf(c_0_53,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| ~ epred1_2(X2,X3)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47])]),c_0_48]) ).
cnf(c_0_54,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( a(plus(X1,esk1_2(X2,X3)),X1) = real_zero
| ~ epred1_2(X3,X2)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_47])]),c_0_48]) ).
cnf(c_0_56,plain,
( int_leq(plus(X1,X2),X3)
| ~ int_less(X1,esk1_2(X4,X3))
| ~ int_less(X4,X3)
| ~ int_leq(X2,X4) ),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_57,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_45]) ).
cnf(c_0_58,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_47]),c_0_54])]) ).
cnf(c_0_59,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1) ),
i_0_17 ).
cnf(c_0_60,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_54])]) ).
cnf(c_0_61,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_48]),c_0_57]) ).
cnf(c_0_62,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
i_0_18 ).
cnf(c_0_63,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
int_leq(int_one,esk2_0),
i_0_23 ).
cnf(c_0_65,negated_conjecture,
int_leq(esk3_0,n),
i_0_20 ).
cnf(c_0_66,negated_conjecture,
int_leq(esk2_0,n),
i_0_22 ).
cnf(c_0_67,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_21 ).
cnf(c_0_68,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_61]) ).
cnf(c_0_69,negated_conjecture,
~ int_less(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]),c_0_66]),c_0_67])]) ).
cnf(c_0_70,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
i_0_3 ).
cnf(c_0_71,negated_conjecture,
esk3_0 != esk2_0,
i_0_19 ).
cnf(c_0_72,negated_conjecture,
~ int_less(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_68]),c_0_67]),c_0_65]),c_0_66])]) ).
cnf(c_0_73,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
i_0_6 ).
cnf(c_0_74,plain,
~ int_leq(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_75,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV489+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Wed Jun 15 13:25:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 9.93/2.66 # ENIGMATIC: Solved by autoschedule:
% 9.93/2.66 # No SInE strategy applied
% 9.93/2.66 # Trying AutoSched0 for 150 seconds
% 9.93/2.66 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S0Y
% 9.93/2.66 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.93/2.66 #
% 9.93/2.66 # Preprocessing time : 0.023 s
% 9.93/2.66
% 9.93/2.66 # Proof found!
% 9.93/2.66 # SZS status Theorem
% 9.93/2.66 # SZS output start CNFRefutation
% See solution above
% 9.93/2.66 # Training examples: 0 positive, 0 negative
% 9.93/2.66
% 9.93/2.66 # -------------------------------------------------
% 9.93/2.66 # User time : 0.259 s
% 9.93/2.66 # System time : 0.008 s
% 9.93/2.66 # Total time : 0.268 s
% 9.93/2.66 # Maximum resident set size: 7124 pages
% 9.93/2.66
%------------------------------------------------------------------------------