↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n026.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:44:40 AM UTC 2026

% Result   : Theorem 33.68s 6.89s
% Output   : CNFRefutation 33.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   61 (  35 unt;   0 nHn;  14 RR)
%            Number of literals    :   91 (   0 equ;  32 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   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   :  159 (  31 sgn)

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

cnf(i_0_2,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-95ew45dl/input.p',i_0_2) ).

cnf(i_0_3,plain,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-95ew45dl/input.p',i_0_3) ).

cnf(i_0_4,plain,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-95ew45dl/input.p',i_0_4) ).

cnf(i_0_5,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,z),implies(implies(z,y),y)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-95ew45dl/input.p',i_0_5) ).

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

cnf(c_0_12,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    i_0_2 ).

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_11,c_0_12]) ).

cnf(c_0_14,plain,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    i_0_3 ).

cnf(c_0_15,plain,
    is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

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

cnf(c_0_17,plain,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    i_0_4 ).

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

cnf(c_0_19,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))),
    inference(spm,[status(thm)],[c_0_13,c_0_16]) ).

cnf(c_0_20,plain,
    is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_17]) ).

cnf(c_0_22,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

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

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

cnf(c_0_26,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

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

cnf(c_0_29,plain,
    ( is_a_theorem(implies(implies(not(X1),X1),X2))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_30,plain,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X1,implies(X4,X3))))),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_20]) ).

cnf(c_0_32,plain,
    is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_14]) ).

cnf(c_0_33,plain,
    is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_18,c_0_20]) ).

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

cnf(c_0_35,plain,
    is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
    inference(spm,[status(thm)],[c_0_23,c_0_33]) ).

cnf(c_0_37,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))),
    inference(spm,[status(thm)],[c_0_13,c_0_36]) ).

cnf(c_0_39,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(X3,implies(implies(X2,X1),X1)))),
    inference(spm,[status(thm)],[c_0_18,c_0_37]) ).

cnf(c_0_40,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_38]) ).

cnf(c_0_41,plain,
    is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(implies(not(X2),X1),X3))),
    inference(spm,[status(thm)],[c_0_25,c_0_39]) ).

cnf(c_0_42,plain,
    ( is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(implies(X4,X2),X3)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_24]) ).

cnf(c_0_43,plain,
    is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
    inference(spm,[status(thm)],[c_0_40,c_0_37]) ).

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

cnf(c_0_45,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_23,c_0_14]) ).

cnf(c_0_46,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(implies(implies(not(X4),X2),X3))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_11,c_0_42]) ).

cnf(c_0_47,plain,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
    inference(spm,[status(thm)],[c_0_25,c_0_43]) ).

cnf(c_0_48,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_49,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_14]) ).

cnf(c_0_50,plain,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(not(X3),X2),implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_18,c_0_41]) ).

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

cnf(c_0_52,plain,
    is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    inference(spm,[status(thm)],[c_0_44,c_0_20]) ).

cnf(c_0_53,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X2),X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_48]) ).

cnf(c_0_54,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_49]) ).

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

cnf(c_0_56,plain,
    is_a_theorem(implies(not(X1),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_57,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1))),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_59,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_57]) ).

cnf(c_0_60,plain,
    is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(implies(not(X2),X1),X3))),
    inference(spm,[status(thm)],[c_0_13,c_0_58]) ).

cnf(c_0_61,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X3,X2),X2)))),
    inference(spm,[status(thm)],[c_0_59,c_0_48]) ).

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

cnf(c_0_63,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X3),implies(implies(X3,X1),X1)))),
    inference(spm,[status(thm)],[c_0_18,c_0_61]) ).

cnf(c_0_64,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,z),implies(implies(z,y),y)))),
    i_0_5 ).

cnf(c_0_65,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X3),implies(implies(X3,X2),X2)))),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_66,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL393+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.36  % Computer : n026.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 : Sat Sep  5 19:15:57 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.13/0.46  # ENIGMATIC: Selected complete mode:
% 33.68/6.89  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 33.68/6.89  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 32; version: 991; iters: 150)
% 33.68/6.89  # Preprocessing time       : 1.059 s
% 33.68/6.89  # Presaturation interreduction done
% 33.68/6.89  
% 33.68/6.89  # Proof found!
% 33.68/6.89  # SZS status Theorem
% 33.68/6.89  # SZS output start CNFRefutation
% See solution above
% 33.68/6.89  # Training examples: 0 positive, 0 negative
% 33.68/6.89  
% 33.68/6.89  # -------------------------------------------------
% 33.68/6.89  # User time                : 2.907 s
% 33.68/6.89  # System time              : 0.253 s
% 33.68/6.89  # Total time               : 3.159 s
% 33.68/6.89  # ...preprocessing         : 1.059 s
% 33.68/6.89  # ...main loop             : 2.100 s
% 33.68/6.89  # Maximum resident set size: 169544 pages
% 33.68/6.89  
%------------------------------------------------------------------------------