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

View Problem - Process Solution

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

% Computer : n011.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:25 EDT 2022

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

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

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

cnf(i_0_5,negated_conjecture,
    ~ big_p(c),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjtfz_za/input.p',i_0_5) ).

cnf(c_0_35,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | big_p(c)
    | ~ big_p(a) ),
    i_0_4 ).

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

cnf(c_0_37,negated_conjecture,
    ~ big_p(c),
    i_0_5 ).

cnf(c_0_38,negated_conjecture,
    ( big_p(X1)
    | big_p(X2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),c_0_37]) ).

cnf(c_0_39,negated_conjecture,
    big_p(X1),
    inference(ef,[status(thm)],[c_0_38]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n011.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 : Tue Jul 12 03:12:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.16/2.19  # ENIGMATIC: Solved by autoschedule:
% 7.16/2.19  # No SInE strategy applied
% 7.16/2.19  # Trying AutoSched0 for 150 seconds
% 7.16/2.19  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.16/2.19  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.16/2.19  #
% 7.16/2.19  # Preprocessing time       : 0.012 s
% 7.16/2.19  
% 7.16/2.19  # Proof found!
% 7.16/2.19  # SZS status Theorem
% 7.16/2.19  # SZS output start CNFRefutation
% See solution above
% 7.16/2.19  # Training examples: 0 positive, 0 negative
% 7.16/2.19  
% 7.16/2.19  # -------------------------------------------------
% 7.16/2.19  # User time                : 0.015 s
% 7.16/2.19  # System time              : 0.003 s
% 7.16/2.19  # Total time               : 0.018 s
% 7.16/2.19  # Maximum resident set size: 7120 pages
% 7.16/2.19  
%------------------------------------------------------------------------------