TSTP Solution File: NUM835+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM835+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:26 EDT 2022
% Result : Theorem 8.20s 2.54s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 8 unt; 3 nHn; 9 RR)
% Number of literals : 23 ( 17 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( m(X1)
| X2 != X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6__y_sd/input.p',i_0_21) ).
cnf(i_0_22,plain,
( X1 = X2
| vplus(X1,esk1_2(X2,X1)) = X2
| vplus(X2,esk2_2(X2,X1)) = X1
| ~ m(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6__y_sd/input.p',i_0_22) ).
cnf(i_0_2,negated_conjecture,
vplus(vd165,X1) != vd151,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6__y_sd/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
vplus(vd151,X1) != vd165,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6__y_sd/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
vd151 != vd165,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6__y_sd/input.p',i_0_1) ).
cnf(c_0_28,plain,
( m(X1)
| X2 != X1 ),
i_0_21 ).
cnf(c_0_29,plain,
( X1 = X2
| vplus(X1,esk1_2(X2,X1)) = X2
| vplus(X2,esk2_2(X2,X1)) = X1
| ~ m(X1) ),
i_0_22 ).
cnf(c_0_30,plain,
m(X1),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
vplus(vd165,X1) != vd151,
i_0_2 ).
cnf(c_0_32,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| vplus(X2,esk2_2(X2,X1)) = X1
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
vplus(vd151,X1) != vd165,
i_0_3 ).
cnf(c_0_34,negated_conjecture,
vd151 != vd165,
i_0_1 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32])]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM835+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 07:46:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected complete mode:
% 8.20/2.54 # ENIGMATIC: Solved by autoschedule:
% 8.20/2.54 # No SInE strategy applied
% 8.20/2.54 # Trying AutoSched0 for 150 seconds
% 8.20/2.54 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S015I
% 8.20/2.54 # and selection function PSelectOptimalLit.
% 8.20/2.54 #
% 8.20/2.54 # Preprocessing time : 0.024 s
% 8.20/2.54 # Presaturation interreduction done
% 8.20/2.54
% 8.20/2.54 # Proof found!
% 8.20/2.54 # SZS status Theorem
% 8.20/2.54 # SZS output start CNFRefutation
% See solution above
% 8.20/2.54 # Training examples: 0 positive, 0 negative
% 8.20/2.54
% 8.20/2.54 # -------------------------------------------------
% 8.20/2.54 # User time : 0.025 s
% 8.20/2.54 # System time : 0.010 s
% 8.20/2.54 # Total time : 0.035 s
% 8.20/2.54 # Maximum resident set size: 7120 pages
% 8.20/2.54
%------------------------------------------------------------------------------