TSTP Solution File: GRP001+6 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n026.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 : Sat Jul 16 08:37:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,X2,X5)
    | ~ product(X6,X5,X3)
    | ~ product(X6,X4,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_8) ).

cnf(i_0_7,negated_conjecture,
    product(X1,esk1_0,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_7) ).

cnf(i_0_3,negated_conjecture,
    product(X1,X1,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_3) ).

cnf(i_0_2,negated_conjecture,
    product(esk3_0,esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_2) ).

cnf(i_0_9,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,X5,X3)
    | ~ product(X6,X5,X2)
    | ~ product(X1,X6,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_9) ).

cnf(i_0_6,negated_conjecture,
    product(esk1_0,X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_6) ).

cnf(i_0_1,negated_conjecture,
    ~ product(esk4_0,esk3_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwabwovj/input.p',i_0_1) ).

cnf(c_0_17,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,X2,X5)
    | ~ product(X6,X5,X3)
    | ~ product(X6,X4,X1) ),
    i_0_8 ).

cnf(c_0_18,negated_conjecture,
    product(X1,esk1_0,X1),
    i_0_7 ).

cnf(c_0_19,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,X2,esk1_0)
    | ~ product(X3,X4,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    product(X1,X1,esk1_0),
    i_0_3 ).

cnf(c_0_21,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    product(esk3_0,esk4_0,esk5_0),
    i_0_2 ).

cnf(c_0_23,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,X5,X3)
    | ~ product(X6,X5,X2)
    | ~ product(X1,X6,X4) ),
    i_0_9 ).

cnf(c_0_24,negated_conjecture,
    product(esk5_0,esk4_0,esk3_0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ( product(X1,esk3_0,X2)
    | ~ product(X3,esk4_0,X2)
    | ~ product(X1,esk5_0,X3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,negated_conjecture,
    product(esk1_0,X1,X1),
    i_0_6 ).

cnf(c_0_27,negated_conjecture,
    ( product(X1,esk3_0,esk4_0)
    | ~ product(X1,esk5_0,esk1_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    product(esk5_0,esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_27,c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    ~ product(esk4_0,esk3_0,esk5_0),
    i_0_1 ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP001+6 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 : Mon Jun 13 14:55:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.76/2.27  # ENIGMATIC: Solved by autoschedule:
% 7.76/2.27  # No SInE strategy applied
% 7.76/2.27  # Trying AutoSched0 for 150 seconds
% 7.76/2.27  # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.76/2.27  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.27  #
% 7.76/2.27  # Preprocessing time       : 0.012 s
% 7.76/2.27  
% 7.76/2.27  # Proof found!
% 7.76/2.27  # SZS status Theorem
% 7.76/2.27  # SZS output start CNFRefutation
% See solution above
% 7.76/2.27  # Training examples: 0 positive, 0 negative
% 7.76/2.27  
% 7.76/2.27  # -------------------------------------------------
% 7.76/2.27  # User time                : 0.018 s
% 7.76/2.27  # System time              : 0.007 s
% 7.76/2.27  # Total time               : 0.025 s
% 7.76/2.27  # Maximum resident set size: 7112 pages
% 7.76/2.27  
%------------------------------------------------------------------------------