TSTP Solution File: SWV487+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV487+1 : 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:45 EDT 2022
% Result : Theorem 7.79s 2.42s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 16 unt; 5 nHn; 43 RR)
% Number of literals : 95 ( 18 equ; 52 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 : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,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-6dvf2nsc/input.p',i_0_23) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_13) ).
cnf(i_0_20,negated_conjecture,
int_less(esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_20) ).
cnf(i_0_21,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/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-6dvf2nsc/input.p',i_0_18) ).
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-6dvf2nsc/input.p',i_0_4) ).
cnf(i_0_3,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_19) ).
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-6dvf2nsc/input.p',i_0_12) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_1) ).
cnf(i_0_15,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/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-6dvf2nsc/input.p',i_0_14) ).
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-6dvf2nsc/input.p',i_0_17) ).
cnf(i_0_2,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dvf2nsc/input.p',i_0_2) ).
cnf(c_0_38,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_23 ).
cnf(c_0_39,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
cnf(c_0_40,negated_conjecture,
int_less(esk3_0,esk2_0),
i_0_20 ).
cnf(c_0_41,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_38]) ).
cnf(c_0_42,negated_conjecture,
plus(esk3_0,esk1_2(esk3_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_21 ).
cnf(c_0_44,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
i_0_18 ).
cnf(c_0_45,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
i_0_4 ).
cnf(c_0_46,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
i_0_3 ).
cnf(c_0_47,negated_conjecture,
int_leq(esk2_0,n),
i_0_19 ).
cnf(c_0_48,plain,
( ~ epred1_2(plus(X1,esk1_2(esk3_0,esk2_0)),X1)
| ~ int_less(int_zero,esk1_2(esk3_0,esk2_0))
| ~ int_leq(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_49,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
i_0_12 ).
cnf(c_0_50,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_51,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
i_0_15 ).
cnf(c_0_52,negated_conjecture,
( int_less(X1,esk2_0)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_53,negated_conjecture,
( n = esk2_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( ~ epred1_2(plus(X1,esk1_2(esk3_0,esk2_0)),X1)
| ~ int_leq(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_40])]) ).
cnf(c_0_55,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( int_leq(int_one,esk2_0)
| ~ int_less(int_zero,esk3_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
i_0_14 ).
cnf(c_0_58,negated_conjecture,
( n = esk2_0
| int_less(X1,n)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
~ epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_55])]) ).
cnf(c_0_60,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_61,plain,
int_leq(int_one,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43])]) ).
cnf(c_0_62,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
i_0_2 ).
cnf(c_0_63,negated_conjecture,
( n = esk2_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_58,c_0_40]) ).
cnf(c_0_64,hypothesis,
~ int_leq(esk3_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_47]),c_0_43]),c_0_61])]) ).
cnf(c_0_65,plain,
n = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_66,negated_conjecture,
int_leq(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_62,c_0_40]) ).
cnf(c_0_67,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 07:04:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.79/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.79/2.42 # No SInE strategy applied
% 7.79/2.42 # Trying AutoSched0 for 150 seconds
% 7.79/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05AI
% 7.79/2.42 # and selection function PSelectComplexExceptUniqMaxPosHorn.
% 7.79/2.42 #
% 7.79/2.42 # Preprocessing time : 0.024 s
% 7.79/2.42 # Presaturation interreduction done
% 7.79/2.42
% 7.79/2.42 # Proof found!
% 7.79/2.42 # SZS status Theorem
% 7.79/2.42 # SZS output start CNFRefutation
% See solution above
% 7.79/2.42 # Training examples: 0 positive, 0 negative
% 7.79/2.42
% 7.79/2.42 # -------------------------------------------------
% 7.79/2.42 # User time : 0.028 s
% 7.79/2.42 # System time : 0.007 s
% 7.79/2.42 # Total time : 0.035 s
% 7.79/2.42 # Maximum resident set size: 7116 pages
% 7.79/2.42
%------------------------------------------------------------------------------