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

% Computer : n005.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 : Wed Jul 20 17:46:19 EDT 2022

% Result   : Theorem 4.41s 2.25s
% Output   : CNFRefutation 4.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  13 unt;   0 nHn;  20 RR)
%            Number of literals    :   48 (   4 equ;  26 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
    | ~ p(X3)
    | ~ p(X1)
    | ~ p(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_9) ).

cnf(i_0_22,plain,
    p(kk),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_22) ).

cnf(i_0_2,plain,
    enc(X1,enc(i(X1),X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_2) ).

cnf(i_0_3,plain,
    i(i(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_3) ).

cnf(i_0_10,plain,
    ( p(enc(tc,X1))
    | ~ p(X2)
    | ~ p(X3)
    | ~ p(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_10) ).

cnf(i_0_17,plain,
    p(enc(tmk,pp)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_17) ).

cnf(i_0_25,negated_conjecture,
    ~ p(enc(pp,a)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_25) ).

cnf(i_0_24,plain,
    p(a),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xis6_uou/lgb.p',i_0_24) ).

cnf(c_0_34,plain,
    ( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
    | ~ p(X3)
    | ~ p(X1)
    | ~ p(X2) ),
    i_0_9 ).

cnf(c_0_35,plain,
    p(kk),
    i_0_22 ).

cnf(c_0_36,plain,
    ( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
    | ~ p(X2)
    | ~ p(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    enc(X1,enc(i(X1),X2)) = X2,
    i_0_2 ).

cnf(c_0_38,plain,
    i(i(X1)) = X1,
    i_0_3 ).

cnf(c_0_39,plain,
    ( p(enc(tc,X1))
    | ~ p(X2)
    | ~ p(X3)
    | ~ p(X1) ),
    i_0_10 ).

cnf(c_0_40,plain,
    ( p(enc(enc(i(tmk),X1),X2))
    | ~ p(enc(tc,X2))
    | ~ p(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_41,plain,
    ( p(enc(tc,X1))
    | ~ p(X2)
    | ~ p(X1) ),
    inference(spm,[status(thm)],[c_0_39,c_0_35]) ).

cnf(c_0_42,plain,
    ( p(enc(X1,X2))
    | ~ p(enc(tc,X2))
    | ~ p(enc(tmk,X1)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_38]) ).

cnf(c_0_43,plain,
    ( p(enc(tc,X1))
    | ~ p(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_35]) ).

cnf(c_0_44,plain,
    ( p(enc(X1,X2))
    | ~ p(enc(tmk,X1))
    | ~ p(X2) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_45,plain,
    p(enc(tmk,pp)),
    i_0_17 ).

cnf(c_0_46,negated_conjecture,
    ~ p(enc(pp,a)),
    i_0_25 ).

cnf(c_0_47,plain,
    ( p(enc(pp,X1))
    | ~ p(X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,plain,
    p(a),
    i_0_24 ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n005.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 : Thu Jun 16 01:04:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.41/2.25  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.41/2.25  # No SInE strategy applied
% 4.41/2.25  # Trying AutoSched0 for 150 seconds
% 4.41/2.25  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.41/2.25  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.41/2.25  #
% 4.41/2.25  # Preprocessing time       : 0.023 s
% 4.41/2.25  # Presaturation interreduction done
% 4.41/2.25  
% 4.41/2.25  # Proof found!
% 4.41/2.25  # SZS status Theorem
% 4.41/2.25  # SZS output start CNFRefutation
% See solution above
% 4.41/2.25  # Training examples: 0 positive, 0 negative
% 4.41/2.25  
% 4.41/2.25  # -------------------------------------------------
% 4.41/2.25  # User time                : 0.035 s
% 4.41/2.25  # System time              : 0.005 s
% 4.41/2.25  # Total time               : 0.040 s
% 4.41/2.25  # Maximum resident set size: 7124 pages
% 4.41/2.25  
%------------------------------------------------------------------------------