↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n007.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:52 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ceqdei4_/input.p',i_0_1) ).

cnf(i_0_2,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ceqdei4_/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ceqdei4_/input.p',i_0_3) ).

cnf(c_0_7,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    i_0_1 ).

cnf(c_0_8,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4)))),
    i_0_2 ).

cnf(c_0_9,plain,
    ( is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))),implies(X5,X2)))
    | ~ is_a_theorem(implies(X5,X4)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,implies(X2,X4)),implies(X5,implies(not(X2),not(X1)))))
    | ~ is_a_theorem(implies(X1,X5)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,X3))
    | ~ is_a_theorem(implies(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(implies(implies(implies(implies(X4,implies(X5,X6)),implies(X2,implies(not(X5),not(X1)))),implies(X1,X5)),X3)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
    | ~ is_a_theorem(implies(X3,implies(implies(X5,implies(X4,X6)),implies(X2,implies(not(X4),not(X1)))))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    ~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
    i_0_3 ).

cnf(c_0_16,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_14,c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.37  % Computer : n007.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep  5 16:11:41 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 11.68/3.69  # ENIGMATIC: Solved by autoschedule:
% 11.68/3.69  # No SInE strategy applied
% 11.68/3.69  # Trying AutoSched0 for 150 seconds
% 11.68/3.69  # AutoSched0-Mode selected heuristic G_____0019_C18_F1_PI_SE_CS_SP_S0Y
% 11.68/3.69  # and selection function SelectMaxLComplexAvoidPosPred.
% 11.68/3.69  #
% 11.68/3.69  # Preprocessing time       : 0.023 s
% 11.68/3.69  
% 11.68/3.69  # Proof found!
% 11.68/3.69  # SZS status Theorem
% 11.68/3.69  # SZS output start CNFRefutation
% See solution above
% 11.68/3.69  # Training examples: 0 positive, 0 negative
% 11.68/3.69  
% 11.68/3.69  # -------------------------------------------------
% 11.68/3.69  # User time                : 0.020 s
% 11.68/3.69  # System time              : 0.009 s
% 11.68/3.69  # Total time               : 0.029 s
% 11.68/3.69  # Maximum resident set size: 3328 pages
% 11.68/3.69  
%------------------------------------------------------------------------------