↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM632+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 08:38:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_220,hypothesis,
    sdtlpdtrp0(xc,xQ) = sdtlpdtrp0(xd,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8ndagc0/lgb.p',i_0_220) ).

cnf(i_0_218,hypothesis,
    sdtlpdtrp0(xd,xn) = szDzizrdt0(xd),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8ndagc0/lgb.p',i_0_218) ).

cnf(i_0_221,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != szDzizrdt0(xd),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8ndagc0/lgb.p',i_0_221) ).

cnf(c_0_225,hypothesis,
    sdtlpdtrp0(xc,xQ) = sdtlpdtrp0(xd,xn),
    i_0_220 ).

cnf(c_0_226,hypothesis,
    sdtlpdtrp0(xd,xn) = szDzizrdt0(xd),
    i_0_218 ).

cnf(c_0_227,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != szDzizrdt0(xd),
    i_0_221 ).

cnf(c_0_228,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_227]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM632+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 : Thu Jul  7 16:49:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.95/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.95/2.38  # No SInE strategy applied
% 7.95/2.38  # Trying AutoSched0 for 150 seconds
% 7.95/2.38  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.95/2.38  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.95/2.38  #
% 7.95/2.38  # Preprocessing time       : 0.024 s
% 7.95/2.38  
% 7.95/2.38  # Proof found!
% 7.95/2.38  # SZS status Theorem
% 7.95/2.38  # SZS output start CNFRefutation
% See solution above
% 7.95/2.38  # Training examples: 0 positive, 0 negative
% 7.95/2.38  
% 7.95/2.38  # -------------------------------------------------
% 7.95/2.38  # User time                : 0.023 s
% 7.95/2.38  # System time              : 0.007 s
% 7.95/2.38  # Total time               : 0.029 s
% 7.95/2.38  # Maximum resident set size: 7128 pages
% 7.95/2.38  
%------------------------------------------------------------------------------