TSTP Solution File: NUM853+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM853+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:37 EDT 2022
% Result : Theorem 10.08s 2.65s
% Output : CNFRefutation 10.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 48 ( 26 unt; 12 nHn; 33 RR)
% Number of literals : 78 ( 48 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_34) ).
cnf(i_0_41,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_41) ).
cnf(i_0_31,plain,
( geq(X1,X2)
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_31) ).
cnf(i_0_1,negated_conjecture,
~ greater(vd486,vd488),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_1) ).
cnf(i_0_54,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_54) ).
cnf(i_0_58,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_58) ).
cnf(i_0_2,plain,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_2) ).
cnf(i_0_8,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_8) ).
cnf(i_0_38,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_38) ).
cnf(i_0_55,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_55) ).
cnf(i_0_48,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_48) ).
cnf(i_0_7,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_7) ).
cnf(i_0_50,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj_thdn4/input.p',i_0_50) ).
cnf(i_0_49,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-cj_thdn4/input.p',i_0_49) ).
cnf(c_0_73,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_34 ).
cnf(c_0_74,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
i_0_41 ).
cnf(c_0_75,plain,
( geq(X1,X2)
| ~ leq(X2,X1) ),
i_0_31 ).
cnf(c_0_76,plain,
( X1 = X2
| leq(X1,X2)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
~ greater(vd486,vd488),
i_0_1 ).
cnf(c_0_78,plain,
( X1 = X2
| greater(X1,X2)
| geq(X2,X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,plain,
vplus(X1,X2) != X2,
i_0_54 ).
cnf(c_0_80,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_58 ).
cnf(c_0_81,plain,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
i_0_2 ).
cnf(c_0_82,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_8 ).
cnf(c_0_83,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
i_0_38 ).
cnf(c_0_84,negated_conjecture,
( vd488 = vd486
| geq(vd488,vd486) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_55 ).
cnf(c_0_87,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_48 ).
cnf(c_0_88,plain,
greater(vmul(vd486,vd487),vmul(vd487,vd488)),
inference(rw,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_89,plain,
( vd488 = vd486
| greater(vd488,vd486) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
vplus(vmul(vd487,vd488),esk2_2(vmul(vd487,vd488),vmul(vd486,vd487))) = vmul(vd486,vd487),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
i_0_7 ).
cnf(c_0_93,plain,
( vplus(vd486,esk2_2(vd486,vd488)) = vd488
| vd488 = vd486 ),
inference(spm,[status(thm)],[c_0_87,c_0_89]) ).
cnf(c_0_94,plain,
vplus(X1,vmul(vd486,vd487)) != vmul(vd487,vd488),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_95,plain,
vplus(vmul(X1,X2),vmul(X3,X1)) = vmul(X1,vplus(X2,X3)),
inference(spm,[status(thm)],[c_0_92,c_0_82]) ).
cnf(c_0_96,plain,
( vd488 = vd486
| vplus(X1,vd488) != vd486 ),
inference(spm,[status(thm)],[c_0_90,c_0_93]) ).
cnf(c_0_97,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
i_0_50 ).
cnf(c_0_98,plain,
vmul(vd487,vplus(X1,vd486)) != vmul(vd487,vd488),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,plain,
( vd488 = vd486
| vplus(vd488,X1) != vd486 ),
inference(spm,[status(thm)],[c_0_96,c_0_86]) ).
cnf(c_0_100,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
i_0_49 ).
cnf(c_0_101,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_102,plain,
vmul(vd487,vplus(vd486,X1)) != vmul(vd487,vd488),
inference(spm,[status(thm)],[c_0_98,c_0_86]) ).
cnf(c_0_103,plain,
( vplus(vd486,esk3_2(vd488,vd486)) = vd488
| vd488 = vd486 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100])]) ).
cnf(c_0_104,plain,
vmul(vd487,vd488) != vmul(vd486,vd487),
inference(spm,[status(thm)],[c_0_101,c_0_91]) ).
cnf(c_0_105,plain,
vd488 = vd486,
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM853+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n004.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 : Thu Jul 7 15:09:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 10.08/2.65 # ENIGMATIC: Solved by autoschedule:
% 10.08/2.65 # No SInE strategy applied
% 10.08/2.65 # Trying AutoSched0 for 150 seconds
% 10.08/2.65 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 10.08/2.65 # and selection function SelectCQArEqLast.
% 10.08/2.65 #
% 10.08/2.65 # Preprocessing time : 0.023 s
% 10.08/2.65 # Presaturation interreduction done
% 10.08/2.65
% 10.08/2.65 # Proof found!
% 10.08/2.65 # SZS status Theorem
% 10.08/2.65 # SZS output start CNFRefutation
% See solution above
% 10.08/2.65 # Training examples: 0 positive, 0 negative
% 10.08/2.65
% 10.08/2.65 # -------------------------------------------------
% 10.08/2.65 # User time : 0.435 s
% 10.08/2.65 # System time : 0.017 s
% 10.08/2.65 # Total time : 0.452 s
% 10.08/2.65 # Maximum resident set size: 7120 pages
% 10.08/2.65
%------------------------------------------------------------------------------