↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS130+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 02:55:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( rp(X1,esk1_1(X1))
    | ~ cNothing(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_6) ).

cnf(i_0_5,plain,
    ( ~ cNothing(X1)
    | ~ rp(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_5) ).

cnf(i_0_7,negated_conjecture,
    ( cowlNothing(esk2_0)
    | cowlNothing(esk4_0)
    | xsd_string(esk3_0)
    | cNothing(esk4_0)
    | ~ xsd_integer(esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_7) ).

cnf(i_0_1,plain,
    ~ cowlNothing(X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_1) ).

cnf(i_0_3,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_3) ).

cnf(i_0_4,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_4) ).

cnf(i_0_9,negated_conjecture,
    ( cowlNothing(esk2_0)
    | cowlNothing(esk4_0)
    | xsd_integer(esk3_0)
    | cNothing(esk4_0)
    | ~ xsd_string(esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pq0tnj8/input.p',i_0_9) ).

cnf(c_0_17,plain,
    ( rp(X1,esk1_1(X1))
    | ~ cNothing(X1) ),
    i_0_6 ).

cnf(c_0_18,plain,
    ( ~ cNothing(X1)
    | ~ rp(X1,X2) ),
    i_0_5 ).

cnf(c_0_19,negated_conjecture,
    ( cowlNothing(esk2_0)
    | cowlNothing(esk4_0)
    | xsd_string(esk3_0)
    | cNothing(esk4_0)
    | ~ xsd_integer(esk3_0) ),
    i_0_7 ).

cnf(c_0_20,plain,
    ~ cowlNothing(X1),
    i_0_1 ).

cnf(c_0_21,plain,
    ~ cNothing(X1),
    inference(csr,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    i_0_3 ).

cnf(c_0_23,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    i_0_4 ).

cnf(c_0_24,negated_conjecture,
    xsd_string(esk3_0),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_21]),c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ( cowlNothing(esk2_0)
    | cowlNothing(esk4_0)
    | xsd_integer(esk3_0)
    | cNothing(esk4_0)
    | ~ xsd_string(esk3_0) ),
    i_0_9 ).

cnf(c_0_26,plain,
    ~ xsd_integer(esk3_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24])]),c_0_20]),c_0_20]),c_0_26]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : KRS130+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n020.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 : Tue Jun  7 15:13:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.80/2.32  # ENIGMATIC: Solved by autoschedule:
% 7.80/2.32  # No SInE strategy applied
% 7.80/2.32  # Trying AutoSched0 for 150 seconds
% 7.80/2.32  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.80/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.80/2.32  #
% 7.80/2.32  # Preprocessing time       : 0.018 s
% 7.80/2.32  
% 7.80/2.32  # Proof found!
% 7.80/2.32  # SZS status Theorem
% 7.80/2.32  # SZS output start CNFRefutation
% See solution above
% 7.80/2.32  # Training examples: 0 positive, 0 negative
% 7.80/2.32  
% 7.80/2.32  # -------------------------------------------------
% 7.80/2.32  # User time                : 0.017 s
% 7.80/2.32  # System time              : 0.009 s
% 7.80/2.32  # Total time               : 0.027 s
% 7.80/2.32  # Maximum resident set size: 7120 pages
% 7.80/2.32  
%------------------------------------------------------------------------------