↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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 : Tue Jul 19 20:13:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_202,negated_conjecture,
    neq(esk49_0,nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_202) ).

cnf(i_0_204,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_204) ).

cnf(i_0_199,negated_conjecture,
    ( cons(X1,nil) != esk48_0
    | app(X2,cons(X1,nil)) != esk49_0
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_199) ).

cnf(i_0_193,negated_conjecture,
    ( cons(esk52_0,nil) = esk50_0
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_193) ).

cnf(i_0_203,negated_conjecture,
    esk50_0 = esk48_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_203) ).

cnf(i_0_197,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_197) ).

cnf(i_0_191,negated_conjecture,
    ( app(esk53_0,cons(esk52_0,nil)) = esk51_0
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_191) ).

cnf(i_0_195,negated_conjecture,
    ( ssList(esk53_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-218nr_fw/lgb.p',i_0_195) ).

cnf(c_0_213,negated_conjecture,
    neq(esk49_0,nil),
    i_0_202 ).

cnf(c_0_214,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_204 ).

cnf(c_0_215,negated_conjecture,
    ( cons(X1,nil) != esk48_0
    | app(X2,cons(X1,nil)) != esk49_0
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ neq(esk51_0,nil) ),
    i_0_199 ).

cnf(c_0_216,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_213,c_0_214]) ).

cnf(c_0_217,negated_conjecture,
    ( cons(esk52_0,nil) = esk50_0
    | ~ neq(esk51_0,nil) ),
    i_0_193 ).

cnf(c_0_218,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_203 ).

cnf(c_0_219,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    i_0_197 ).

cnf(c_0_220,negated_conjecture,
    ( app(X1,cons(X2,nil)) != esk51_0
    | cons(X2,nil) != esk48_0
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_214]),c_0_216])]) ).

cnf(c_0_221,negated_conjecture,
    cons(esk52_0,nil) = esk48_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218]),c_0_216])]) ).

cnf(c_0_222,negated_conjecture,
    ssItem(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_216])]) ).

cnf(c_0_223,negated_conjecture,
    ( app(esk53_0,cons(esk52_0,nil)) = esk51_0
    | ~ neq(esk51_0,nil) ),
    i_0_191 ).

cnf(c_0_224,negated_conjecture,
    ( ssList(esk53_0)
    | ~ neq(esk51_0,nil) ),
    i_0_195 ).

cnf(c_0_225,negated_conjecture,
    ( app(X1,esk48_0) != esk51_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222])]) ).

cnf(c_0_226,negated_conjecture,
    app(esk53_0,esk48_0) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_221]),c_0_216])]) ).

cnf(c_0_227,negated_conjecture,
    ssList(esk53_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_216])]) ).

cnf(c_0_228,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : SWC096+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 00:27:53 EDT 2022
% 0.13/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected SinE mode:
% 0.21/0.48  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.47/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.44  # No SInE strategy applied
% 7.47/2.44  # Trying AutoSched0 for 150 seconds
% 7.47/2.44  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.47/2.44  # and selection function SelectNewComplexAHP.
% 7.47/2.44  #
% 7.47/2.44  # Preprocessing time       : 0.012 s
% 7.47/2.44  # Presaturation interreduction done
% 7.47/2.44  
% 7.47/2.44  # Proof found!
% 7.47/2.44  # SZS status Theorem
% 7.47/2.44  # SZS output start CNFRefutation
% See solution above
% 7.47/2.44  # Training examples: 0 positive, 0 negative
% 7.47/2.44  
% 7.47/2.44  # -------------------------------------------------
% 7.47/2.44  # User time                : 0.014 s
% 7.47/2.44  # System time              : 0.004 s
% 7.47/2.44  # Total time               : 0.018 s
% 7.47/2.44  # Maximum resident set size: 7124 pages
% 7.47/2.44  
%------------------------------------------------------------------------------