%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV487+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 9.68s 2.49s
% Output : CNFRefutation 9.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 48 ( 18 unt; 7 nHn; 47 RR)
% Number of literals : 106 ( 20 equ; 55 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_19) ).
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-chm5kzjv/lgb.p',i_0_4) ).
cnf(i_0_20,negated_conjecture,
int_less(esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_20) ).
cnf(i_0_14,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_14) ).
cnf(i_0_21,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_21) ).
cnf(i_0_24,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-chm5kzjv/lgb.p',i_0_24) ).
cnf(i_0_13,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_13) ).
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-chm5kzjv/lgb.p',i_0_12) ).
cnf(i_0_2,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_2) ).
cnf(i_0_18,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_18) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.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-chm5kzjv/lgb.p',i_0_17) ).
cnf(i_0_15,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-chm5kzjv/lgb.p',i_0_15) ).
cnf(c_0_39,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
i_0_3 ).
cnf(c_0_40,negated_conjecture,
int_leq(esk2_0,n),
i_0_19 ).
cnf(c_0_41,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
i_0_4 ).
cnf(c_0_42,negated_conjecture,
( n = esk2_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( n = esk2_0
| int_less(X1,n)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
int_less(esk3_0,esk2_0),
i_0_20 ).
cnf(c_0_45,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
i_0_14 ).
cnf(c_0_46,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_21 ).
cnf(c_0_47,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_24 ).
cnf(c_0_48,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
i_0_13 ).
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)
| ~ int_less(X1,X2) ),
i_0_2 ).
cnf(c_0_51,negated_conjecture,
( n = esk2_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( int_less(X1,esk2_0)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
int_less(int_zero,esk3_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,plain,
( a(plus(X1,X2),X1) = real_zero
| ~ epred1_2(plus(X3,X2),X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3)
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
plus(esk3_0,esk1_2(esk3_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_48,c_0_44]) ).
cnf(c_0_56,negated_conjecture,
int_less(int_zero,esk1_2(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_57,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
i_0_18 ).
cnf(c_0_58,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
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,
( n = esk2_0
| int_leq(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
i_0_15 ).
cnf(c_0_62,negated_conjecture,
int_less(int_zero,esk2_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,plain,
( ~ epred1_2(plus(X1,esk1_2(esk3_0,esk2_0)),X1)
| ~ int_leq(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_46]),c_0_56])]),c_0_57]) ).
cnf(c_0_64,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_65,hypothesis,
( n = esk2_0
| 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_59,c_0_60]),c_0_46])]) ).
cnf(c_0_66,plain,
int_leq(int_one,esk2_0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
~ epred1_2(esk2_0,esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_55]) ).
cnf(c_0_68,negated_conjecture,
n = esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_40]),c_0_66])]),c_0_67]) ).
cnf(c_0_69,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(X2,esk2_0)
| ~ int_leq(X1,esk2_0)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_68]),c_0_68]) ).
cnf(c_0_70,negated_conjecture,
int_leq(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_71,negated_conjecture,
( epred1_2(X1,esk3_0)
| ~ int_leq(X1,esk2_0)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_46])]) ).
cnf(c_0_72,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_64]),c_0_66])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV487+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.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 : Thu Jun 16 01:46:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.68/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.68/2.49 # No SInE strategy applied
% 9.68/2.49 # Trying AutoSched0 for 150 seconds
% 9.68/2.49 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S00EN
% 9.68/2.49 # and selection function PSelectSmallestOrientable.
% 9.68/2.49 #
% 9.68/2.49 # Preprocessing time : 0.023 s
% 9.68/2.49 # Presaturation interreduction done
% 9.68/2.49
% 9.68/2.49 # Proof found!
% 9.68/2.49 # SZS status Theorem
% 9.68/2.49 # SZS output start CNFRefutation
% See solution above
% 9.68/2.49 # Training examples: 0 positive, 0 negative
% 9.68/2.49
% 9.68/2.49 # -------------------------------------------------
% 9.68/2.49 # User time : 0.118 s
% 9.68/2.49 # System time : 0.012 s
% 9.68/2.49 # Total time : 0.131 s
% 9.68/2.49 # Maximum resident set size: 7124 pages
% 9.68/2.49
%------------------------------------------------------------------------------