TSTP Solution File: NUM853+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM853+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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:37 EDT 2022

% Result   : Theorem 7.25s 2.21s
% Output   : CNFRefutation 7.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   41 (  26 unt;   7 nHn;  27 RR)
%            Number of literals    :   61 (  46 equ;  21 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
    vplus(X1,X2) != X2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_32) ).

cnf(i_0_36,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_36) ).

cnf(i_0_2,plain,
    greater(vmul(vd486,vd487),vmul(vd488,vd487)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_2) ).

cnf(i_0_8,plain,
    vmul(X1,X2) = vmul(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_8) ).

cnf(i_0_24,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_24) ).

cnf(i_0_19,plain,
    ( X1 = X2
    | greater(X1,X2)
    | less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_19) ).

cnf(i_0_33,plain,
    vplus(X1,X2) = vplus(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_33) ).

cnf(i_0_26,plain,
    ( vplus(X1,esk2_2(X1,X2)) = X2
    | ~ greater(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_26) ).

cnf(i_0_1,negated_conjecture,
    ~ greater(vd486,vd488),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_1) ).

cnf(i_0_7,plain,
    vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_7) ).

cnf(i_0_28,plain,
    ( X1 != X2
    | X2 != vplus(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tj_8end3/input.p',i_0_28) ).

cnf(i_0_27,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-tj_8end3/input.p',i_0_27) ).

cnf(c_0_49,plain,
    vplus(X1,X2) != X2,
    i_0_32 ).

cnf(c_0_50,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    i_0_36 ).

cnf(c_0_51,plain,
    greater(vmul(vd486,vd487),vmul(vd488,vd487)),
    i_0_2 ).

cnf(c_0_52,plain,
    vmul(X1,X2) = vmul(X2,X1),
    i_0_8 ).

cnf(c_0_53,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    i_0_24 ).

cnf(c_0_54,plain,
    ( X1 = X2
    | greater(X1,X2)
    | less(X1,X2) ),
    i_0_19 ).

cnf(c_0_55,plain,
    vplus(X1,vplus(X2,X3)) != X3,
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_56,plain,
    vplus(X1,X2) = vplus(X2,X1),
    i_0_33 ).

cnf(c_0_57,plain,
    ( vplus(X1,esk2_2(X1,X2)) = X2
    | ~ greater(X2,X1) ),
    i_0_26 ).

cnf(c_0_58,plain,
    greater(vmul(vd486,vd487),vmul(vd487,vd488)),
    inference(rw,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_59,negated_conjecture,
    ~ greater(vd486,vd488),
    i_0_1 ).

cnf(c_0_60,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | X1 = X2
    | greater(X1,X2) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_61,plain,
    vplus(X1,vplus(X2,X3)) != X2,
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_62,plain,
    vplus(vmul(vd487,vd488),esk2_2(vmul(vd487,vd488),vmul(vd486,vd487))) = vmul(vd486,vd487),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_63,negated_conjecture,
    ( vplus(vd486,esk1_2(vd488,vd486)) = vd488
    | vd488 = vd486 ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    vplus(X1,vmul(vd486,vd487)) != vmul(vd487,vd488),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_65,plain,
    vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
    i_0_7 ).

cnf(c_0_66,plain,
    ( vd488 = vd486
    | vplus(X1,vd488) != vd486 ),
    inference(spm,[status(thm)],[c_0_61,c_0_63]) ).

cnf(c_0_67,plain,
    ( X1 != X2
    | X2 != vplus(X1,X3) ),
    i_0_28 ).

cnf(c_0_68,plain,
    vplus(vmul(vd486,vd487),X1) != vmul(vd487,vd488),
    inference(spm,[status(thm)],[c_0_64,c_0_56]) ).

cnf(c_0_69,plain,
    vplus(vmul(X1,X2),vmul(X2,X3)) = vmul(X2,vplus(X1,X3)),
    inference(spm,[status(thm)],[c_0_65,c_0_52]) ).

cnf(c_0_70,plain,
    ( vd488 = vd486
    | vplus(vd488,X1) != vd486 ),
    inference(spm,[status(thm)],[c_0_66,c_0_56]) ).

cnf(c_0_71,plain,
    ( X1 = X2
    | vplus(X1,esk4_2(X1,X2)) = X2
    | vplus(X2,esk3_2(X1,X2)) = X1 ),
    i_0_27 ).

cnf(c_0_72,plain,
    vplus(X1,X2) != X1,
    inference(er,[status(thm)],[c_0_67]) ).

cnf(c_0_73,plain,
    vmul(vd487,vplus(vd486,X1)) != vmul(vd487,vd488),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_74,plain,
    ( vplus(vd486,esk3_2(vd488,vd486)) = vd488
    | vd488 = vd486 ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71])]) ).

cnf(c_0_75,plain,
    vmul(vd487,vd488) != vmul(vd486,vd487),
    inference(spm,[status(thm)],[c_0_72,c_0_62]) ).

cnf(c_0_76,plain,
    vd488 = vd486,
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_77,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM853+2 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n019.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 18:41:10 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.25/2.21  # ENIGMATIC: Solved by autoschedule:
% 7.25/2.21  # No SInE strategy applied
% 7.25/2.21  # Trying AutoSched0 for 150 seconds
% 7.25/2.21  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.25/2.21  # and selection function SelectCQArEqLast.
% 7.25/2.21  #
% 7.25/2.21  # Preprocessing time       : 0.012 s
% 7.25/2.21  # Presaturation interreduction done
% 7.25/2.21  
% 7.25/2.21  # Proof found!
% 7.25/2.21  # SZS status Theorem
% 7.25/2.21  # SZS output start CNFRefutation
% See solution above
% 7.25/2.21  # Training examples: 0 positive, 0 negative
% 7.25/2.21  
% 7.25/2.21  # -------------------------------------------------
% 7.25/2.21  # User time                : 0.039 s
% 7.25/2.21  # System time              : 0.011 s
% 7.25/2.21  # Total time               : 0.050 s
% 7.25/2.21  # Maximum resident set size: 7124 pages
% 7.25/2.21  
%------------------------------------------------------------------------------