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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( big_p(X1)
    | big_p(f(X2))
    | X1 != f(X3)
    | ~ big_p(X2)
    | ~ big_p(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_1) ).

cnf(i_0_4,negated_conjecture,
    ( f(esk2_0) = esk1_0
    | ~ big_p(f(esk3_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_4) ).

cnf(i_0_5,negated_conjecture,
    ( f(esk2_0) = esk1_0
    | big_p(esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_5) ).

cnf(i_0_6,negated_conjecture,
    ( big_p(esk2_0)
    | ~ big_p(f(esk3_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_6) ).

cnf(i_0_7,negated_conjecture,
    ( big_p(esk2_0)
    | big_p(esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_7) ).

cnf(i_0_2,negated_conjecture,
    ( ~ big_p(esk1_0)
    | ~ big_p(f(esk3_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ( big_p(esk3_0)
    | ~ big_p(esk1_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwt2wnrx/lgb.p',i_0_3) ).

cnf(c_0_15,negated_conjecture,
    ( big_p(X1)
    | big_p(f(X2))
    | X1 != f(X3)
    | ~ big_p(X2)
    | ~ big_p(X3) ),
    i_0_1 ).

cnf(c_0_16,negated_conjecture,
    ( big_p(f(X1))
    | big_p(f(X2))
    | ~ big_p(X1)
    | ~ big_p(X2) ),
    inference(er,[status(thm)],[c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    ( f(esk2_0) = esk1_0
    | ~ big_p(f(esk3_0)) ),
    i_0_4 ).

cnf(c_0_18,negated_conjecture,
    ( big_p(f(X1))
    | ~ big_p(X1) ),
    inference(ef,[status(thm)],[c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( f(esk2_0) = esk1_0
    | big_p(esk3_0) ),
    i_0_5 ).

cnf(c_0_20,negated_conjecture,
    ( big_p(esk2_0)
    | ~ big_p(f(esk3_0)) ),
    i_0_6 ).

cnf(c_0_21,negated_conjecture,
    ( big_p(esk2_0)
    | big_p(esk3_0) ),
    i_0_7 ).

cnf(c_0_22,negated_conjecture,
    f(esk2_0) = esk1_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    big_p(esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ big_p(esk1_0)
    | ~ big_p(f(esk3_0)) ),
    i_0_2 ).

cnf(c_0_25,negated_conjecture,
    big_p(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_23])]) ).

cnf(c_0_26,negated_conjecture,
    ( big_p(esk3_0)
    | ~ big_p(esk1_0) ),
    i_0_3 ).

cnf(c_0_27,negated_conjecture,
    ~ big_p(f(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_28,negated_conjecture,
    big_p(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25])]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN078+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n018.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.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 12:17:00 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.34/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.34/2.31  # No SInE strategy applied
% 7.34/2.31  # Trying AutoSched0 for 150 seconds
% 7.34/2.31  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.34/2.31  # and selection function SelectNewComplexAHPNS.
% 7.34/2.31  #
% 7.34/2.31  # Preprocessing time       : 0.019 s
% 7.34/2.31  
% 7.34/2.31  # Proof found!
% 7.34/2.31  # SZS status Theorem
% 7.34/2.31  # SZS output start CNFRefutation
% See solution above
% 7.34/2.31  # Training examples: 0 positive, 0 negative
% 7.34/2.31  
% 7.34/2.31  # -------------------------------------------------
% 7.34/2.31  # User time                : 0.021 s
% 7.34/2.31  # System time              : 0.004 s
% 7.34/2.31  # Total time               : 0.025 s
% 7.34/2.31  # Maximum resident set size: 7120 pages
% 7.34/2.31  
%------------------------------------------------------------------------------