TSTP Solution File: SWV486+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV486+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:44 EDT 2022
% Result : Theorem 8.06s 2.47s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of clauses : 57 ( 21 unt; 8 nHn; 54 RR)
% Number of literals : 116 ( 24 equ; 65 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 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 : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,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/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_22) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_13) ).
cnf(i_0_20,negated_conjecture,
int_less(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_20) ).
cnf(i_0_21,negated_conjecture,
int_leq(int_one,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_21) ).
cnf(i_0_18,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_18) ).
cnf(i_0_12,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_12) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_1) ).
cnf(i_0_3,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
int_leq(esk3_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_19) ).
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/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_17) ).
cnf(i_0_4,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_4) ).
cnf(i_0_2,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_2) ).
cnf(i_0_15,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_15) ).
cnf(i_0_14,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_14) ).
cnf(i_0_5,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_5) ).
cnf(i_0_6,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m5_fmnji/input.p',i_0_6) ).
cnf(c_0_39,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_22 ).
cnf(c_0_40,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
cnf(c_0_41,negated_conjecture,
int_less(esk2_0,esk3_0),
i_0_20 ).
cnf(c_0_42,plain,
( a(X1,plus(X1,X2)) = real_zero
| ~ epred1_2(X3,plus(X3,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
plus(esk2_0,esk1_2(esk2_0,esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
int_leq(int_one,esk2_0),
i_0_21 ).
cnf(c_0_45,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
i_0_18 ).
cnf(c_0_46,negated_conjecture,
( ~ epred1_2(X1,plus(X1,esk1_2(esk2_0,esk3_0)))
| ~ int_less(int_zero,esk1_2(esk2_0,esk3_0))
| ~ int_leq(esk2_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_47,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
i_0_12 ).
cnf(c_0_48,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_49,plain,
( ~ epred1_2(X1,plus(X1,esk1_2(esk2_0,esk3_0)))
| ~ int_leq(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_41])]) ).
cnf(c_0_50,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
i_0_3 ).
cnf(c_0_52,negated_conjecture,
int_leq(esk3_0,n),
i_0_19 ).
cnf(c_0_53,negated_conjecture,
~ epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_43]),c_0_50])]) ).
cnf(c_0_54,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_55,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
i_0_4 ).
cnf(c_0_56,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,hypothesis,
( ~ int_leq(esk2_0,n)
| ~ int_leq(int_one,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_52]),c_0_44])]) ).
cnf(c_0_58,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
i_0_2 ).
cnf(c_0_59,negated_conjecture,
( n = esk3_0
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( ~ int_less(esk2_0,n)
| ~ int_leq(int_one,esk3_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_59,c_0_41]) ).
cnf(c_0_62,negated_conjecture,
( n = esk3_0
| ~ int_leq(int_one,esk3_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
i_0_15 ).
cnf(c_0_64,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
i_0_14 ).
cnf(c_0_65,plain,
( n = esk3_0
| ~ int_less(int_zero,esk3_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( int_less(X1,esk3_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_67,negated_conjecture,
int_less(int_zero,esk2_0),
inference(spm,[status(thm)],[c_0_64,c_0_44]) ).
cnf(c_0_68,negated_conjecture,
n = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_69,plain,
~ int_leq(int_one,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_68]),c_0_41])]) ).
cnf(c_0_70,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
i_0_5 ).
cnf(c_0_71,plain,
~ int_less(int_one,esk3_0),
inference(spm,[status(thm)],[c_0_69,c_0_58]) ).
cnf(c_0_72,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( esk2_0 = int_one
| int_less(int_one,esk2_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_44]) ).
cnf(c_0_74,negated_conjecture,
~ int_less(int_one,esk2_0),
inference(spm,[status(thm)],[c_0_71,c_0_66]) ).
cnf(c_0_75,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
i_0_6 ).
cnf(c_0_76,plain,
~ int_less(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_72,c_0_66]) ).
cnf(c_0_77,negated_conjecture,
esk2_0 = int_one,
inference(sr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,plain,
int_less(esk3_0,int_one),
inference(spm,[status(thm)],[c_0_69,c_0_75]) ).
cnf(c_0_79,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV486+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.37 % DateTime : Tue Jun 14 20:30:22 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.48 # ENIGMATIC: Selected complete mode:
% 8.06/2.47 # ENIGMATIC: Solved by autoschedule:
% 8.06/2.47 # No SInE strategy applied
% 8.06/2.47 # Trying AutoSched0 for 150 seconds
% 8.06/2.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05AI
% 8.06/2.47 # and selection function PSelectComplexExceptUniqMaxPosHorn.
% 8.06/2.47 #
% 8.06/2.47 # Preprocessing time : 0.014 s
% 8.06/2.47 # Presaturation interreduction done
% 8.06/2.47
% 8.06/2.47 # Proof found!
% 8.06/2.47 # SZS status Theorem
% 8.06/2.47 # SZS output start CNFRefutation
% See solution above
% 8.06/2.47 # Training examples: 0 positive, 0 negative
% 8.06/2.47
% 8.06/2.47 # -------------------------------------------------
% 8.06/2.47 # User time : 0.018 s
% 8.06/2.47 # System time : 0.003 s
% 8.06/2.47 # Total time : 0.022 s
% 8.06/2.47 # Maximum resident set size: 7116 pages
% 8.06/2.47
%------------------------------------------------------------------------------