↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n032.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  : 600s
% DateTime : Thu Jul 21 00:02:05 EDT 2022

% Result   : Theorem 8.56s 3.38s
% Output   : CNFRefutation 8.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   12 (  12 unt;   0 nHn;   5 RR)
%            Number of literals    :   12 (  11 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-4 aty)
%            Number of variables   :   55 (  33 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1967,plain,
    hAPP(hAPP(c_Fun_Ocomp(X1,X2,X3,X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ofr0yy2/lgb.p',i_0_1967) ).

cnf(i_0_2920,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ofr0yy2/lgb.p',i_0_2920) ).

cnf(i_0_2488,plain,
    hAPP(c_Nat_OSuc,X1) != X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ofr0yy2/lgb.p',i_0_2488) ).

cnf(i_0_339,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ofr0yy2/lgb.p',i_0_339) ).

cnf(c_0_2925,plain,
    hAPP(hAPP(c_Fun_Ocomp(X1,X2,X3,X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
    i_0_1967 ).

cnf(c_0_2926,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
    i_0_2920 ).

cnf(c_0_2927,plain,
    hAPP(c_Nat_OSuc,X1) != X1,
    i_0_2488 ).

cnf(c_0_2928,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_Fun_Ocomp(X4,X5,X6,X7)),X8),X9) = hAPP(X7,hAPP(X9,hAPP(X8,X9))),
    inference(spm,[status(thm)],[c_0_2925,c_0_2926]) ).

cnf(c_0_2929,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_Fun_Ocomp(X4,X5,X6,c_Nat_OSuc)),X7),X8) != hAPP(X8,hAPP(X7,X8)),
    inference(spm,[status(thm)],[c_0_2927,c_0_2928]) ).

cnf(c_0_2930,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    i_0_339 ).

cnf(c_0_2931,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_Fun_Ocomp(X4,X5,X6,c_Nat_OSuc)),c_Set_OCollect(X7)),X8) != hAPP(X8,X8),
    inference(spm,[status(thm)],[c_0_2929,c_0_2930]) ).

cnf(c_0_2932,plain,
    $false,
    inference(er,[status(thm)],[c_0_2931]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWW359+1 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jun  5 18:11:50 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.41  # ENIGMATIC: Selected SinE mode:
% 0.43/0.61  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.61  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.43/0.61  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.43/0.61  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.56/3.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.56/3.38  # No SInE strategy applied
% 8.56/3.38  # Trying AutoSched0 for 150 seconds
% 8.56/3.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.56/3.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.56/3.38  #
% 8.56/3.38  # Preprocessing time       : 0.017 s
% 8.56/3.38  # Presaturation interreduction done
% 8.56/3.38  
% 8.56/3.38  # Proof found!
% 8.56/3.38  # SZS status Theorem
% 8.56/3.38  # SZS output start CNFRefutation
% See solution above
% 8.56/3.38  # Training examples: 0 positive, 0 negative
% 8.56/3.38  
% 8.56/3.38  # -------------------------------------------------
% 8.56/3.38  # User time                : 0.063 s
% 8.56/3.38  # System time              : 0.008 s
% 8.56/3.38  # Total time               : 0.071 s
% 8.56/3.38  # Maximum resident set size: 9584 pages
% 8.56/3.38  
%------------------------------------------------------------------------------