↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n018.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:49 PM UTC 2026

% Result   : Theorem 7.65s 2.42s
% Output   : CNFRefutation 7.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  16 unt;   0 nHn;  15 RR)
%            Number of literals    :   30 (  29 equ;  10 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_27,negated_conjecture,
    ( X1 = X2
    | linC(X1) != linC(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_27) ).

cnf(i_0_26,plain,
    append(linP(X1),linP(X2)) = linC(c2(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_26) ).

cnf(i_0_25,plain,
    linP(pE) = nil,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_25) ).

cnf(i_0_19,plain,
    append(nil,X1) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_19) ).

cnf(i_0_23,plain,
    cons(a,nil) = linP(pA),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_23) ).

cnf(i_0_20,plain,
    cons(X1,append(X2,X3)) = append(cons(X1,X2),X3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_20) ).

cnf(i_0_17,plain,
    proj1C(c2(X1,X2)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_17) ).

cnf(i_0_15,plain,
    pE != pA,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v7evozwk/lgb.p',i_0_15) ).

cnf(c_0_36,negated_conjecture,
    ( X1 = X2
    | linC(X1) != linC(X2) ),
    i_0_27 ).

cnf(c_0_37,plain,
    append(linP(X1),linP(X2)) = linC(c2(X1,X2)),
    i_0_26 ).

cnf(c_0_38,negated_conjecture,
    ( c2(X1,X2) = X3
    | append(linP(X1),linP(X2)) != linC(X3) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_39,plain,
    linP(pE) = nil,
    i_0_25 ).

cnf(c_0_40,plain,
    append(nil,X1) = X1,
    i_0_19 ).

cnf(c_0_41,plain,
    ( c2(pE,X1) = X2
    | linP(X1) != linC(X2) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_42,plain,
    ( c2(pE,X1) = c2(X2,X3)
    | linP(X1) != append(linP(X2),linP(X3)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_37]) ).

cnf(c_0_43,plain,
    ( c2(pE,X1) = c2(X2,pE)
    | linP(X1) != append(linP(X2),nil) ),
    inference(spm,[status(thm)],[c_0_42,c_0_39]) ).

cnf(c_0_44,plain,
    cons(a,nil) = linP(pA),
    i_0_23 ).

cnf(c_0_45,plain,
    cons(X1,append(X2,X3)) = append(cons(X1,X2),X3),
    i_0_20 ).

cnf(c_0_46,plain,
    proj1C(c2(X1,X2)) = X1,
    i_0_17 ).

cnf(c_0_47,plain,
    ( c2(pE,X1) = c2(pA,pE)
    | linP(X1) != cons(a,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_40]) ).

cnf(c_0_48,plain,
    pE != pA,
    i_0_15 ).

cnf(c_0_49,plain,
    linP(X1) != cons(a,nil),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_46]),c_0_48]) ).

cnf(c_0_50,plain,
    $false,
    inference(sr,[status(thm)],[c_0_44,c_0_49]),
    [proof] ).

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