TSTP Solution File: NUM857+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM857+2 : 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:40 EDT 2022
% Result : Theorem 10.43s 2.69s
% Output : CNFRefutation 10.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 25 unt; 11 nHn; 35 RR)
% Number of literals : 79 ( 37 equ; 24 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 73 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_45) ).
cnf(i_0_2,plain,
geq(vd529,vd530),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_2) ).
cnf(i_0_61,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_61) ).
cnf(i_0_65,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_65) ).
cnf(i_0_47,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_47) ).
cnf(i_0_62,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_62) ).
cnf(i_0_53,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_53) ).
cnf(i_0_4,plain,
( greater(vmul(X1,X2),vmul(X3,X4))
| ~ geq(X2,X4)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_4) ).
cnf(i_0_3,plain,
geq(vd526,vd527),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_3) ).
cnf(i_0_44,plain,
( geq(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_44) ).
cnf(i_0_33,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_33) ).
cnf(i_0_1,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_1) ).
cnf(i_0_14,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_14) ).
cnf(i_0_56,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-gbe41djh/input.p',i_0_56) ).
cnf(i_0_43,plain,
( geq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gbe41djh/input.p',i_0_43) ).
cnf(c_0_81,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
i_0_45 ).
cnf(c_0_82,plain,
geq(vd529,vd530),
i_0_2 ).
cnf(c_0_83,plain,
vplus(X1,X2) != X2,
i_0_61 ).
cnf(c_0_84,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_65 ).
cnf(c_0_85,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_47 ).
cnf(c_0_86,plain,
( vd530 = vd529
| greater(vd529,vd530) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_62 ).
cnf(c_0_89,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
i_0_53 ).
cnf(c_0_90,plain,
( vd530 = vd529
| less(vd530,vd529) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( greater(vmul(X1,X2),vmul(X3,X4))
| ~ geq(X2,X4)
| ~ greater(X1,X3) ),
i_0_4 ).
cnf(c_0_92,plain,
geq(vd526,vd527),
i_0_3 ).
cnf(c_0_93,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,plain,
( vplus(vd530,esk1_2(vd529,vd530)) = vd529
| vd530 = vd529 ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,plain,
( greater(vmul(X1,vd529),vmul(X2,vd530))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_82]) ).
cnf(c_0_96,plain,
( vd527 = vd526
| greater(vd526,vd527) ),
inference(spm,[status(thm)],[c_0_81,c_0_92]) ).
cnf(c_0_97,plain,
( geq(X1,X2)
| ~ greater(X1,X2) ),
i_0_44 ).
cnf(c_0_98,plain,
greater(vplus(X1,X2),X1),
i_0_33 ).
cnf(c_0_99,plain,
( vd530 = vd529
| vplus(X1,vd529) != vd530 ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_100,plain,
( vd527 = vd526
| greater(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
i_0_1 ).
cnf(c_0_102,plain,
geq(vplus(X1,X2),X1),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_103,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
i_0_14 ).
cnf(c_0_104,plain,
( vd530 = vd529
| vplus(vd529,X1) != vd530 ),
inference(spm,[status(thm)],[c_0_99,c_0_88]) ).
cnf(c_0_105,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
i_0_56 ).
cnf(c_0_106,plain,
vd527 = vd526,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_100]),c_0_101]) ).
cnf(c_0_107,plain,
geq(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,plain,
( vplus(vd530,esk3_2(vd529,vd530)) = vd529
| vd530 = vd529 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_109,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd526,vd530)),
inference(rw,[status(thm)],[c_0_101,c_0_106]) ).
cnf(c_0_110,plain,
( vd530 = vd529
| geq(vmul(X1,vd529),vmul(X1,vd530)) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,plain,
( geq(X1,X2)
| X1 != X2 ),
i_0_43 ).
cnf(c_0_112,plain,
vd530 = vd529,
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_113,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_111]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_112]),c_0_113])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM857+2 : TPTP v8.1.0. Released v4.1.0.
% 0.12/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 : Wed Jul 6 14:28:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 10.43/2.69 # ENIGMATIC: Solved by autoschedule:
% 10.43/2.69 # No SInE strategy applied
% 10.43/2.69 # Trying AutoSched0 for 150 seconds
% 10.43/2.69 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 10.43/2.69 # and selection function SelectCQArEqLast.
% 10.43/2.69 #
% 10.43/2.69 # Preprocessing time : 0.014 s
% 10.43/2.69 # Presaturation interreduction done
% 10.43/2.69
% 10.43/2.69 # Proof found!
% 10.43/2.69 # SZS status Theorem
% 10.43/2.69 # SZS output start CNFRefutation
% See solution above
% 10.43/2.69 # Training examples: 0 positive, 0 negative
% 10.43/2.69
% 10.43/2.69 # -------------------------------------------------
% 10.43/2.69 # User time : 0.392 s
% 10.43/2.69 # System time : 0.021 s
% 10.43/2.69 # Total time : 0.413 s
% 10.43/2.69 # Maximum resident set size: 7120 pages
% 10.43/2.69
%------------------------------------------------------------------------------