↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n010.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:12 AM UTC 2026

% Result   : Theorem 12.58s 3.41s
% Output   : CNFRefutation 12.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   44 (  16 unt;  17 nHn;  42 RR)
%            Number of literals    :  131 (   0 equ;  70 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   63 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,negated_conjecture,
    ( r1(X1,esk4_2(X2,X1))
    | r1(X3,esk5_2(X2,X3))
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_11) ).

cnf(i_0_6,negated_conjecture,
    r1(esk1_0,esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_6) ).

cnf(i_0_13,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk3_3(X3,X4,X2))
    | ~ r1(X4,X1)
    | ~ r1(X4,X2)
    | ~ r1(X3,X4)
    | ~ r1(esk1_0,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_13) ).

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

cnf(i_0_5,negated_conjecture,
    r1(esk7_0,esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    r1(esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_4) ).

cnf(i_0_3,negated_conjecture,
    ~ p1(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_3) ).

cnf(i_0_9,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk5_2(X3,X2))
    | ~ r1(X3,X4)
    | ~ r1(X3,X2)
    | ~ r1(esk1_0,X3)
    | ~ r1(esk4_2(X3,X4),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_9) ).

cnf(i_0_12,negated_conjecture,
    ( p1(X1)
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(X4,X2)
    | ~ r1(esk1_0,X4)
    | ~ p1(esk3_3(X4,X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_12) ).

cnf(i_0_2,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_2) ).

cnf(i_0_10,negated_conjecture,
    ( r1(X1,esk4_2(X2,X1))
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(esk1_0,X2)
    | ~ p1(esk5_2(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_10) ).

cnf(i_0_8,negated_conjecture,
    ( p1(X1)
    | ~ r1(X2,X3)
    | ~ r1(X2,X4)
    | ~ r1(esk1_0,X2)
    | ~ p1(esk5_2(X2,X4))
    | ~ r1(esk4_2(X2,X3),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ansl4gks/input.p',i_0_8) ).

cnf(c_0_26,negated_conjecture,
    ( r1(X1,esk4_2(X2,X1))
    | r1(X3,esk5_2(X2,X3))
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(esk1_0,X2) ),
    i_0_11 ).

cnf(c_0_27,negated_conjecture,
    r1(esk1_0,esk7_0),
    i_0_6 ).

cnf(c_0_28,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk3_3(X3,X4,X2))
    | ~ r1(X4,X1)
    | ~ r1(X4,X2)
    | ~ r1(X3,X4)
    | ~ r1(esk1_0,X3) ),
    i_0_13 ).

cnf(c_0_29,negated_conjecture,
    ( r1(X1,esk4_2(esk7_0,X1))
    | r1(X2,esk5_2(esk7_0,X2))
    | ~ r1(esk7_0,X2)
    | ~ r1(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    r1(X1,X1),
    i_0_1 ).

cnf(c_0_31,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk3_3(esk7_0,X3,X2))
    | ~ r1(esk7_0,X3)
    | ~ r1(X3,X2)
    | ~ r1(X3,X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    r1(esk7_0,esk8_0),
    i_0_5 ).

cnf(c_0_33,plain,
    ( r1(esk7_0,esk5_2(esk7_0,esk7_0))
    | r1(X1,esk4_2(esk7_0,X1))
    | ~ r1(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk3_3(esk7_0,esk8_0,X2))
    | ~ r1(esk8_0,X2)
    | ~ r1(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    ( r1(esk8_0,esk4_2(esk7_0,esk8_0))
    | r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_33,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ( p1(X1)
    | r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | r1(esk7_0,esk5_2(esk7_0,esk7_0))
    | ~ r1(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,negated_conjecture,
    r1(esk8_0,esk9_0),
    i_0_4 ).

cnf(c_0_38,negated_conjecture,
    ~ p1(esk9_0),
    i_0_3 ).

cnf(c_0_39,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk5_2(X3,X2))
    | ~ r1(X3,X4)
    | ~ r1(X3,X2)
    | ~ r1(esk1_0,X3)
    | ~ r1(esk4_2(X3,X4),X1) ),
    i_0_9 ).

cnf(c_0_40,negated_conjecture,
    ( r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    ( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | r1(esk7_0,esk5_2(esk7_0,esk7_0))
    | r1(X1,esk5_2(esk7_0,X1))
    | ~ r1(esk7_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_27]),c_0_32])]) ).

cnf(c_0_42,negated_conjecture,
    ( p1(X1)
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(X4,X2)
    | ~ r1(esk1_0,X4)
    | ~ p1(esk3_3(X4,X2,X3)) ),
    i_0_12 ).

cnf(c_0_43,plain,
    ( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_30]) ).

cnf(c_0_44,negated_conjecture,
    ( p1(X1)
    | r1(esk7_0,esk5_2(esk7_0,esk7_0))
    | ~ r1(esk8_0,X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27]),c_0_32])]),c_0_35]) ).

cnf(c_0_45,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_0,X1) ),
    i_0_2 ).

cnf(c_0_46,negated_conjecture,
    r1(esk7_0,esk5_2(esk7_0,esk7_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_38]) ).

cnf(c_0_47,negated_conjecture,
    ( r1(X1,esk4_2(X2,X1))
    | ~ r1(X2,X1)
    | ~ r1(X2,X3)
    | ~ r1(esk1_0,X2)
    | ~ p1(esk5_2(X2,X3)) ),
    i_0_10 ).

cnf(c_0_48,negated_conjecture,
    p1(esk5_2(esk7_0,esk7_0)),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    ( r1(X1,esk4_2(esk7_0,X1))
    | ~ r1(esk7_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27]),c_0_30])]) ).

cnf(c_0_50,negated_conjecture,
    r1(esk8_0,esk4_2(esk7_0,esk8_0)),
    inference(spm,[status(thm)],[c_0_49,c_0_32]) ).

cnf(c_0_51,negated_conjecture,
    ( p1(X1)
    | r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | ~ r1(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_50]) ).

cnf(c_0_52,negated_conjecture,
    ( p1(X1)
    | ~ r1(X2,X3)
    | ~ r1(X2,X4)
    | ~ r1(esk1_0,X2)
    | ~ p1(esk5_2(X2,X4))
    | ~ r1(esk4_2(X2,X3),X1) ),
    i_0_8 ).

cnf(c_0_53,negated_conjecture,
    r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_38]) ).

cnf(c_0_54,negated_conjecture,
    ( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
    | ~ p1(esk5_2(esk7_0,X1))
    | ~ r1(esk7_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_27]),c_0_32])]) ).

cnf(c_0_55,negated_conjecture,
    p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_48]),c_0_30])]) ).

cnf(c_0_56,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk8_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_55]),c_0_27]),c_0_32]),c_0_50])]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_37]),c_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 00:37:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.12/0.41  # ENIGMATIC: Selected complete mode:
% 12.58/3.41  # ENIGMATIC: Solved by autoschedule:
% 12.58/3.41  # No SInE strategy applied
% 12.58/3.41  # Trying AutoSched0 for 150 seconds
% 12.58/3.41  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CA
% 12.58/3.41  # and selection function SelectAntiRROptimalLit.
% 12.58/3.41  #
% 12.58/3.41  # Preprocessing time       : 0.023 s
% 12.58/3.41  # Presaturation interreduction done
% 12.58/3.41  
% 12.58/3.41  # Proof found!
% 12.58/3.41  # SZS status Theorem
% 12.58/3.41  # SZS output start CNFRefutation
% See solution above
% 12.58/3.41  # Training examples: 0 positive, 0 negative
% 12.58/3.41  
% 12.58/3.41  # -------------------------------------------------
% 12.58/3.41  # User time                : 0.077 s
% 12.58/3.41  # System time              : 0.006 s
% 12.58/3.41  # Total time               : 0.083 s
% 12.58/3.41  # Maximum resident set size: 3328 pages
% 12.58/3.41  
%------------------------------------------------------------------------------