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

View Problem - Process Solution

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

% Computer : n017.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:51:22 EDT 2022

% Result   : CounterSatisfiable 6.58s 2.10s
% Output   : Saturation 6.58s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
    ( big_g(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_7) ).

cnf(i_0_11,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_11) ).

cnf(i_0_3,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(X2,X1)
    | ~ big_g(X1,esk1_2(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_3) ).

cnf(i_0_6,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_6) ).

cnf(i_0_9,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_9) ).

cnf(i_0_8,negated_conjecture,
    ( big_g(X1,X2)
    | big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_8) ).

cnf(i_0_1,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(esk1_2(X2,X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( big_g(X1,X2)
    | big_g(X2,esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_5) ).

cnf(i_0_10,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_10) ).

cnf(i_0_4,negated_conjecture,
    ( big_g(X1,esk1_2(X2,X1))
    | ~ big_f(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(esk1_2(X2,X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_2) ).

cnf(i_0_12,negated_conjecture,
    big_f(X1,esk1_2(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4uvmnhuz/input.p',i_0_12) ).

cnf(c_0_25,negated_conjecture,
    ( big_g(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_7,
    [final] ).

cnf(c_0_26,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_11,
    [final] ).

cnf(c_0_27,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(X2,X1)
    | ~ big_g(X1,esk1_2(X2,X1)) ),
    i_0_3,
    [final] ).

cnf(c_0_28,negated_conjecture,
    ( big_g(X1,X2)
    | big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]),
    [final] ).

cnf(c_0_29,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_6 ).

cnf(c_0_30,negated_conjecture,
    ( big_f(X1,esk1_2(X2,X1))
    | big_f(X1,X2)
    | ~ big_g(X2,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]),
    [final] ).

cnf(c_0_31,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_28]),
    [final] ).

cnf(c_0_32,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_9,
    [final] ).

cnf(c_0_33,negated_conjecture,
    ( big_g(X1,X2)
    | big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_8,
    [final] ).

cnf(c_0_34,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(esk1_2(X2,X1),X1) ),
    i_0_1,
    [final] ).

cnf(c_0_35,negated_conjecture,
    ( big_g(X1,X2)
    | big_g(X2,esk1_2(X1,X2)) ),
    i_0_5,
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    i_0_10,
    [final] ).

cnf(c_0_37,negated_conjecture,
    ( big_g(X1,esk1_2(X2,X1))
    | ~ big_f(X1,X2) ),
    i_0_4,
    [final] ).

cnf(c_0_38,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(esk1_2(X2,X1),X1) ),
    i_0_2,
    [final] ).

cnf(c_0_39,negated_conjecture,
    big_f(X1,esk1_2(X1,X2)),
    i_0_12,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN335+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 Jul 11 14:34:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 6.58/2.10  # ENIGMATIC: Solved by autoschedule:
% 6.58/2.10  # No SInE strategy applied
% 6.58/2.10  # Trying AutoSched0 for 150 seconds
% 6.58/2.10  # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 6.58/2.10  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.58/2.10  #
% 6.58/2.10  # Preprocessing time       : 0.024 s
% 6.58/2.10  
% 6.58/2.10  # No proof found!
% 6.58/2.10  # SZS status Satisfiable
% 6.58/2.10  # SZS output start Saturation
% See solution above
% 6.58/2.10  
% 6.58/2.10  # -------------------------------------------------
% 6.58/2.10  # User time                : 0.024 s
% 6.58/2.10  # System time              : 0.005 s
% 6.58/2.10  # Total time               : 0.030 s
% 6.58/2.10  # Maximum resident set size: 7120 pages
% 6.58/2.10  
%------------------------------------------------------------------------------