↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 06:59:46 PM UTC 2026

% Result   : Theorem 21.03s 3.93s
% Output   : CNFRefutation 21.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   38 (  31 unt;   3 nHn;  21 RR)
%            Number of literals    :   48 (  47 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-2 aty)
%            Number of variables   :   46 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
    append(lin(X1),append(cons(mul,nil),lin(X2))) = lin(x2(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_38) ).

cnf(i_0_34,plain,
    cons(X1,append(X2,X3)) = append(cons(X1,X2),X3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_34) ).

cnf(i_0_33,plain,
    append(nil,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_33) ).

cnf(i_0_40,plain,
    cons(y,nil) = lin(eY),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_40) ).

cnf(i_0_39,plain,
    cons(x,nil) = lin(eX),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_39) ).

cnf(i_0_41,negated_conjecture,
    ( assoc(X1) = assoc(X2)
    | lin(X1) != lin(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_41) ).

cnf(i_0_22,plain,
    proj22(x2(X1,X2)) = X2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_22) ).

cnf(i_0_32,plain,
    x2(assoc(X1),assoc(X2)) = assoc(x2(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_32) ).

cnf(i_0_26,plain,
    x2(X1,X2) != eX,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_26) ).

cnf(i_0_29,plain,
    ( assoc(X1) = X1
    | z(proj1(X1),proj2(X1)) = X1
    | x2(proj12(X1),proj22(X1)) = X1 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_29) ).

cnf(i_0_24,plain,
    z(X1,X2) != eX,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi09xdqh/input.p',i_0_24) ).

cnf(c_0_53,plain,
    append(lin(X1),append(cons(mul,nil),lin(X2))) = lin(x2(X1,X2)),
    i_0_38 ).

cnf(c_0_54,plain,
    cons(X1,append(X2,X3)) = append(cons(X1,X2),X3),
    i_0_34 ).

cnf(c_0_55,plain,
    append(nil,X1) = X1,
    i_0_33 ).

cnf(c_0_56,plain,
    append(lin(X1),cons(mul,lin(X2))) = lin(x2(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).

cnf(c_0_57,plain,
    cons(y,nil) = lin(eY),
    i_0_40 ).

cnf(c_0_58,plain,
    cons(y,cons(mul,lin(X1))) = lin(x2(eY,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_54]),c_0_55]) ).

cnf(c_0_59,plain,
    cons(x,nil) = lin(eX),
    i_0_39 ).

cnf(c_0_60,plain,
    cons(y,cons(mul,cons(y,nil))) = lin(x2(eY,eY)),
    inference(spm,[status(thm)],[c_0_58,c_0_57]) ).

cnf(c_0_61,plain,
    append(lin(X1),cons(mul,cons(x,nil))) = lin(x2(X1,eX)),
    inference(spm,[status(thm)],[c_0_56,c_0_59]) ).

cnf(c_0_62,plain,
    append(lin(x2(eY,eY)),X1) = cons(y,cons(mul,cons(y,X1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_60]),c_0_54]),c_0_54]),c_0_55]) ).

cnf(c_0_63,plain,
    cons(y,cons(mul,cons(x,nil))) = lin(x2(eY,eX)),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_64,negated_conjecture,
    ( assoc(X1) = assoc(X2)
    | lin(X1) != lin(X2) ),
    i_0_41 ).

cnf(c_0_65,plain,
    lin(x2(x2(eY,eY),eX)) = lin(x2(eY,x2(eY,eX))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_58]) ).

cnf(c_0_66,plain,
    proj22(x2(X1,X2)) = X2,
    i_0_22 ).

cnf(c_0_67,plain,
    x2(assoc(X1),assoc(X2)) = assoc(x2(X1,X2)),
    i_0_32 ).

cnf(c_0_68,negated_conjecture,
    ( assoc(x2(x2(eY,eY),eX)) = assoc(X1)
    | lin(x2(eY,x2(eY,eX))) != lin(X1) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_69,plain,
    x2(X1,X2) != eX,
    i_0_26 ).

cnf(c_0_70,plain,
    proj22(assoc(x2(X1,X2))) = assoc(X2),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_71,negated_conjecture,
    assoc(x2(x2(eY,eY),eX)) = assoc(x2(eY,x2(eY,eX))),
    inference(er,[status(thm)],[c_0_68]) ).

cnf(c_0_72,plain,
    ( assoc(X1) = X1
    | z(proj1(X1),proj2(X1)) = X1
    | x2(proj12(X1),proj22(X1)) = X1 ),
    i_0_29 ).

cnf(c_0_73,plain,
    assoc(x2(X1,X2)) != eX,
    inference(spm,[status(thm)],[c_0_69,c_0_67]) ).

cnf(c_0_74,plain,
    assoc(x2(eY,eX)) = assoc(eX),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_70]) ).

cnf(c_0_75,plain,
    z(X1,X2) != eX,
    i_0_24 ).

cnf(c_0_76,plain,
    ( z(proj1(X1),proj2(X1)) = X1
    | assoc(X1) = X1
    | X1 != eX ),
    inference(spm,[status(thm)],[c_0_69,c_0_72]) ).

cnf(c_0_77,plain,
    assoc(eX) != eX,
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_78,plain,
    ( assoc(X1) = X1
    | X1 != eX ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_79,plain,
    $false,
    inference(spm,[status(thm)],[c_0_77,c_0_78]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX185+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.15/0.34  % Computer : n029.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Tue May  5 09:32:46 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 21.03/3.93  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 21.03/3.93  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 26; version: 991; iters: 150)
% 21.03/3.93  # Preprocessing time       : 1.087 s
% 21.03/3.93  
% 21.03/3.93  # Proof found!
% 21.03/3.93  # SZS status Theorem
% 21.03/3.93  # SZS output start CNFRefutation
% See solution above
% 21.03/3.93  # Training examples: 0 positive, 0 negative
% 21.03/3.93  
% 21.03/3.93  # -------------------------------------------------
% 21.03/3.93  # User time                : 1.613 s
% 21.03/3.93  # System time              : 0.146 s
% 21.03/3.93  # Total time               : 1.759 s
% 21.03/3.93  # ...preprocessing         : 1.087 s
% 21.03/3.93  # ...main loop             : 0.672 s
% 21.03/3.93  # Maximum resident set size: 178632 pages
% 21.03/3.93  
%------------------------------------------------------------------------------