↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n001.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:52 PM UTC 2026

% Result   : Theorem 18.74s 3.87s
% Output   : CNFRefutation 18.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   25 (   9 unt;   0 nHn;  21 RR)
%            Number of literals    :   53 (  27 equ;  41 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   78 (  26 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_36,negated_conjecture,
    ~ tc(nil,X1,arr(arr(a,arr(a,b)),arr(a,b))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_36) ).

cnf(i_0_31,plain,
    ( tc(X1,lam(X2),arr(X3,X4))
    | ~ tc(cons(X3,X1),X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_31) ).

cnf(i_0_27,plain,
    ( tc(X1,app(X2,X3,X4),X5)
    | ~ tc(X1,X3,X4)
    | ~ tc(X1,X2,arr(X4,X5)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_27) ).

cnf(i_0_34,plain,
    ( tc(X1,var(X2),X3)
    | X4 != X3
    | index(X1,X2) != just(X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_34) ).

cnf(i_0_25,plain,
    index(cons(X1,X2),zero) = just(X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_25) ).

cnf(i_0_26,plain,
    index(cons(X1,X2),suc(X3)) = index(X2,X3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-603l3luu/input.p',i_0_26) ).

cnf(c_0_43,negated_conjecture,
    ~ tc(nil,X1,arr(arr(a,arr(a,b)),arr(a,b))),
    i_0_36 ).

cnf(c_0_44,plain,
    ( tc(X1,lam(X2),arr(X3,X4))
    | ~ tc(cons(X3,X1),X2,X4) ),
    i_0_31 ).

cnf(c_0_45,negated_conjecture,
    ~ tc(cons(arr(a,arr(a,b)),nil),X1,arr(a,b)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_46,plain,
    ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,b),
    inference(spm,[status(thm)],[c_0_45,c_0_44]) ).

cnf(c_0_47,plain,
    ( tc(X1,app(X2,X3,X4),X5)
    | ~ tc(X1,X3,X4)
    | ~ tc(X1,X2,arr(X4,X5)) ),
    i_0_27 ).

cnf(c_0_48,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,arr(X2,b))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X3,X2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_49,plain,
    ( tc(X1,var(X2),X3)
    | X4 != X3
    | index(X1,X2) != just(X4) ),
    i_0_34 ).

cnf(c_0_50,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,arr(X2,arr(X3,b)))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_47]) ).

cnf(c_0_51,plain,
    ( tc(X1,var(X2),X3)
    | index(X1,X2) != just(X3) ),
    inference(er,[status(thm)],[c_0_49]) ).

cnf(c_0_52,plain,
    ( index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b)))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_53,plain,
    ( index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b)))
    | index(cons(a,cons(arr(a,arr(a,b)),nil)),X4) != just(X3)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_51]) ).

cnf(c_0_54,plain,
    ( index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b)))
    | index(cons(a,cons(arr(a,arr(a,b)),nil)),X4) != just(X3)
    | index(cons(a,cons(arr(a,arr(a,b)),nil)),X5) != just(X2) ),
    inference(spm,[status(thm)],[c_0_53,c_0_51]) ).

cnf(c_0_55,plain,
    index(cons(X1,X2),zero) = just(X1),
    i_0_25 ).

cnf(c_0_56,plain,
    ( index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b)))
    | index(cons(a,cons(arr(a,arr(a,b)),nil)),X4) != just(X2)
    | just(a) != just(X3) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_57,plain,
    ( index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b)))
    | just(a) != just(X2)
    | just(a) != just(X3) ),
    inference(spm,[status(thm)],[c_0_56,c_0_55]) ).

cnf(c_0_58,plain,
    index(cons(X1,X2),suc(X3)) = index(X2,X3),
    i_0_26 ).

cnf(c_0_59,plain,
    ( index(cons(arr(a,arr(a,b)),nil),X1) != just(arr(X2,arr(X3,b)))
    | just(a) != just(X2)
    | just(a) != just(X3) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_60,plain,
    ( just(arr(a,arr(a,b))) != just(arr(X1,arr(X2,b)))
    | just(a) != just(X1)
    | just(a) != just(X2) ),
    inference(spm,[status(thm)],[c_0_59,c_0_55]) ).

cnf(c_0_61,plain,
    $false,
    inference(er,[status(thm)],[c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX224+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.16/0.34  % Computer : n001.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue May  5 12:39:35 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 18.74/3.87  # ENIGMATIC: Solved by autoschedule:
% 18.74/3.87  # No SInE strategy applied
% 18.74/3.87  # Trying AutoSched0 for 150 seconds
% 18.74/3.87  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 18.74/3.87  # and selection function SelectComplexExceptUniqMaxHorn.
% 18.74/3.87  #
% 18.74/3.87  # Preprocessing time       : 0.023 s
% 18.74/3.87  # Presaturation interreduction done
% 18.74/3.87  
% 18.74/3.87  # Proof found!
% 18.74/3.87  # SZS status Theorem
% 18.74/3.87  # SZS output start CNFRefutation
% See solution above
% 18.74/3.87  # Training examples: 0 positive, 0 negative
% 18.74/3.87  
% 18.74/3.87  # -------------------------------------------------
% 18.74/3.87  # User time                : 1.388 s
% 18.74/3.87  # System time              : 0.008 s
% 18.74/3.87  # Total time               : 1.396 s
% 18.74/3.87  # Maximum resident set size: 7120 pages
% 18.74/3.87  
%------------------------------------------------------------------------------