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

View Problem - Process Solution

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

% Computer : n020.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 00:03:11 EDT 2022

% Result   : Theorem 8.27s 2.51s
% Output   : CNFRefutation 8.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  12 unt;   0 nHn;  25 RR)
%            Number of literals    :   45 (   2 equ;  22 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   24 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_63,plain,
    ( pred_attacker(constr_dec(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_63) ).

cnf(i_0_56,plain,
    constr_dec(constr_enc(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_56) ).

cnf(i_0_77,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_4(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_77) ).

cnf(i_0_92,plain,
    ( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7))))
    | ~ pred_attacker(tuple_A_in_3(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_92) ).

cnf(i_0_94,negated_conjecture,
    ~ pred_attacker(name_objective),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_94) ).

cnf(i_0_79,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_2(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_79) ).

cnf(i_0_91,plain,
    pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_91) ).

cnf(i_0_82,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_1(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_82) ).

cnf(i_0_90,plain,
    pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_90) ).

cnf(i_0_83,plain,
    ( pred_attacker(tuple_A_in_3(X1))
    | ~ pred_attacker(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ifd1dkua/input.p',i_0_83) ).

cnf(c_0_105,plain,
    ( pred_attacker(constr_dec(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    i_0_63 ).

cnf(c_0_106,plain,
    constr_dec(constr_enc(X1,X2),X2) = X1,
    i_0_56 ).

cnf(c_0_107,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_4(X1)) ),
    i_0_77 ).

cnf(c_0_108,plain,
    ( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7))))
    | ~ pred_attacker(tuple_A_in_3(X1)) ),
    i_0_92 ).

cnf(c_0_109,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_enc(X1,X2))
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_110,plain,
    ( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7)))
    | ~ pred_attacker(tuple_A_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_107,c_0_108]) ).

cnf(c_0_111,negated_conjecture,
    ~ pred_attacker(name_objective),
    i_0_94 ).

cnf(c_0_112,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_2(X1)) ),
    i_0_79 ).

cnf(c_0_113,plain,
    pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
    i_0_91 ).

cnf(c_0_114,plain,
    ( ~ pred_attacker(constr_mod(constr_exp(X1,name_Na),name_P_7))
    | ~ pred_attacker(tuple_A_in_3(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).

cnf(c_0_115,plain,
    pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
    inference(spm,[status(thm)],[c_0_112,c_0_113]) ).

cnf(c_0_116,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_A_out_1(X2,X1)) ),
    i_0_82 ).

cnf(c_0_117,plain,
    pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
    i_0_90 ).

cnf(c_0_118,plain,
    ~ pred_attacker(tuple_A_in_3(name_G_8)),
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_119,plain,
    ( pred_attacker(tuple_A_in_3(X1))
    | ~ pred_attacker(X1) ),
    i_0_83 ).

cnf(c_0_120,plain,
    pred_attacker(name_G_8),
    inference(spm,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_121,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n020.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 : Sat Jun  4 11:31:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected complete mode:
% 8.27/2.51  # ENIGMATIC: Solved by autoschedule:
% 8.27/2.51  # No SInE strategy applied
% 8.27/2.51  # Trying AutoSched0 for 150 seconds
% 8.27/2.51  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.27/2.51  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.27/2.51  #
% 8.27/2.51  # Preprocessing time       : 0.024 s
% 8.27/2.51  # Presaturation interreduction done
% 8.27/2.51  
% 8.27/2.51  # Proof found!
% 8.27/2.51  # SZS status Theorem
% 8.27/2.51  # SZS output start CNFRefutation
% See solution above
% 8.27/2.51  # Training examples: 0 positive, 0 negative
% 8.27/2.51  
% 8.27/2.51  # -------------------------------------------------
% 8.27/2.51  # User time                : 0.029 s
% 8.27/2.51  # System time              : 0.007 s
% 8.27/2.51  # Total time               : 0.035 s
% 8.27/2.51  # Maximum resident set size: 7120 pages
% 8.27/2.51  
%------------------------------------------------------------------------------