TSTP Solution File: SCT058-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SCT058-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:16:30 EDT 2023

% Result   : Timeout 1.59s 300.14s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   34 (  10 unt;   5 nHn;  22 RR)
%            Number of literals    :   58 (   4 equ;  23 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-5 aty)
%            Number of variables   :   73 (  23 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(c_in(X2,X1,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_mem__def_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_conjecture_0) ).

cnf(cls_mem__def_1,axiom,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_mem__def_1) ).

cnf(cls_insert__code_1,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_insert__code_1) ).

cnf(cls_insert__absorb_0,axiom,
    ( c_Set_Oinsert(X1,X2,X3) = X2
    | ~ hBOOL(c_in(X1,X2,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_insert__absorb_0) ).

cnf(cls_o__eq__dest__lhs_0,axiom,
    hAPP(X1,hAPP(X2,X3)) = hAPP(c_Fun_Ocomp(X1,X2,X4,X5,X6),X3),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_o__eq__dest__lhs_0) ).

cnf(cls_iff_1,axiom,
    ( hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_iff_1) ).

cnf(cls_converseD_0,axiom,
    ( hBOOL(c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)))
    | ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),hAPP(c_Relation_Oconverse(X3,X4),X5),tc_prod(X4,X3))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_converseD_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_conjecture_1) ).

cnf(cls_iff_0,axiom,
    ( hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_iff_0) ).

cnf(cls_converse__iff_1,axiom,
    ( hBOOL(c_in(c_Pair(X1,X2,X3,X4),hAPP(c_Relation_Oconverse(X4,X3),X5),tc_prod(X3,X4)))
    | ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),X5,tc_prod(X4,X3))) ),
    file('/export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p',cls_converse__iff_1) ).

cnf(c_0_11,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(c_in(X2,X1,X3)) ),
    cls_mem__def_0 ).

cnf(c_0_12,negated_conjecture,
    ( hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    cls_conjecture_0 ).

cnf(c_0_13,axiom,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    cls_mem__def_1 ).

cnf(c_0_14,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    cls_insert__code_1 ).

cnf(c_0_15,negated_conjecture,
    ( hBOOL(hAPP(hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X4)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( c_Set_Oinsert(X1,X2,X3) = X2
    | ~ hBOOL(c_in(X1,X2,X3)) ),
    cls_insert__absorb_0 ).

cnf(c_0_18,negated_conjecture,
    ( hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),X1))
    | hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_15]) ).

cnf(c_0_19,axiom,
    hAPP(X1,hAPP(X2,X3)) = hAPP(c_Fun_Ocomp(X1,X2,X4,X5,X6),X3),
    cls_o__eq__dest__lhs_0 ).

cnf(c_0_20,plain,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(c_in(X1,X2,X4)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,axiom,
    ( hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    cls_iff_1 ).

cnf(c_0_22,axiom,
    ( hBOOL(c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)))
    | ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),hAPP(c_Relation_Oconverse(X3,X4),X5),tc_prod(X4,X3))) ),
    cls_converseD_0 ).

cnf(c_0_23,negated_conjecture,
    ( hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x)),X1))
    | hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    ( hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),X2))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    cls_conjecture_1 ).

cnf(c_0_26,axiom,
    ( hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    cls_iff_0 ).

cnf(c_0_27,negated_conjecture,
    hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x)),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_19]) ).

cnf(c_0_29,negated_conjecture,
    hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x)),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_31,axiom,
    ( hBOOL(c_in(c_Pair(X1,X2,X3,X4),hAPP(c_Relation_Oconverse(X4,X3),X5),tc_prod(X3,X4)))
    | ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),X5,tc_prod(X4,X3))) ),
    cls_converse__iff_1 ).

cnf(c_0_32,negated_conjecture,
    hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x),X1)),
    inference(spm,[status(thm)],[c_0_20,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18  % Problem    : SCT058-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.20  % Command    : run_E %s %d THM
% 0.20/0.41  % Computer : n006.cluster.edu
% 0.20/0.41  % Model    : x86_64 x86_64
% 0.20/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41  % Memory   : 8042.1875MB
% 0.20/0.41  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41  % CPULimit   : 2400
% 0.20/0.41  % WCLimit    : 300
% 0.20/0.41  % DateTime   : Mon Oct  2 11:22:40 EDT 2023
% 0.20/0.41  % CPUTime    : 
% 0.27/0.60  Running first-order theorem proving
% 0.27/0.60  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jpdIf3hyLn/E---3.1_14432.p
% 1.59/300.14  # Version: 3.1pre001
% 1.59/300.14  # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.59/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/300.14  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.59/300.14  # Starting new_bool_3 with 600s (2) cores
% 1.59/300.14  # Starting new_bool_1 with 300s (1) cores
% 1.59/300.14  # Starting sh5l with 300s (1) cores
% 1.59/300.14  # new_bool_3 with pid 14589 completed with status 0
% 1.59/300.14  # Result found by new_bool_3
% 1.59/300.14  # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.59/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/300.14  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.59/300.14  # Starting new_bool_3 with 600s (2) cores
% 1.59/300.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.59/300.14  # Search class: FGHSM-FSLS32-DFFFFFNN
% 1.59/300.14  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 1.59/300.14  # Starting SAT001_MinMin_p005000_rr_RG with 200s (1) cores
% 1.59/300.14  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 101s (1) cores
% 1.59/300.14  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 14593 completed with status 0
% 1.59/300.14  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 1.59/300.14  # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.59/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/300.14  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.59/300.14  # Starting new_bool_3 with 600s (2) cores
% 1.59/300.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.59/300.14  # Search class: FGHSM-FSLS32-DFFFFFNN
% 1.59/300.14  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 1.59/300.14  # Starting SAT001_MinMin_p005000_rr_RG with 200s (1) cores
% 1.59/300.14  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 101s (1) cores
% 1.59/300.14  # Preprocessing time       : 0.006 s
% 1.59/300.14  # Presaturation interreduction done
% 1.59/300.14  
% 1.59/300.14  # Proof found!
% 1.59/300.14  # SZS status Unsatisfiable
% 1.59/300.14  # SZS output start CNFRefutation
% See solution above
% 1.59/300.14  # Parsed axioms                        : 641
% 1.59/300.14  # Removed by relevancy pruning/SinE    : 284
% 1.59/300.14  # Initial clauses                      : 357
% 1.59/300.14  # Removed in clause preprocessing      : 0
% 1.59/300.14  # Initial clauses in saturation        : 357
% 1.59/300.14  # Processed clauses                    : 1766
% 1.59/300.14  # ...of these trivial                  : 65
% 1.59/300.14  # ...subsumed                          : 842
% 1.59/300.14  # ...remaining for further processing  : 859
% 1.59/300.14  # Other redundant clauses eliminated   : 45
% 1.59/300.14  # Clauses deleted for lack of memory   : 0
% 1.59/300.14  # Backward-subsumed                    : 26
% 1.59/300.14  # Backward-rewritten                   : 75
% 1.59/300.14  # Generated clauses                    : 5658
% 1.59/300.14  # ...of the previous two non-redundant : 4656
% 1.59/300.14  # ...aggressively subsumed             : 0
% 1.59/300.14  # Contextual simplify-reflections      : 1
% 1.59/300.14  # Paramodulations                      : 5607
% 1.59/300.14  # Factorizations                       : 0
% 1.59/300.14  # NegExts                              : 0
% 1.59/300.14  # Equation resolutions                 : 51
% 1.59/300.14  # Total rewrite steps                  : 1897
% 1.59/300.14  # Propositional unsat checks           : 0
% 1.59/300.14  #    Propositional check models        : 0
% 1.59/300.14  #    Propositional check unsatisfiable : 0
% 1.59/300.14  #    Propositional clauses             : 0
% 1.59/300.14  #    Propositional clauses after purity: 0
% 1.59/300.14  #    Propositional unsat core size     : 0
% 1.59/300.14  #    Propositional preprocessing time  : 0.000
% 1.59/300.14  #    Propositional encoding time       : 0.000
% 1.59/300.14  #    Propositional solver time         : 0.000
% 1.59/300.14  #    Success case prop preproc time    : 0.000
% 1.59/300.14  #    Success case prop encoding time   : 0.000
% 1.59/300.14  #    Success case prop solver time     : 0.000
% 1.59/300.14  # Current number of processed clauses  : 474
% 1.59/300.14  #    Positive orientable unit clauses  : 129
% 1.59/300.14  #    Positive unorientable unit clauses: 11
% 1.59/300.14  #    Negative unit clauses             : 74
% 1.59/300.14  #    Non-unit-clauses                  : 260
% 1.59/300.14  # Current number of unprocessed clauses: 3433
% 1.59/300.14  # ...number of literals in the above   : 6483
% 1.59/300.14  # Current number of archived formulas  : 0
% 1.59/300.14  # Current number of archived clauses   : 385
% 1.59/300.14  # Clause-clause subsumption calls (NU) : 20108
% 1.59/300.14  # Rec. Clause-clause subsumption calls : 16753
% 1.59/300.14  # Non-unit clause-clause subsumptions  : 430
% 1.59/300.14  # Unit Clause-clause subsumption calls : 3408
% 1.59/300.14  # Rewrite failures with RHS unbound    : 0
% 1.59/300.14  # BW rewrite match attempts            : 603
% 1.59/300.14  # BW rewrite match successes           : 92
% 1.59/300.14  # Condensation attempts                : 0
% 1.59/300.14  # Condensation successes               : 0
% 1.59/300.14  # Termbank termtop insertions          : 102543
% 1.59/300.14  
% 1.59/300.14  # -------------------------------------------------
% 1.59/300.14  # User time                : 0.125 s
% 1.59/300.14  # System time              : 0.015 s
% 1.59/300.14  # Total time               : 0.140 s
% 1.59/300.14  # Maximum resident set size: 2780 pages
% 1.59/300.14  
% 1.59/300.14  # -------------------------------------------------
% 1.59/300.14  # User time                : 0.270 s
% 1.59/300.14  # System time              : 0.024 s
% 1.59/300.14  # Total time               : 0.294 s
% 1.59/300.14  # Maximum resident set size: 2224 pages
% 1.59/300.14  % E---3.1 exiting
% 1.59/300.14  % E---3.1 exiting
%------------------------------------------------------------------------------