TSTP Solution File: NUM842+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:30 EDT 2022
% Result : Theorem 10.82s 2.66s
% Output : CNFRefutation 10.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 61 ( 22 unt; 24 nHn; 45 RR)
% Number of literals : 109 ( 53 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 90 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_27,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_27) ).
cnf(i_0_13,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_13) ).
cnf(i_0_30,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_30) ).
cnf(i_0_45,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_45) ).
cnf(i_0_36,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_36) ).
cnf(i_0_25,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_25) ).
cnf(i_0_2,plain,
( greater(vd353,vd354)
| geq(vd353,vd354) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_2) ).
cnf(i_0_40,plain,
( X1 = X2
| vplus(X3,X1) != vplus(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_40) ).
cnf(i_0_38,plain,
( X1 != vplus(X2,X3)
| X2 != vplus(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_38) ).
cnf(i_0_41,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_41) ).
cnf(i_0_42,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_42) ).
cnf(i_0_5,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_5) ).
cnf(i_0_35,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_35) ).
cnf(i_0_6,plain,
( greater(vplus(X1,X2),vplus(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_6) ).
cnf(i_0_4,plain,
( greater(vd353,vd354)
| greater(vd355,vd356) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_1) ).
cnf(i_0_31,plain,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-txb3dzz5/input.p',i_0_31) ).
cnf(c_0_63,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_27 ).
cnf(c_0_64,plain,
greater(vplus(X1,X2),X1),
i_0_13 ).
cnf(c_0_65,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
i_0_30 ).
cnf(c_0_66,plain,
less(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_45 ).
cnf(c_0_68,plain,
~ greater(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
i_0_36 ).
cnf(c_0_70,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
i_0_25 ).
cnf(c_0_71,plain,
( greater(vd353,vd354)
| geq(vd353,vd354) ),
i_0_2 ).
cnf(c_0_72,plain,
( X1 = X2
| vplus(X3,X1) != vplus(X3,X2) ),
i_0_40 ).
cnf(c_0_73,plain,
( X1 != vplus(X2,X3)
| X2 != vplus(X1,X4) ),
i_0_38 ).
cnf(c_0_74,plain,
vplus(X1,X2) != X2,
i_0_41 ).
cnf(c_0_75,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_42 ).
cnf(c_0_76,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
i_0_5 ).
cnf(c_0_77,plain,
greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_64,c_0_67]) ).
cnf(c_0_78,plain,
( vplus(X1,esk3_2(X2,X1)) = X2
| X2 = X1
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,plain,
( vd354 = vd353
| greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_80,plain,
( esk4_2(X1,X2) = X3
| X1 = X2
| X2 != vplus(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_69]),c_0_73]) ).
cnf(c_0_81,plain,
vplus(X1,X2) != X1,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_35 ).
cnf(c_0_83,plain,
( vd356 = vd355
| greater(vd355,vd356) ),
inference(spm,[status(thm)],[c_0_70,c_0_76]) ).
cnf(c_0_84,plain,
( greater(vplus(X1,X2),vplus(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
i_0_6 ).
cnf(c_0_85,plain,
greater(vplus(X1,vplus(X2,X3)),vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_77,c_0_75]) ).
cnf(c_0_86,plain,
( vplus(vd354,esk3_2(vd353,vd354)) = vd353
| vd354 = vd353 ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_87,plain,
esk4_2(X1,vplus(X1,X2)) = X2,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_80]),c_0_81]) ).
cnf(c_0_88,plain,
( vplus(vd356,esk2_2(vd356,vd355)) = vd355
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( greater(vd353,vd354)
| greater(vd355,vd356) ),
i_0_4 ).
cnf(c_0_90,plain,
( vd356 = vd355
| greater(vplus(X1,vd355),vplus(X2,vd356))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
i_0_1 ).
cnf(c_0_92,plain,
( vd354 = vd353
| greater(vplus(X1,vd353),vplus(vd354,X1)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,plain,
( esk2_2(vd356,vd355) = esk4_2(vd356,vd355)
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,plain,
( vplus(vd356,esk2_2(vd356,vd355)) = vd355
| greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_82,c_0_89]) ).
cnf(c_0_95,plain,
( vd354 = vd353
| vd356 = vd355 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_79]),c_0_91]) ).
cnf(c_0_96,plain,
( vd354 = vd353
| greater(vplus(vd353,X1),vplus(vd354,X1)) ),
inference(spm,[status(thm)],[c_0_92,c_0_75]) ).
cnf(c_0_97,plain,
( X1 != X2
| ~ greater(X1,X2) ),
i_0_31 ).
cnf(c_0_98,plain,
( vplus(vd356,esk4_2(vd356,vd355)) = vd355
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_88,c_0_93]) ).
cnf(c_0_99,plain,
( greater(vd353,vd354)
| vd356 != vd355 ),
inference(spm,[status(thm)],[c_0_81,c_0_94]) ).
cnf(c_0_100,negated_conjecture,
vd354 = vd353,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_95]),c_0_96]) ).
cnf(c_0_101,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_102,plain,
( vd356 = vd355
| greater(vplus(X1,vd355),vplus(X1,vd356)) ),
inference(spm,[status(thm)],[c_0_77,c_0_98]) ).
cnf(c_0_103,plain,
vd356 != vd355,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100]),c_0_101]) ).
cnf(c_0_104,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd353,vd356)),
inference(rw,[status(thm)],[c_0_91,c_0_100]) ).
cnf(c_0_105,plain,
greater(vplus(X1,vd355),vplus(X1,vd356)),
inference(sr,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jul 5 03:58:43 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 10.82/2.66 # ENIGMATIC: Solved by autoschedule:
% 10.82/2.66 # No SInE strategy applied
% 10.82/2.66 # Trying AutoSched0 for 150 seconds
% 10.82/2.66 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 10.82/2.66 # and selection function SelectNewComplexAHP.
% 10.82/2.66 #
% 10.82/2.66 # Preprocessing time : 0.024 s
% 10.82/2.66
% 10.82/2.66 # Proof found!
% 10.82/2.66 # SZS status Theorem
% 10.82/2.66 # SZS output start CNFRefutation
% See solution above
% 10.82/2.66 # Training examples: 0 positive, 0 negative
% 10.82/2.66
% 10.82/2.66 # -------------------------------------------------
% 10.82/2.66 # User time : 0.556 s
% 10.82/2.66 # System time : 0.027 s
% 10.82/2.66 # Total time : 0.583 s
% 10.82/2.66 # Maximum resident set size: 7124 pages
% 10.82/2.66
%------------------------------------------------------------------------------