TSTP Solution File: NUM840+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM840+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:29 EDT 2022
% Result : Theorem 7.30s 2.22s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 21 unt; 8 nHn; 33 RR)
% Number of literals : 69 ( 33 equ; 27 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; 3 con; 0-2 aty)
% Number of variables : 62 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
~ less(vd328,vd329),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_1) ).
cnf(i_0_23,plain,
( X1 = X2
| less(X1,X2)
| greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_23) ).
cnf(i_0_36,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_36) ).
cnf(i_0_40,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_40) ).
cnf(i_0_22,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_22) ).
cnf(i_0_37,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_37) ).
cnf(i_0_28,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_28) ).
cnf(i_0_25,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_25) ).
cnf(i_0_8,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_8) ).
cnf(i_0_31,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-kl6h4nxu/input.p',i_0_31) ).
cnf(i_0_2,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_2) ).
cnf(i_0_21,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_21) ).
cnf(i_0_26,plain,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kl6h4nxu/input.p',i_0_26) ).
cnf(c_0_54,negated_conjecture,
~ less(vd328,vd329),
i_0_1 ).
cnf(c_0_55,plain,
( X1 = X2
| less(X1,X2)
| greater(X1,X2) ),
i_0_23 ).
cnf(c_0_56,plain,
vplus(X1,X2) != X2,
i_0_36 ).
cnf(c_0_57,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_40 ).
cnf(c_0_58,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_22 ).
cnf(c_0_59,negated_conjecture,
( vd329 = vd328
| greater(vd328,vd329) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_37 ).
cnf(c_0_62,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
i_0_28 ).
cnf(c_0_63,plain,
( vd329 = vd328
| less(vd329,vd328) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_57]) ).
cnf(c_0_65,plain,
( vplus(vd329,esk1_2(vd328,vd329)) = vd328
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
i_0_25 ).
cnf(c_0_67,plain,
greater(vplus(X1,X2),X1),
i_0_8 ).
cnf(c_0_68,plain,
( vd329 = vd328
| vplus(X1,vd328) != vd329 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
~ less(vplus(X1,X2),X1),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
( vd329 = vd328
| vplus(vd328,X1) != vd329 ),
inference(spm,[status(thm)],[c_0_68,c_0_61]) ).
cnf(c_0_71,plain,
( X1 = X2
| vplus(X1,esk4_2(X1,X2)) = X2
| vplus(X2,esk3_2(X1,X2)) = X1 ),
i_0_31 ).
cnf(c_0_72,plain,
~ less(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_69,c_0_57]) ).
cnf(c_0_73,plain,
( vplus(vd329,esk3_2(vd328,vd329)) = vd328
| vd329 = vd328 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
i_0_2 ).
cnf(c_0_75,plain,
( vd329 = vd328
| ~ less(vplus(X1,vd328),vplus(X1,vd329)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
i_0_21 ).
cnf(c_0_77,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_74,c_0_61]) ).
cnf(c_0_78,plain,
( vd329 = vd328
| ~ less(vplus(vd328,X1),vplus(X1,vd329)) ),
inference(spm,[status(thm)],[c_0_75,c_0_61]) ).
cnf(c_0_79,plain,
( X1 != X2
| ~ greater(X1,X2) ),
i_0_26 ).
cnf(c_0_80,plain,
greater(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
vd329 = vd328,
inference(spm,[status(thm)],[c_0_78,c_0_77]) ).
cnf(c_0_82,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_83,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_61]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM840+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n006.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 00:12:23 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.30/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.30/2.22 # No SInE strategy applied
% 7.30/2.22 # Trying AutoSched0 for 150 seconds
% 7.30/2.22 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.30/2.22 # and selection function SelectCQArEqLast.
% 7.30/2.22 #
% 7.30/2.22 # Preprocessing time : 0.023 s
% 7.30/2.22 # Presaturation interreduction done
% 7.30/2.22
% 7.30/2.22 # Proof found!
% 7.30/2.22 # SZS status Theorem
% 7.30/2.22 # SZS output start CNFRefutation
% See solution above
% 7.30/2.22 # Training examples: 0 positive, 0 negative
% 7.30/2.22
% 7.30/2.22 # -------------------------------------------------
% 7.30/2.22 # User time : 0.054 s
% 7.30/2.22 # System time : 0.010 s
% 7.30/2.22 # Total time : 0.064 s
% 7.30/2.22 # Maximum resident set size: 7124 pages
% 7.30/2.22
%------------------------------------------------------------------------------