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

View Problem - Process Solution

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

% Computer : n007.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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(X3,X2)
    | ~ big_f(X1,esk2_0)
    | ~ big_f(X3,esk3_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_6) ).

cnf(i_0_3,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(esk5_2(X1,X2),X2)
    | ~ big_f(X2,esk4_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_3) ).

cnf(i_0_2,plain,
    ( X1 = X2
    | ~ big_f(X1,esk1_1(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_2) ).

cnf(i_0_7,negated_conjecture,
    ( big_f(esk3_2(X1,X2),X2)
    | ~ big_f(X1,X2)
    | ~ big_f(X1,esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_7) ).

cnf(i_0_4,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(esk5_2(X1,X2),esk4_1(X1))
    | ~ big_f(X2,esk4_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_4) ).

cnf(i_0_1,plain,
    ( big_f(X1,esk1_1(X2))
    | X1 != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(X1,esk4_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cdwm90fd/input.p',i_0_5) ).

cnf(c_0_15,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(X3,X2)
    | ~ big_f(X1,esk2_0)
    | ~ big_f(X3,esk3_2(X1,X2)) ),
    i_0_6 ).

cnf(c_0_16,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(esk5_2(X1,X2),X2)
    | ~ big_f(X2,esk4_1(X1)) ),
    i_0_3 ).

cnf(c_0_17,plain,
    ( X1 = X2
    | ~ big_f(X1,esk1_1(X2)) ),
    i_0_2 ).

cnf(c_0_18,negated_conjecture,
    ( big_f(esk3_2(X1,X2),X2)
    | ~ big_f(X1,X2)
    | ~ big_f(X1,esk2_0) ),
    i_0_7 ).

cnf(c_0_19,negated_conjecture,
    ( big_f(X1,esk2_0)
    | ~ big_f(esk5_2(X1,esk3_2(X2,X3)),X3)
    | ~ big_f(esk3_2(X2,X3),esk4_1(X1))
    | ~ big_f(X2,esk2_0)
    | ~ big_f(X2,X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(esk5_2(X1,X2),esk4_1(X1))
    | ~ big_f(X2,esk4_1(X1)) ),
    i_0_4 ).

cnf(c_0_21,plain,
    ( esk3_2(X1,esk1_1(X2)) = X2
    | ~ big_f(X1,esk1_1(X2))
    | ~ big_f(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( big_f(X1,esk1_1(X2))
    | X1 != X2 ),
    i_0_1 ).

cnf(c_0_23,negated_conjecture,
    ( big_f(X1,esk2_0)
    | ~ big_f(X2,esk4_1(X1))
    | ~ big_f(X2,esk2_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ big_f(X1,esk1_1(X2))
    | ~ big_f(X3,esk1_1(X2))
    | ~ big_f(X3,esk2_0)
    | ~ big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_25,plain,
    big_f(X1,esk1_1(X1)),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( big_f(X1,esk2_0)
    | ~ big_f(esk5_2(X1,X2),esk2_0)
    | ~ big_f(X2,esk4_1(X1)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_27,plain,
    ( ~ big_f(X1,esk1_1(X2))
    | ~ big_f(X1,esk2_0)
    | ~ big_f(X2,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( big_f(X1,esk2_0)
    | ~ big_f(esk2_0,esk4_1(X1)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_16]) ).

cnf(c_0_29,negated_conjecture,
    ( big_f(X1,esk2_0)
    | big_f(X1,esk4_1(X1)) ),
    i_0_5 ).

cnf(c_0_30,plain,
    ( ~ big_f(X1,esk2_0)
    | ~ big_f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    big_f(esk2_0,esk2_0),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n007.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 : Tue Jul 12 04:10:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  # ENIGMATIC: Selected complete mode:
% 7.70/2.18  # ENIGMATIC: Solved by autoschedule:
% 7.70/2.18  # No SInE strategy applied
% 7.70/2.18  # Trying AutoSched0 for 150 seconds
% 7.70/2.18  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.70/2.18  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.70/2.18  #
% 7.70/2.18  # Preprocessing time       : 0.023 s
% 7.70/2.18  
% 7.70/2.18  # Proof found!
% 7.70/2.18  # SZS status Theorem
% 7.70/2.18  # SZS output start CNFRefutation
% See solution above
% 7.70/2.18  # Training examples: 0 positive, 0 negative
% 7.70/2.18  
% 7.70/2.18  # -------------------------------------------------
% 7.70/2.18  # User time                : 0.027 s
% 7.70/2.18  # System time              : 0.003 s
% 7.70/2.18  # Total time               : 0.030 s
% 7.70/2.18  # Maximum resident set size: 7120 pages
% 7.70/2.18  
%------------------------------------------------------------------------------