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

% Computer : n020.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:01:55 EDT 2022

% Result   : Theorem 9.63s 3.69s
% Output   : CNFRefutation 9.63s
% 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    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-3 aty)
%            Number of variables   :   55 (  33 sgn)

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

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

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

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

cnf(c_0_2975,plain,
    hAPP(hAPP(hAPP(c_COMBB(X1,X2,X3),X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
    i_0_2968 ).

cnf(c_0_2976,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
    i_0_2970 ).

cnf(c_0_2977,plain,
    hAPP(c_Nat_OSuc,X1) != X1,
    i_0_2457 ).

cnf(c_0_2978,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBB(X4,X5,X6),X7)),X8),X9) = hAPP(X7,hAPP(X9,hAPP(X8,X9))),
    inference(spm,[status(thm)],[c_0_2975,c_0_2976]) ).

cnf(c_0_2979,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBB(X4,X5,X6),c_Nat_OSuc)),X7),X8) != hAPP(X8,hAPP(X7,X8)),
    inference(spm,[status(thm)],[c_0_2977,c_0_2978]) ).

cnf(c_0_2980,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    i_0_257 ).

cnf(c_0_2981,plain,
    hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBB(X4,X5,X6),c_Nat_OSuc)),c_Set_OCollect(X7)),X8) != hAPP(X8,X8),
    inference(spm,[status(thm)],[c_0_2979,c_0_2980]) ).

cnf(c_0_2982,plain,
    $false,
    inference(er,[status(thm)],[c_0_2981]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW292+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun  5 17:59:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.49  # ENIGMATIC: Selected SinE mode:
% 0.51/0.73  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.73  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.51/0.73  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.51/0.73  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.63/3.69  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.63/3.69  # No SInE strategy applied
% 9.63/3.69  # Trying AutoSched0 for 150 seconds
% 9.63/3.69  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SP_PI_S0Y
% 9.63/3.69  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.63/3.69  #
% 9.63/3.69  # Preprocessing time       : 0.014 s
% 9.63/3.69  
% 9.63/3.69  # Proof found!
% 9.63/3.69  # SZS status Theorem
% 9.63/3.69  # SZS output start CNFRefutation
% See solution above
% 9.63/3.69  # Training examples: 0 positive, 0 negative
% 9.63/3.69  
% 9.63/3.69  # -------------------------------------------------
% 9.63/3.69  # User time                : 0.058 s
% 9.63/3.69  # System time              : 0.008 s
% 9.63/3.69  # Total time               : 0.066 s
% 9.63/3.69  # Maximum resident set size: 9484 pages
% 9.63/3.69  
%------------------------------------------------------------------------------