TSTP Solution File: NUM855+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM855+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:38 EDT 2022
% Result : Theorem 4.55s 2.28s
% Output : CNFRefutation 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 29 unt; 3 nHn; 34 RR)
% Number of literals : 65 ( 16 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_51) ).
cnf(i_0_48,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_48) ).
cnf(i_0_34,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_34) ).
cnf(i_0_63,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_63) ).
cnf(i_0_66,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_66) ).
cnf(i_0_56,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_56) ).
cnf(i_0_3,plain,
greater(vmul(vd511,vd509),vmul(vd512,vd509)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_3) ).
cnf(i_0_4,plain,
vmul(vd511,vd509) = vmul(vd509,vd511),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
vmul(vd512,vd509) = vmul(vd509,vd512),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_5) ).
cnf(i_0_16,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_16) ).
cnf(i_0_1,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_1) ).
cnf(i_0_47,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_47) ).
cnf(i_0_49,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jer2mwlj/lgb.p',i_0_49) ).
cnf(c_0_81,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
i_0_51 ).
cnf(c_0_82,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_48 ).
cnf(c_0_83,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,plain,
greater(vplus(X1,X2),X1),
i_0_34 ).
cnf(c_0_85,plain,
~ greater(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_86,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_63 ).
cnf(c_0_87,plain,
~ greater(X1,vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_66 ).
cnf(c_0_89,plain,
~ greater(X1,vplus(X2,vplus(X3,X1))),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_90,plain,
~ greater(X1,vplus(X2,vplus(X1,X3))),
inference(spm,[status(thm)],[c_0_89,c_0_86]) ).
cnf(c_0_91,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_56 ).
cnf(c_0_92,plain,
( ~ greater(X1,vplus(X2,X3))
| ~ greater(X3,X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_93,plain,
( ~ greater(X1,vplus(X2,X3))
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_86]) ).
cnf(c_0_94,plain,
greater(vmul(vd511,vd509),vmul(vd512,vd509)),
i_0_3 ).
cnf(c_0_95,plain,
vmul(vd511,vd509) = vmul(vd509,vd511),
i_0_4 ).
cnf(c_0_96,plain,
vmul(vd512,vd509) = vmul(vd509,vd512),
i_0_2 ).
cnf(c_0_97,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X1)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_93,c_0_91]) ).
cnf(c_0_98,plain,
greater(vmul(vd509,vd511),vmul(vd509,vd512)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_99,plain,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
i_0_5 ).
cnf(c_0_100,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_16 ).
cnf(c_0_101,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
i_0_1 ).
cnf(c_0_102,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
i_0_47 ).
cnf(c_0_103,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
i_0_49 ).
cnf(c_0_104,plain,
( ~ greater(X1,vmul(vd509,vd511))
| ~ greater(vmul(vd509,vd512),X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_105,plain,
greater(vmul(vd511,vd508),vmul(vd509,vd511)),
inference(rw,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_106,negated_conjecture,
~ greater(vmul(vd511,vd508),vmul(vd509,vd512)),
inference(rw,[status(thm)],[c_0_101,c_0_100]) ).
cnf(c_0_107,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,plain,
~ greater(vmul(vd509,vd512),vmul(vd511,vd508)),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_109,plain,
~ greater(vmul(vd509,vd511),vmul(vd511,vd508)),
inference(spm,[status(thm)],[c_0_83,c_0_105]) ).
cnf(c_0_110,negated_conjecture,
vmul(vd511,vd508) = vmul(vd509,vd512),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]) ).
cnf(c_0_111,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_98])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM855+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 02:54:54 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.55/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.55/2.28 # No SInE strategy applied
% 4.55/2.28 # Trying AutoSched0 for 150 seconds
% 4.55/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.55/2.28 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.55/2.28 #
% 4.55/2.28 # Preprocessing time : 0.024 s
% 4.55/2.28 # Presaturation interreduction done
% 4.55/2.28
% 4.55/2.28 # Proof found!
% 4.55/2.28 # SZS status Theorem
% 4.55/2.28 # SZS output start CNFRefutation
% See solution above
% 4.55/2.28 # Training examples: 0 positive, 0 negative
% 4.55/2.28
% 4.55/2.28 # -------------------------------------------------
% 4.55/2.28 # User time : 0.072 s
% 4.55/2.28 # System time : 0.007 s
% 4.55/2.28 # Total time : 0.079 s
% 4.55/2.28 # Maximum resident set size: 7128 pages
% 4.55/2.28
%------------------------------------------------------------------------------