TSTP Solution File: SWV491+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 10.40s 2.70s
% Output : CNFRefutation 10.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 15 unt; 9 nHn; 48 RR)
% Number of literals : 128 ( 38 equ; 69 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 57 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_32,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/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_32) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_1) ).
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-kkcazy9u/input.p',i_0_17) ).
cnf(i_0_26,negated_conjecture,
int_leq(esk3_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_26) ).
cnf(i_0_27,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_27) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_13) ).
cnf(i_0_25,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_25) ).
cnf(i_0_28,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_28) ).
cnf(i_0_29,negated_conjecture,
int_leq(int_one,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_29) ).
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-kkcazy9u/input.p',i_0_12) ).
cnf(i_0_30,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-kkcazy9u/input.p',i_0_30) ).
cnf(i_0_19,negated_conjecture,
( esk3_0 = esk2_0
| a(esk2_0,esk3_0) != real_zero ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_19) ).
cnf(i_0_31,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_31) ).
cnf(i_0_5,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_5) ).
cnf(i_0_24,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0)
| a(esk2_0,esk3_0) != real_one ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kkcazy9u/input.p',i_0_24) ).
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_32 ).
cnf(c_0_49,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_50,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_51,negated_conjecture,
int_leq(esk3_0,n),
i_0_26 ).
cnf(c_0_52,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_27 ).
cnf(c_0_53,plain,
( a(plus(X1,X2),X1) = real_zero
| ~ epred1_2(plus(X3,X2),X3)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
cnf(c_0_56,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0) ),
i_0_25 ).
cnf(c_0_57,negated_conjecture,
( epred1_2(X1,esk3_0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_58,negated_conjecture,
int_leq(esk2_0,n),
i_0_28 ).
cnf(c_0_59,negated_conjecture,
int_leq(int_one,esk2_0),
i_0_29 ).
cnf(c_0_60,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
i_0_12 ).
cnf(c_0_61,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_30 ).
cnf(c_0_62,plain,
( a(plus(X1,X2),X1) = real_zero
| ~ epred1_2(plus(X1,X2),X1)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( plus(esk3_0,esk1_2(esk3_0,esk2_0)) = esk2_0
| esk3_0 = esk2_0
| int_less(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_65,negated_conjecture,
( esk3_0 = esk2_0
| int_less(int_zero,esk1_2(esk3_0,esk2_0))
| int_less(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
( esk3_0 = esk2_0
| a(esk2_0,esk3_0) != real_zero ),
i_0_19 ).
cnf(c_0_67,negated_conjecture,
( epred1_2(X1,esk2_0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_58]),c_0_59])]) ).
cnf(c_0_68,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_61]) ).
cnf(c_0_69,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[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_52])]),c_0_65]),c_0_66]) ).
cnf(c_0_70,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
i_0_31 ).
cnf(c_0_71,negated_conjecture,
epred1_2(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_51]),c_0_52])]) ).
cnf(c_0_72,plain,
( a(X1,plus(X1,X2)) = real_zero
| ~ epred1_2(X1,plus(X1,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_54]) ).
cnf(c_0_73,plain,
( plus(esk2_0,esk1_2(esk2_0,esk3_0)) = esk3_0
| esk3_0 = esk2_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_69]) ).
cnf(c_0_74,plain,
( esk3_0 = esk2_0
| int_less(int_zero,esk1_2(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_60,c_0_69]) ).
cnf(c_0_75,plain,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
i_0_5 ).
cnf(c_0_77,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0)
| a(esk2_0,esk3_0) != real_one ),
i_0_24 ).
cnf(c_0_78,plain,
esk3_0 = esk2_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_64]),c_0_59])]),c_0_74]),c_0_66]) ).
cnf(c_0_79,negated_conjecture,
a(esk2_0,esk2_0) = real_one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_59]),c_0_54])]) ).
cnf(c_0_80,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_78]),c_0_78]),c_0_79])]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 10:37:28 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 10.40/2.70 # ENIGMATIC: Solved by autoschedule:
% 10.40/2.70 # No SInE strategy applied
% 10.40/2.70 # Trying AutoSched0 for 150 seconds
% 10.40/2.70 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S00EN
% 10.40/2.70 # and selection function PSelectSmallestOrientable.
% 10.40/2.70 #
% 10.40/2.70 # Preprocessing time : 0.023 s
% 10.40/2.70 # Presaturation interreduction done
% 10.40/2.70
% 10.40/2.70 # Proof found!
% 10.40/2.70 # SZS status Theorem
% 10.40/2.70 # SZS output start CNFRefutation
% See solution above
% 10.40/2.70 # Training examples: 0 positive, 0 negative
% 10.40/2.70
% 10.40/2.70 # -------------------------------------------------
% 10.40/2.70 # User time : 0.161 s
% 10.40/2.70 # System time : 0.008 s
% 10.40/2.70 # Total time : 0.169 s
% 10.40/2.70 # Maximum resident set size: 7116 pages
% 10.40/2.70
%------------------------------------------------------------------------------