TSTP Solution File: NUM841+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM841+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 7.84s 2.51s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 27 unt; 3 nHn; 34 RR)
% Number of literals : 63 ( 14 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_18) ).
cnf(i_0_16,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_16) ).
cnf(i_0_14,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_14) ).
cnf(i_0_22,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_22) ).
cnf(i_0_25,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_25) ).
cnf(i_0_20,plain,
( vplus(X1,esk1_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_20) ).
cnf(i_0_3,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_3) ).
cnf(i_0_4,plain,
vplus(vd347,vd345) = vplus(vd345,vd347),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_1) ).
cnf(i_0_15,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_15) ).
cnf(i_0_17,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-itjl9z22/lgb.p',i_0_17) ).
cnf(c_0_39,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
i_0_18 ).
cnf(c_0_40,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_16 ).
cnf(c_0_41,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
greater(vplus(X1,X2),X1),
i_0_14 ).
cnf(c_0_43,plain,
~ greater(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_22 ).
cnf(c_0_45,plain,
~ greater(X1,vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_25 ).
cnf(c_0_47,plain,
~ greater(X1,vplus(X2,vplus(X3,X1))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
~ greater(X1,vplus(X2,vplus(X1,X3))),
inference(spm,[status(thm)],[c_0_47,c_0_44]) ).
cnf(c_0_49,plain,
( vplus(X1,esk1_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_20 ).
cnf(c_0_50,plain,
( ~ greater(X1,vplus(X2,X3))
| ~ greater(X3,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
( ~ greater(X1,vplus(X2,X3))
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_52,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
i_0_3 ).
cnf(c_0_53,plain,
vplus(vd347,vd345) = vplus(vd345,vd347),
i_0_4 ).
cnf(c_0_54,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
i_0_2 ).
cnf(c_0_55,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X1)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_49]) ).
cnf(c_0_56,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_57,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
i_0_5 ).
cnf(c_0_58,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
i_0_1 ).
cnf(c_0_59,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
i_0_15 ).
cnf(c_0_60,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
i_0_17 ).
cnf(c_0_61,plain,
( ~ greater(X1,vplus(vd345,vd347))
| ~ greater(vplus(vd345,vd348),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
greater(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(rw,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_63,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(rw,[status(thm)],[c_0_58,c_0_44]) ).
cnf(c_0_64,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
~ greater(vplus(vd345,vd348),vplus(vd347,vd344)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
~ greater(vplus(vd345,vd347),vplus(vd347,vd344)),
inference(spm,[status(thm)],[c_0_41,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
vplus(vd347,vd344) = vplus(vd345,vd348),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM841+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 11:16:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.84/2.51 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.84/2.51 # No SInE strategy applied
% 7.84/2.51 # Trying AutoSched0 for 150 seconds
% 7.84/2.51 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.84/2.51 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.84/2.51 #
% 7.84/2.51 # Preprocessing time : 0.023 s
% 7.84/2.51 # Presaturation interreduction done
% 7.84/2.51
% 7.84/2.51 # Proof found!
% 7.84/2.51 # SZS status Theorem
% 7.84/2.51 # SZS output start CNFRefutation
% See solution above
% 7.84/2.51 # Training examples: 0 positive, 0 negative
% 7.84/2.51
% 7.84/2.51 # -------------------------------------------------
% 7.84/2.51 # User time : 0.047 s
% 7.84/2.51 # System time : 0.005 s
% 7.84/2.51 # Total time : 0.052 s
% 7.84/2.51 # Maximum resident set size: 7124 pages
% 7.84/2.51
%------------------------------------------------------------------------------