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

View Problem - Process Solution

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

% Computer : n024.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:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_84,plain,
    constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X1,X2)) = X2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ccq7zslu/input.p',i_0_84) ).

cnf(i_0_83,plain,
    tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3) = tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ccq7zslu/input.p',i_0_83) ).

cnf(i_0_144,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_assoc_pair(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ccq7zslu/input.p',i_0_144) ).

cnf(i_0_177,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ccq7zslu/input.p',i_0_177) ).

cnf(i_0_152,plain,
    pred_attacker(constr_CONST_0x30),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ccq7zslu/input.p',i_0_152) ).

cnf(c_0_183,plain,
    constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X1,X2)) = X2,
    i_0_84 ).

cnf(c_0_184,plain,
    tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3) = tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)),
    i_0_83 ).

cnf(c_0_185,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_assoc_pair(X1,X2)) ),
    i_0_144 ).

cnf(c_0_186,plain,
    tuple_assoc_pair(X1,X2) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_183]) ).

cnf(c_0_187,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    i_0_177 ).

cnf(c_0_188,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(rw,[status(thm)],[c_0_185,c_0_186]) ).

cnf(c_0_189,plain,
    pred_attacker(constr_CONST_0x30),
    i_0_152 ).

cnf(c_0_190,negated_conjecture,
    ~ pred_attacker(X1),
    inference(spm,[status(thm)],[c_0_187,c_0_188]) ).

cnf(c_0_191,plain,
    $false,
    inference(sr,[status(thm)],[c_0_189,c_0_190]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW962+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 : Sun Jun  5 14:49:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.81/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.81/2.35  # No SInE strategy applied
% 7.81/2.35  # Trying AutoSched0 for 150 seconds
% 7.81/2.35  # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.81/2.35  # and selection function SelectNewComplexAHP.
% 7.81/2.35  #
% 7.81/2.35  # Preprocessing time       : 0.025 s
% 7.81/2.35  
% 7.81/2.35  # Proof found!
% 7.81/2.35  # SZS status Theorem
% 7.81/2.35  # SZS output start CNFRefutation
% See solution above
% 7.81/2.35  # Training examples: 0 positive, 0 negative
% 7.81/2.35  
% 7.81/2.35  # -------------------------------------------------
% 7.81/2.35  # User time                : 0.027 s
% 7.81/2.35  # System time              : 0.009 s
% 7.81/2.35  # Total time               : 0.036 s
% 7.81/2.35  # Maximum resident set size: 7124 pages
% 7.81/2.35  
%------------------------------------------------------------------------------