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

View Problem - Process Solution

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

% Computer : n009.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:45:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,negated_conjecture,
    ( ~ a_holds(key(X1,b))
    | ~ b_holds(key(X1,a)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-otuhyf3o/input.p',i_0_17) ).

cnf(i_0_11,plain,
    b_holds(key(generate_key(an_a_nonce),a)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-otuhyf3o/input.p',i_0_11) ).

cnf(i_0_13,plain,
    a_holds(key(generate_key(an_a_nonce),b)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-otuhyf3o/input.p',i_0_13) ).

cnf(c_0_21,negated_conjecture,
    ( ~ a_holds(key(X1,b))
    | ~ b_holds(key(X1,a)) ),
    i_0_17 ).

cnf(c_0_22,plain,
    b_holds(key(generate_key(an_a_nonce),a)),
    i_0_11 ).

cnf(c_0_23,plain,
    a_holds(key(generate_key(an_a_nonce),b)),
    i_0_13 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 15 07:19:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.73/2.37  # ENIGMATIC: Solved by autoschedule:
% 7.73/2.37  # No SInE strategy applied
% 7.73/2.37  # Trying AutoSched0 for 150 seconds
% 7.73/2.37  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S039A
% 7.73/2.37  # and selection function PSelectUnlessUniqMaxPos.
% 7.73/2.37  #
% 7.73/2.37  # Preprocessing time       : 0.023 s
% 7.73/2.37  # Presaturation interreduction done
% 7.73/2.37  
% 7.73/2.37  # Proof found!
% 7.73/2.37  # SZS status Theorem
% 7.73/2.37  # SZS output start CNFRefutation
% See solution above
% 7.73/2.37  # Training examples: 0 positive, 0 negative
% 7.73/2.37  
% 7.73/2.37  # -------------------------------------------------
% 7.73/2.37  # User time                : 0.026 s
% 7.73/2.37  # System time              : 0.002 s
% 7.73/2.37  # Total time               : 0.028 s
% 7.73/2.37  # Maximum resident set size: 7120 pages
% 7.73/2.37  
%------------------------------------------------------------------------------