↑ Up

Enigma---0.5.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL657+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n027.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:47:14 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
    ( p1(X1)
    | ~ p100(X2)
    | ~ p100(X1)
    | ~ p1(X2)
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_7) ).

cnf(i_0_13,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_13) ).

cnf(i_0_17,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_17) ).

cnf(i_0_6,negated_conjecture,
    ( p1(X1)
    | ~ p100(X1)
    | ~ p100(X2)
    | ~ p1(X2)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_6) ).

cnf(i_0_9,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p101(X2)
    | ~ p101(X1)
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_9) ).

cnf(i_0_8,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p101(X1)
    | ~ p101(X2)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_8) ).

cnf(i_0_16,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_16) ).

cnf(i_0_15,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p102(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_15) ).

cnf(i_0_11,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p102(esk3_1(X1))
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_11) ).

cnf(i_0_12,negated_conjecture,
    ( p101(X1)
    | p2(esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_12) ).

cnf(i_0_14,negated_conjecture,
    ( p101(X1)
    | p101(esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_14) ).

cnf(i_0_10,negated_conjecture,
    ( p101(X1)
    | p101(esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_10) ).

cnf(i_0_5,negated_conjecture,
    ( p101(X1)
    | ~ p102(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    ( p100(X1)
    | ~ p101(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_4) ).

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

cnf(i_0_2,negated_conjecture,
    p100(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ki12piuq/input.p',i_0_2) ).

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

cnf(c_0_35,negated_conjecture,
    ( p1(X1)
    | ~ p100(X2)
    | ~ p100(X1)
    | ~ p1(X2)
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    i_0_7,
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_13,
    [final] ).

cnf(c_0_37,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_17,
    [final] ).

cnf(c_0_38,negated_conjecture,
    ( p1(X1)
    | ~ p100(X1)
    | ~ p100(X2)
    | ~ p1(X2)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    i_0_6,
    [final] ).

cnf(c_0_39,negated_conjecture,
    ( p1(X1)
    | p101(X1)
    | ~ p1(esk3_1(X1))
    | ~ r1(esk1_0,X1)
    | ~ p100(esk3_1(X1))
    | ~ p100(X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]),
    [final] ).

cnf(c_0_40,negated_conjecture,
    ( p1(X1)
    | p101(X1)
    | ~ p1(esk2_1(X1))
    | ~ r1(esk1_0,X1)
    | ~ p100(esk2_1(X1))
    | ~ p100(X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_37]),
    [final] ).

cnf(c_0_41,negated_conjecture,
    ( p1(esk3_1(X1))
    | p101(X1)
    | ~ p1(X1)
    | ~ r1(esk1_0,X1)
    | ~ p100(esk3_1(X1))
    | ~ p100(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_36]),
    [final] ).

cnf(c_0_42,negated_conjecture,
    ( p1(esk2_1(X1))
    | p101(X1)
    | ~ p1(X1)
    | ~ r1(esk1_0,X1)
    | ~ p100(esk2_1(X1))
    | ~ p100(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_37]),
    [final] ).

cnf(c_0_43,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p101(X2)
    | ~ p101(X1)
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    i_0_9,
    [final] ).

cnf(c_0_44,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p101(X1)
    | ~ p101(X2)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    i_0_8,
    [final] ).

cnf(c_0_45,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    i_0_16,
    [final] ).

cnf(c_0_46,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p102(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    i_0_15,
    [final] ).

cnf(c_0_47,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p102(esk3_1(X1))
    | ~ r1(esk1_0,X1) ),
    i_0_11,
    [final] ).

cnf(c_0_48,negated_conjecture,
    ( p101(X1)
    | p2(esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_12,
    [final] ).

cnf(c_0_49,negated_conjecture,
    ( p101(X1)
    | p101(esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_14,
    [final] ).

cnf(c_0_50,negated_conjecture,
    ( p101(X1)
    | p101(esk3_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_10,
    [final] ).

cnf(c_0_51,negated_conjecture,
    ( p101(X1)
    | ~ p102(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_5,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( p100(X1)
    | ~ p101(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_4,
    [final] ).

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

cnf(c_0_54,negated_conjecture,
    p100(esk1_0),
    i_0_2,
    [final] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL657+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.36  % Computer : n027.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep  4 20:54:14 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 13.52/3.97  # ENIGMATIC: Solved by autoschedule:
% 13.52/3.97  # No SInE strategy applied
% 13.52/3.97  # Trying AutoSched0 for 150 seconds
% 13.52/3.97  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 13.52/3.97  # and selection function SelectMaxLComplexAvoidPosPred.
% 13.52/3.97  #
% 13.52/3.97  # Preprocessing time       : 0.023 s
% 13.52/3.97  
% 13.52/3.97  # No proof found!
% 13.52/3.97  # SZS status Satisfiable
% 13.52/3.97  # SZS output start Saturation
% See solution above
% 13.52/3.97  
% 13.52/3.97  # -------------------------------------------------
% 13.52/3.97  # User time                : 0.022 s
% 13.52/3.97  # System time              : 0.005 s
% 13.52/3.97  # Total time               : 0.028 s
% 13.52/3.97  # Maximum resident set size: 3328 pages
% 13.52/3.97  
%------------------------------------------------------------------------------