TSTP Solution File: SWW364+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n022.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:06 EDT 2022

% Result   : Theorem 9.59s 3.46s
% Output   : CNFRefutation 9.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   26 (  18 unt;   0 nHn;  15 RR)
%            Number of literals    :   34 (  18 equ;  11 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :   45 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2402,plain,
    hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_Set_OCollect(X1),hAPP(c_fequal,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_2402) ).

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

cnf(i_0_2403,plain,
    hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,X1,tc_HOL_Obool),c_fequal),X2)) = hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_2403) ).

cnf(i_0_127,plain,
    ( v_P(X1,X2)
    | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),X2),X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_127) ).

cnf(i_0_2513,plain,
    ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X2),X3))
    | hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(X1,tc_HOL_Obool)),X2),X3) != X3 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_2513) ).

cnf(i_0_1053,plain,
    hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(X1,tc_HOL_Obool)),hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,X1,tc_HOL_Obool),c_fequal),X2))),X3) = hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_1053) ).

cnf(i_0_13,negated_conjecture,
    ~ v_P(v_G,hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_13) ).

cnf(i_0_1046,plain,
    ( hAPP(hAPP(c_Set_Oinsert(X1),X2),X3) = X3
    | ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_1046) ).

cnf(i_0_12,hypothesis,
    hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xmbdt56t/lgb.p',i_0_12) ).

cnf(c_0_2523,plain,
    hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_Set_OCollect(X1),hAPP(c_fequal,X2)),
    i_0_2402 ).

cnf(c_0_2524,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    i_0_333 ).

cnf(c_0_2525,plain,
    hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,X1,tc_HOL_Obool),c_fequal),X2)) = hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),
    i_0_2403 ).

cnf(c_0_2526,plain,
    hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_fequal,X2),
    inference(rw,[status(thm)],[c_0_2523,c_0_2524]) ).

cnf(c_0_2527,plain,
    ( v_P(X1,X2)
    | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),X2),X1)) ),
    i_0_127 ).

cnf(c_0_2528,plain,
    ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X2),X3))
    | hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(X1,tc_HOL_Obool)),X2),X3) != X3 ),
    i_0_2513 ).

cnf(c_0_2529,plain,
    hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(X1,tc_HOL_Obool)),hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,X1,tc_HOL_Obool),c_fequal),X2))),X3) = hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),
    i_0_1053 ).

cnf(c_0_2530,plain,
    hAPP(hAPP(c_COMBC(X1,X1,tc_HOL_Obool),c_fequal),X2) = hAPP(c_fequal,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_2525,c_0_2524]),c_0_2526]) ).

cnf(c_0_2531,negated_conjecture,
    ~ v_P(v_G,hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),
    i_0_13 ).

cnf(c_0_2532,plain,
    ( v_P(X1,X2)
    | hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(t_a,tc_HOL_Obool)),X2),X1) != X1 ),
    inference(spm,[status(thm)],[c_0_2527,c_0_2528]) ).

cnf(c_0_2533,plain,
    hAPP(hAPP(c_Lattices_Osemilattice__sup__class_Osup(tc_fun(X1,tc_HOL_Obool)),hAPP(c_fequal,X2)),X3) = hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_2529,c_0_2524]),c_0_2530]) ).

cnf(c_0_2534,plain,
    ( hAPP(hAPP(c_Set_Oinsert(X1),X2),X3) = X3
    | ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
    i_0_1046 ).

cnf(c_0_2535,hypothesis,
    hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
    i_0_12 ).

cnf(c_0_2536,negated_conjecture,
    ~ v_P(v_G,hAPP(c_fequal,hAPP(v_mgt__call,v_pn))),
    inference(rw,[status(thm)],[c_0_2531,c_0_2526]) ).

cnf(c_0_2537,plain,
    ( v_P(X1,hAPP(c_fequal,X2))
    | hAPP(hAPP(c_Set_Oinsert(t_a),X2),X1) != X1 ),
    inference(spm,[status(thm)],[c_0_2532,c_0_2533]) ).

cnf(c_0_2538,hypothesis,
    hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G) = v_G,
    inference(spm,[status(thm)],[c_0_2534,c_0_2535]) ).

cnf(c_0_2539,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2536,c_0_2537]),c_0_2538])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWW364+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun  5 08:54:37 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.49  # ENIGMATIC: Selected SinE mode:
% 0.50/0.74  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.74  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.50/0.74  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.50/0.74  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.59/3.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.59/3.46  # No SInE strategy applied
% 9.59/3.46  # Trying AutoSched0 for 150 seconds
% 9.59/3.46  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.59/3.46  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.59/3.46  #
% 9.59/3.46  # Preprocessing time       : 0.021 s
% 9.59/3.46  # Presaturation interreduction done
% 9.59/3.46  
% 9.59/3.46  # Proof found!
% 9.59/3.46  # SZS status Theorem
% 9.59/3.46  # SZS output start CNFRefutation
% See solution above
% 9.59/3.46  # Training examples: 0 positive, 0 negative
% 9.59/3.46  
% 9.59/3.46  # -------------------------------------------------
% 9.59/3.46  # User time                : 0.026 s
% 9.59/3.46  # System time              : 0.007 s
% 9.59/3.46  # Total time               : 0.033 s
% 9.59/3.46  # Maximum resident set size: 9584 pages
% 9.59/3.46  
%------------------------------------------------------------------------------