TSTP Solution File: NUM842+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM842+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 11.18s 2.85s
% Output : CNFRefutation 11.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 13 unt; 11 nHn; 30 RR)
% Number of literals : 67 ( 15 equ; 26 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_1) ).
cnf(i_0_6,plain,
( greater(vplus(X1,X2),vplus(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_6) ).
cnf(i_0_25,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_25) ).
cnf(i_0_5,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_5) ).
cnf(i_0_2,plain,
( greater(vd353,vd354)
| geq(vd353,vd354) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_2) ).
cnf(i_0_12,plain,
( greater(vplus(X1,X2),vplus(X3,X2))
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_12) ).
cnf(i_0_13,plain,
greater(vplus(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_13) ).
cnf(i_0_45,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_45) ).
cnf(i_0_33,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_33) ).
cnf(i_0_31,plain,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_31) ).
cnf(i_0_4,plain,
( greater(vd353,vd354)
| greater(vd355,vd356) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_4) ).
cnf(i_0_27,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ey9xliyy/lgb.p',i_0_27) ).
cnf(c_0_58,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
i_0_1 ).
cnf(c_0_59,plain,
( greater(vplus(X1,X2),vplus(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
i_0_6 ).
cnf(c_0_60,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
i_0_25 ).
cnf(c_0_61,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
i_0_5 ).
cnf(c_0_62,negated_conjecture,
( ~ greater(vd355,vd356)
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( vd356 = vd355
| greater(vd355,vd356) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( greater(vd353,vd354)
| geq(vd353,vd354) ),
i_0_2 ).
cnf(c_0_65,negated_conjecture,
( vd356 = vd355
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( vd354 = vd353
| greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_60,c_0_64]) ).
cnf(c_0_67,plain,
( vd354 = vd353
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( vd354 = vd353
| ~ greater(vplus(vd353,vd355),vplus(vd354,vd355)) ),
inference(spm,[status(thm)],[c_0_58,c_0_67]) ).
cnf(c_0_69,plain,
( greater(vplus(X1,X2),vplus(X3,X2))
| ~ greater(X1,X3) ),
i_0_12 ).
cnf(c_0_70,plain,
greater(vplus(X1,X2),X1),
i_0_13 ).
cnf(c_0_71,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_45 ).
cnf(c_0_72,plain,
vd354 = vd353,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_66]) ).
cnf(c_0_73,plain,
greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
i_0_33 ).
cnf(c_0_75,plain,
( X1 != X2
| ~ greater(X1,X2) ),
i_0_31 ).
cnf(c_0_76,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd353,vd356)),
inference(rw,[status(thm)],[c_0_58,c_0_72]) ).
cnf(c_0_77,plain,
( greater(vplus(X1,X2),vplus(X1,X3))
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,plain,
( greater(vd353,vd354)
| greater(vd355,vd356) ),
i_0_4 ).
cnf(c_0_79,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_80,negated_conjecture,
~ less(vd356,vd355),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
i_0_27 ).
cnf(c_0_82,plain,
greater(vd355,vd356),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_72]),c_0_79]) ).
cnf(c_0_83,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM842+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 19:09:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 11.18/2.85 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.18/2.85 # No SInE strategy applied
% 11.18/2.85 # Trying AutoSched0 for 150 seconds
% 11.18/2.85 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S0Y
% 11.18/2.85 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.18/2.85 #
% 11.18/2.85 # Preprocessing time : 0.024 s
% 11.18/2.85
% 11.18/2.85 # Proof found!
% 11.18/2.85 # SZS status Theorem
% 11.18/2.85 # SZS output start CNFRefutation
% See solution above
% 11.18/2.85 # Training examples: 0 positive, 0 negative
% 11.18/2.85
% 11.18/2.85 # -------------------------------------------------
% 11.18/2.85 # User time : 0.534 s
% 11.18/2.85 # System time : 0.023 s
% 11.18/2.85 # Total time : 0.557 s
% 11.18/2.85 # Maximum resident set size: 7120 pages
% 11.18/2.85
%------------------------------------------------------------------------------