↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM836+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n009.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:27 EDT 2022

% Result   : Theorem 6.28s 2.10s
% Output   : CNFRefutation 6.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   32 (  22 unt;   2 nHn;  25 RR)
%            Number of literals    :   44 (  35 equ;  12 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    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   38 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( X1 != X2
    | X2 != vplus(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_9) ).

cnf(i_0_12,plain,
    ( X1 = X2
    | vplus(X3,X1) != vplus(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_12) ).

cnf(i_0_8,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-8ty649vy/lgb.p',i_0_8) ).

cnf(i_0_13,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_13) ).

cnf(i_0_7,plain,
    ( vplus(X1,esk2_2(X1,X2)) = X2
    | ~ greater(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_7) ).

cnf(i_0_2,negated_conjecture,
    greater(vd203,vd204),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_2) ).

cnf(i_0_5,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_5) ).

cnf(i_0_1,negated_conjecture,
    less(vd203,vd204),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ty649vy/lgb.p',i_0_1) ).

cnf(c_0_22,plain,
    ( X1 != X2
    | X2 != vplus(X1,X3) ),
    i_0_9 ).

cnf(c_0_23,plain,
    ( X1 = X2
    | vplus(X3,X1) != vplus(X3,X2) ),
    i_0_12 ).

cnf(c_0_24,plain,
    ( X1 = X2
    | vplus(X1,esk4_2(X1,X2)) = X2
    | vplus(X2,esk3_2(X1,X2)) = X1 ),
    i_0_8 ).

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

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

cnf(c_0_27,plain,
    ( vplus(X1,esk2_2(X1,X2)) = X2
    | ~ greater(X2,X1) ),
    i_0_7 ).

cnf(c_0_28,negated_conjecture,
    greater(vd203,vd204),
    i_0_2 ).

cnf(c_0_29,plain,
    esk4_2(X1,vplus(X1,X2)) = X2,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25]),c_0_26]),c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    vplus(vd204,esk2_2(vd204,vd203)) = vd203,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    i_0_5 ).

cnf(c_0_32,negated_conjecture,
    less(vd203,vd204),
    i_0_1 ).

cnf(c_0_33,negated_conjecture,
    esk2_2(vd204,vd203) = esk4_2(vd204,vd203),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    vplus(vd203,esk1_2(vd204,vd203)) = vd204,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,plain,
    esk3_2(vplus(X1,X2),X1) = X2,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25]),c_0_26]),c_0_26]) ).

cnf(c_0_36,negated_conjecture,
    vplus(vd204,esk4_2(vd204,vd203)) = vd203,
    inference(rw,[status(thm)],[c_0_30,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    esk1_2(vd204,vd203) = esk4_2(vd203,vd204),
    inference(spm,[status(thm)],[c_0_29,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    esk4_2(vd204,vd203) = esk3_2(vd203,vd204),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    vplus(vd203,esk4_2(vd203,vd204)) = vd204,
    inference(rw,[status(thm)],[c_0_34,c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    vplus(vd204,esk3_2(vd203,vd204)) = vd203,
    inference(rw,[status(thm)],[c_0_36,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    esk4_2(vd203,vd204) = esk3_2(vd204,vd203),
    inference(spm,[status(thm)],[c_0_35,c_0_39]) ).

cnf(c_0_42,plain,
    vplus(vd204,vplus(esk3_2(vd203,vd204),X1)) = vplus(vd203,X1),
    inference(spm,[status(thm)],[c_0_25,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    vplus(vd203,esk3_2(vd204,vd203)) = vd204,
    inference(rw,[status(thm)],[c_0_39,c_0_41]) ).

cnf(c_0_44,plain,
    vplus(vd203,X1) != vd204,
    inference(spm,[status(thm)],[c_0_26,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_43,c_0_44]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM836+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n009.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 12:28:24 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 6.28/2.10  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.28/2.10  # No SInE strategy applied
% 6.28/2.10  # Trying AutoSched0 for 150 seconds
% 6.28/2.10  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S039I
% 6.28/2.10  # and selection function PSelectUnlessUniqMaxPos.
% 6.28/2.10  #
% 6.28/2.10  # Preprocessing time       : 0.012 s
% 6.28/2.10  # Presaturation interreduction done
% 6.28/2.10  
% 6.28/2.10  # Proof found!
% 6.28/2.10  # SZS status Theorem
% 6.28/2.10  # SZS output start CNFRefutation
% See solution above
% 6.28/2.11  # Training examples: 0 positive, 0 negative
% 6.28/2.11  
% 6.28/2.11  # -------------------------------------------------
% 6.28/2.11  # User time                : 0.014 s
% 6.28/2.11  # System time              : 0.005 s
% 6.28/2.11  # Total time               : 0.019 s
% 6.28/2.11  # Maximum resident set size: 7124 pages
% 6.28/2.11  
%------------------------------------------------------------------------------