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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM844+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:31 EDT 2022

% Result   : Theorem 7.56s 2.36s
% Output   : CNFRefutation 7.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   9 unt;   0 nHn;   3 RR)
%            Number of literals    :    9 (   8 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    vplus(X1,X2) = vplus(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mwjz0djk/lgb.p',i_0_14) ).

cnf(i_0_17,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mwjz0djk/lgb.p',i_0_17) ).

cnf(i_0_1,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vplus(vd411,v1),vd413)) != vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mwjz0djk/lgb.p',i_0_1) ).

cnf(c_0_21,plain,
    vplus(X1,X2) = vplus(X2,X1),
    i_0_14 ).

cnf(c_0_22,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    i_0_17 ).

cnf(c_0_23,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vplus(vd411,v1),vd413)) != vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1))),
    i_0_1 ).

cnf(c_0_24,plain,
    vplus(X1,X2) = vplus(X2,X1),
    c_0_21 ).

cnf(c_0_25,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    c_0_22 ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[c_0_23,c_0_24,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM844+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.33  % CPULimit : 300
% 0.19/0.33  % WCLimit  : 600
% 0.19/0.34  % DateTime : Tue Jul  5 04:51:16 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.56/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.56/2.36  # No SInE strategy applied
% 7.56/2.36  # Trying AutoSched0 for 150 seconds
% 7.56/2.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.56/2.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.56/2.36  #
% 7.56/2.36  # Preprocessing time       : 0.012 s
% 7.56/2.36  # Presaturation interreduction done
% 7.56/2.36  
% 7.56/2.36  # Proof found!
% 7.56/2.36  # SZS status Theorem
% 7.56/2.36  # SZS output start CNFRefutation
% See solution above
% 7.56/2.36  # Training examples: 0 positive, 0 negative
% 7.56/2.36  
% 7.56/2.36  # -------------------------------------------------
% 7.56/2.36  # User time                : 0.013 s
% 7.56/2.36  # System time              : 0.005 s
% 7.56/2.36  # Total time               : 0.018 s
% 7.56/2.36  # Maximum resident set size: 7124 pages
% 7.56/2.36  
%------------------------------------------------------------------------------