TSTP Solution File: NUM839+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Mon Jul 18 08:40:28 EDT 2022
% Result : Theorem 7.90s 2.60s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 26 unt; 7 nHn; 34 RR)
% Number of literals : 70 ( 40 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_23) ).
cnf(i_0_6,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_6) ).
cnf(i_0_34,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_34) ).
cnf(i_0_38,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_38) ).
cnf(i_0_26,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_26) ).
cnf(i_0_21,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_21) ).
cnf(i_0_30,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_30) ).
cnf(i_0_35,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_35) ).
cnf(i_0_1,negated_conjecture,
~ greater(vd328,vd329),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_1) ).
cnf(i_0_2,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_2) ).
cnf(i_0_28,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_28) ).
cnf(i_0_29,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_29) ).
cnf(i_0_20,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jqgdvi19/input.p',i_0_20) ).
cnf(c_0_52,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
i_0_23 ).
cnf(c_0_53,plain,
greater(vplus(X1,X2),X1),
i_0_6 ).
cnf(c_0_54,plain,
vplus(X1,X2) != X2,
i_0_34 ).
cnf(c_0_55,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_38 ).
cnf(c_0_56,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
i_0_26 ).
cnf(c_0_57,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
i_0_21 ).
cnf(c_0_58,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
i_0_30 ).
cnf(c_0_59,plain,
~ less(vplus(X1,X2),X1),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_35 ).
cnf(c_0_62,negated_conjecture,
~ greater(vd328,vd329),
i_0_1 ).
cnf(c_0_63,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| X1 = X2
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_65,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
i_0_2 ).
cnf(c_0_66,plain,
~ less(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_59,c_0_55]) ).
cnf(c_0_67,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( vplus(vd328,esk1_2(vd329,vd328)) = vd329
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_64,c_0_55]) ).
cnf(c_0_70,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_28 ).
cnf(c_0_71,plain,
greater(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_65,c_0_61]) ).
cnf(c_0_72,plain,
~ less(vplus(X1,vplus(X2,X3)),vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_66,c_0_61]) ).
cnf(c_0_73,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
i_0_29 ).
cnf(c_0_74,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_20 ).
cnf(c_0_75,plain,
( vd329 = vd328
| vplus(X1,vd329) != vd328 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,plain,
vplus(X1,vplus(X2,vplus(X3,X4))) != vplus(X1,vplus(X2,X3)),
inference(spm,[status(thm)],[c_0_69,c_0_55]) ).
cnf(c_0_77,plain,
vplus(vd330,vplus(vd329,esk2_2(vplus(vd330,vd329),vplus(vd328,vd330)))) = vplus(vd328,vd330),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_55]) ).
cnf(c_0_78,plain,
( vplus(X1,esk3_2(X2,X1)) = X2
| X2 = X1
| ~ less(vplus(X3,X1),vplus(X2,X3)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,plain,
less(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_74,c_0_71]) ).
cnf(c_0_80,plain,
( vd329 = vd328
| vplus(vd329,X1) != vd328 ),
inference(spm,[status(thm)],[c_0_75,c_0_61]) ).
cnf(c_0_81,plain,
vplus(X1,vplus(vd330,vd329)) != vplus(X1,vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
vd329 = vd328,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_83,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.28 % Computer : n021.cluster.edu
% 0.07/0.28 % Model : x86_64 x86_64
% 0.07/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.28 % Memory : 8042.1875MB
% 0.07/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.28 % CPULimit : 300
% 0.07/0.28 % WCLimit : 600
% 0.07/0.28 % DateTime : Wed Jul 6 08:50:20 EDT 2022
% 0.07/0.28 % CPUTime :
% 0.12/0.37 # ENIGMATIC: Selected complete mode:
% 7.90/2.60 # ENIGMATIC: Solved by autoschedule:
% 7.90/2.60 # No SInE strategy applied
% 7.90/2.60 # Trying AutoSched0 for 150 seconds
% 7.90/2.60 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.90/2.60 # and selection function SelectCQArEqLast.
% 7.90/2.60 #
% 7.90/2.60 # Preprocessing time : 0.020 s
% 7.90/2.60 # Presaturation interreduction done
% 7.90/2.60
% 7.90/2.60 # Proof found!
% 7.90/2.60 # SZS status Theorem
% 7.90/2.60 # SZS output start CNFRefutation
% See solution above
% 7.90/2.60 # Training examples: 0 positive, 0 negative
% 7.90/2.60
% 7.90/2.60 # -------------------------------------------------
% 7.90/2.60 # User time : 0.148 s
% 7.90/2.60 # System time : 0.009 s
% 7.90/2.60 # Total time : 0.157 s
% 7.90/2.60 # Maximum resident set size: 7120 pages
% 7.90/2.60
%------------------------------------------------------------------------------