TSTP Solution File: SWV491+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV491+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 8.51s 2.57s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 46 ( 12 unt; 4 nHn; 43 RR)
% Number of literals : 135 ( 38 equ; 88 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 67 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,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-xgjskc7g/input.p',i_0_26) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/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-xgjskc7g/input.p',i_0_12) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_1) ).
cnf(i_0_28,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-xgjskc7g/input.p',i_0_28) ).
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-xgjskc7g/input.p',i_0_17) ).
cnf(i_0_19,negated_conjecture,
( esk3_0 = esk2_0
| a(esk2_0,esk3_0) != real_zero ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_19) ).
cnf(i_0_25,negated_conjecture,
int_leq(int_one,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_25) ).
cnf(i_0_22,negated_conjecture,
int_leq(esk3_0,n),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_22) ).
cnf(i_0_24,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_24) ).
cnf(i_0_23,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_23) ).
cnf(i_0_3,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_3) ).
cnf(i_0_27,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_27) ).
cnf(i_0_6,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_6) ).
cnf(i_0_20,negated_conjecture,
( esk3_0 != esk2_0
| a(esk2_0,esk3_0) != real_one ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xgjskc7g/input.p',i_0_20) ).
cnf(c_0_44,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_26 ).
cnf(c_0_45,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
cnf(c_0_46,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
i_0_12 ).
cnf(c_0_47,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_48,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_28 ).
cnf(c_0_49,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_44,c_0_45])]),c_0_46]) ).
cnf(c_0_50,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,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_48,c_0_45])]),c_0_46]) ).
cnf(c_0_52,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_49,c_0_45]),c_0_50])]) ).
cnf(c_0_53,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_54,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_51,c_0_45]),c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
( esk3_0 = esk2_0
| a(esk2_0,esk3_0) != real_zero ),
i_0_19 ).
cnf(c_0_56,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_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
int_leq(int_one,esk2_0),
i_0_25 ).
cnf(c_0_58,negated_conjecture,
int_leq(esk3_0,n),
i_0_22 ).
cnf(c_0_59,negated_conjecture,
int_leq(esk2_0,n),
i_0_24 ).
cnf(c_0_60,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_23 ).
cnf(c_0_61,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
( esk3_0 = esk2_0
| ~ 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_55,c_0_56]),c_0_57]),c_0_58]),c_0_59]),c_0_60])]) ).
cnf(c_0_63,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
i_0_3 ).
cnf(c_0_64,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
i_0_27 ).
cnf(c_0_65,negated_conjecture,
( esk3_0 = esk2_0
| ~ int_less(esk3_0,esk2_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_55,c_0_61]),c_0_60]),c_0_58]),c_0_59]),c_0_57])]) ).
cnf(c_0_66,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
i_0_6 ).
cnf(c_0_67,plain,
( esk3_0 = esk2_0
| ~ int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,hypothesis,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X3,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X3)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_53]) ).
cnf(c_0_69,negated_conjecture,
( esk3_0 != esk2_0
| a(esk2_0,esk3_0) != real_one ),
i_0_20 ).
cnf(c_0_70,plain,
esk3_0 = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_59]),c_0_57])]) ).
cnf(c_0_72,negated_conjecture,
a(esk2_0,esk2_0) != real_one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_58]),c_0_60])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_57]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV491+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 17:55:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.51/2.57 # ENIGMATIC: Solved by autoschedule:
% 8.51/2.57 # No SInE strategy applied
% 8.51/2.57 # Trying AutoSched0 for 150 seconds
% 8.51/2.57 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S0Y
% 8.51/2.57 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.51/2.57 #
% 8.51/2.57 # Preprocessing time : 0.013 s
% 8.51/2.57
% 8.51/2.57 # Proof found!
% 8.51/2.57 # SZS status Theorem
% 8.51/2.57 # SZS output start CNFRefutation
% See solution above
% 8.51/2.57 # Training examples: 0 positive, 0 negative
% 8.51/2.57
% 8.51/2.57 # -------------------------------------------------
% 8.51/2.57 # User time : 0.096 s
% 8.51/2.57 # System time : 0.008 s
% 8.51/2.57 # Total time : 0.104 s
% 8.51/2.57 # Maximum resident set size: 7120 pages
% 8.51/2.57
%------------------------------------------------------------------------------