↑ Up

Enigma---0.5.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL685+1.001 : TPTP v9.3.1. Released v4.0.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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:48:21 AM UTC 2026

% Result   : CounterSatisfiable 13.54s 3.29s
% Output   : Saturation 13.54s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( p101(X1)
    | ~ p201(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oengg5xn/input.p',i_0_5) ).

cnf(i_0_1,plain,
    r1(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oengg5xn/input.p',i_0_1) ).

cnf(i_0_2,plain,
    ( r1(X1,X2)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oengg5xn/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    p101(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oengg5xn/input.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    p201(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oengg5xn/input.p',i_0_4) ).

cnf(c_0_11,negated_conjecture,
    ( p101(X1)
    | ~ p201(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    i_0_5,
    [final] ).

cnf(c_0_12,plain,
    r1(X1,X1),
    i_0_1,
    [final] ).

cnf(c_0_13,plain,
    ( p101(X1)
    | ~ r1(esk1_0,X1)
    | ~ p201(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]),
    [final] ).

cnf(c_0_14,plain,
    ( r1(X1,X2)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3) ),
    i_0_2,
    [final] ).

cnf(c_0_15,negated_conjecture,
    p101(esk1_0),
    i_0_3,
    [final] ).

cnf(c_0_16,negated_conjecture,
    p201(esk1_0),
    i_0_4,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL685+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.08/0.35  % Computer : n009.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep  4 14:33:38 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.14/0.45  # ENIGMATIC: Selected complete mode:
% 13.54/3.29  # ENIGMATIC: Solved by autoschedule:
% 13.54/3.29  # No SInE strategy applied
% 13.54/3.29  # Trying AutoSched0 for 150 seconds
% 13.54/3.29  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 13.54/3.29  # and selection function PSelectComplexExceptRRHorn.
% 13.54/3.29  #
% 13.54/3.29  # Preprocessing time       : 0.023 s
% 13.54/3.29  
% 13.54/3.29  # No proof found!
% 13.54/3.29  # SZS status Satisfiable
% 13.54/3.29  # SZS output start Saturation
% See solution above
% 13.54/3.29  
% 13.54/3.29  # -------------------------------------------------
% 13.54/3.29  # User time                : 0.023 s
% 13.54/3.29  # System time              : 0.004 s
% 13.54/3.29  # Total time               : 0.027 s
% 13.54/3.29  # Maximum resident set size: 3328 pages
% 13.54/3.29  
%------------------------------------------------------------------------------