↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n025.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:02:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( is_state(esk2_0)
    | ~ hoare_165779456gleton ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-djppk8ti/lgb.p',i_0_4) ).

cnf(i_0_9,hypothesis,
    hoare_165779456gleton,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-djppk8ti/lgb.p',i_0_9) ).

cnf(i_0_3,plain,
    ( esk2_0 != esk1_0
    | ~ hoare_165779456gleton ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-djppk8ti/lgb.p',i_0_3) ).

cnf(i_0_10,negated_conjecture,
    ( X1 = esk3_0
    | ~ is_state(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-djppk8ti/lgb.p',i_0_10) ).

cnf(i_0_5,plain,
    ( is_state(esk1_0)
    | ~ hoare_165779456gleton ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-djppk8ti/lgb.p',i_0_5) ).

cnf(c_0_16,plain,
    ( is_state(esk2_0)
    | ~ hoare_165779456gleton ),
    i_0_4 ).

cnf(c_0_17,hypothesis,
    hoare_165779456gleton,
    i_0_9 ).

cnf(c_0_18,plain,
    ( esk2_0 != esk1_0
    | ~ hoare_165779456gleton ),
    i_0_3 ).

cnf(c_0_19,negated_conjecture,
    ( X1 = esk3_0
    | ~ is_state(X1) ),
    i_0_10 ).

cnf(c_0_20,plain,
    is_state(esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_21,plain,
    ( is_state(esk1_0)
    | ~ hoare_165779456gleton ),
    i_0_5 ).

cnf(c_0_22,plain,
    esk1_0 != esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).

cnf(c_0_23,plain,
    esk2_0 = esk3_0,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    is_state(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17])]) ).

cnf(c_0_25,plain,
    esk1_0 != esk3_0,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Sat Jun  4 12:19:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.72/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.38  # No SInE strategy applied
% 7.72/2.38  # Trying AutoSched0 for 150 seconds
% 7.72/2.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 7.72/2.38  # and selection function PSelectAllCondOptimalLit.
% 7.72/2.38  #
% 7.72/2.38  # Preprocessing time       : 0.023 s
% 7.72/2.38  # Presaturation interreduction done
% 7.72/2.38  
% 7.72/2.38  # Proof found!
% 7.72/2.38  # SZS status Theorem
% 7.72/2.38  # SZS output start CNFRefutation
% See solution above
% 7.72/2.38  # Training examples: 0 positive, 0 negative
% 7.72/2.38  
% 7.72/2.38  # -------------------------------------------------
% 7.72/2.38  # User time                : 0.024 s
% 7.72/2.38  # System time              : 0.006 s
% 7.72/2.38  # Total time               : 0.030 s
% 7.72/2.38  # Maximum resident set size: 7128 pages
% 7.72/2.38  
%------------------------------------------------------------------------------