%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SCT143+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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 : Mon Jul 18 21:16:34 EDT 2022

% Result   : Theorem 8.96s 2.60s
% Output   : CNFRefutation 8.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   6 RR)
%            Number of literals    :   10 (   9 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-3 aty)
%            Number of variables   :   46 (  31 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_580,plain,
    hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lt6pg_mf/lgb.p',i_0_580) ).

cnf(i_0_814,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-lt6pg_mf/lgb.p',i_0_814) ).

cnf(i_0_812,plain,
    hAPP(c_COMBI(X1),X2) = X2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lt6pg_mf/lgb.p',i_0_812) ).

cnf(c_0_818,plain,
    hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
    i_0_580 ).

cnf(c_0_819,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
    i_0_814 ).

cnf(c_0_820,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_List_Olist_OCons(X4)),X5),X6) != hAPP(X5,X6),
    inference(spm,[status(thm)],[c_0_818,c_0_819]) ).

cnf(c_0_821,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),X8),X9) != hAPP(X9,hAPP(X8,X9)),
    inference(spm,[status(thm)],[c_0_820,c_0_819]) ).

cnf(c_0_822,plain,
    hAPP(c_COMBI(X1),X2) = X2,
    i_0_812 ).

cnf(c_0_823,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),c_COMBI(X8)),X9) != hAPP(X9,X9),
    inference(spm,[status(thm)],[c_0_821,c_0_822]) ).

cnf(c_0_824,plain,
    $false,
    inference(er,[status(thm)],[c_0_823]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SCT143+1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  2 00:40:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.49  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.96/2.60  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.96/2.60  # No SInE strategy applied
% 8.96/2.60  # Trying AutoSched0 for 150 seconds
% 8.96/2.60  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.96/2.60  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.96/2.60  #
% 8.96/2.60  # Preprocessing time       : 0.023 s
% 8.96/2.60  # Presaturation interreduction done
% 8.96/2.60  
% 8.96/2.60  # Proof found!
% 8.96/2.60  # SZS status Theorem
% 8.96/2.60  # SZS output start CNFRefutation
% See solution above
% 8.96/2.60  # Training examples: 0 positive, 0 negative
% 8.96/2.60  
% 8.96/2.60  # -------------------------------------------------
% 8.96/2.60  # User time                : 0.036 s
% 8.96/2.60  # System time              : 0.004 s
% 8.96/2.60  # Total time               : 0.040 s
% 8.96/2.60  # Maximum resident set size: 7220 pages
% 8.96/2.60  
%------------------------------------------------------------------------------