TSTP Solution File: SYN084+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n006.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 : Thu Jul 21 04:49:41 EDT 2022

% Result   : Theorem 7.77s 2.43s
% Output   : CNFRefutation 7.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   32 (   7 unt;  14 nHn;  28 RR)
%            Number of literals    :   88 (   0 equ;  39 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | ~ big_p(a) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_4) ).

cnf(i_0_31,negated_conjecture,
    big_p(a),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_31) ).

cnf(i_0_1,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | ~ big_p(a)
    | ~ big_p(f(X1))
    | ~ big_p(f(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( ~ big_p(f(f(esk1_0)))
    | ~ big_p(f(f(esk2_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_5) ).

cnf(i_0_18,negated_conjecture,
    ( big_p(f(esk1_0))
    | big_p(f(esk2_0))
    | ~ big_p(esk1_0)
    | ~ big_p(esk2_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_18) ).

cnf(i_0_9,negated_conjecture,
    ( big_p(f(esk2_0))
    | ~ big_p(esk2_0)
    | ~ big_p(f(f(esk1_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_9) ).

cnf(i_0_14,negated_conjecture,
    ( big_p(f(esk1_0))
    | ~ big_p(esk1_0)
    | ~ big_p(f(f(esk2_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyxn5cdj/input.p',i_0_14) ).

cnf(c_0_39,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | ~ big_p(a) ),
    i_0_4 ).

cnf(c_0_40,negated_conjecture,
    big_p(a),
    i_0_31 ).

cnf(c_0_41,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | big_p(X1)
    | big_p(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_42,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | ~ big_p(a)
    | ~ big_p(f(X1))
    | ~ big_p(f(X2)) ),
    i_0_1 ).

cnf(c_0_43,negated_conjecture,
    ( ~ big_p(f(f(esk1_0)))
    | ~ big_p(f(f(esk2_0))) ),
    i_0_5 ).

cnf(c_0_44,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(X1) ),
    inference(ef,[status(thm)],[c_0_41]) ).

cnf(c_0_45,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(f(f(X2)))
    | ~ big_p(f(X2))
    | ~ big_p(f(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_40])]) ).

cnf(c_0_46,negated_conjecture,
    ( big_p(f(esk1_0))
    | big_p(f(esk2_0))
    | ~ big_p(esk1_0)
    | ~ big_p(esk2_0) ),
    i_0_18 ).

cnf(c_0_47,negated_conjecture,
    ( big_p(f(esk2_0))
    | ~ big_p(esk2_0)
    | ~ big_p(f(f(esk1_0))) ),
    i_0_9 ).

cnf(c_0_48,negated_conjecture,
    ( big_p(esk1_0)
    | ~ big_p(f(f(esk2_0))) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(f(esk2_0))
    | ~ big_p(f(X1))
    | ~ big_p(esk2_0)
    | ~ big_p(esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    ( big_p(esk2_0)
    | big_p(esk1_0) ),
    inference(spm,[status(thm)],[c_0_48,c_0_44]) ).

cnf(c_0_51,negated_conjecture,
    ( big_p(f(esk2_0))
    | ~ big_p(esk2_0)
    | ~ big_p(esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    ( big_p(f(esk2_0))
    | big_p(esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    ( big_p(f(f(esk2_0)))
    | big_p(f(f(X1)))
    | ~ big_p(f(X1))
    | ~ big_p(esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_51]),c_0_44]) ).

cnf(c_0_54,negated_conjecture,
    ( big_p(f(f(esk2_0)))
    | big_p(f(f(X1)))
    | ~ big_p(f(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_52]),c_0_53]) ).

cnf(c_0_55,negated_conjecture,
    big_p(esk1_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_52]),c_0_48]) ).

cnf(c_0_56,negated_conjecture,
    ( big_p(f(esk1_0))
    | ~ big_p(esk1_0)
    | ~ big_p(f(f(esk2_0))) ),
    i_0_14 ).

cnf(c_0_57,negated_conjecture,
    ( big_p(f(esk2_0))
    | ~ big_p(esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_55])]) ).

cnf(c_0_58,negated_conjecture,
    ( big_p(f(esk1_0))
    | ~ big_p(f(f(esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_55])]) ).

cnf(c_0_59,negated_conjecture,
    big_p(f(f(esk2_0))),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_57]),c_0_44]) ).

cnf(c_0_60,negated_conjecture,
    big_p(f(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).

cnf(c_0_61,negated_conjecture,
    ~ big_p(f(f(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_59])]) ).

cnf(c_0_62,negated_conjecture,
    ( big_p(f(f(X1)))
    | ~ big_p(f(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_60]),c_0_61]) ).

cnf(c_0_63,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_60])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n006.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 : Mon Jul 11 12:51:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.77/2.43  # ENIGMATIC: Solved by autoschedule:
% 7.77/2.43  # No SInE strategy applied
% 7.77/2.43  # Trying AutoSched0 for 150 seconds
% 7.77/2.43  # AutoSched0-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 7.77/2.43  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.77/2.43  #
% 7.77/2.43  # Preprocessing time       : 0.022 s
% 7.77/2.43  # Presaturation interreduction done
% 7.77/2.43  
% 7.77/2.43  # Proof found!
% 7.77/2.43  # SZS status Theorem
% 7.77/2.43  # SZS output start CNFRefutation
% See solution above
% 7.77/2.43  # Training examples: 0 positive, 0 negative
% 7.77/2.43  
% 7.77/2.43  # -------------------------------------------------
% 7.77/2.43  # User time                : 0.027 s
% 7.77/2.43  # System time              : 0.002 s
% 7.77/2.43  # Total time               : 0.029 s
% 7.77/2.43  # Maximum resident set size: 7124 pages
% 7.77/2.43  
%------------------------------------------------------------------------------