TSTP Solution File: PUZ040-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : PUZ040-1 : TPTP v8.1.2. Bugfixed v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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:12:47 EDT 2023

% Result   : Timeout 0.59s 300.16s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   47 (  23 unt;   0 nHn;  47 RR)
%            Number of literals    :   71 (   0 equ;  26 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-12 aty)
%            Number of functors    :   14 (  14 usr;   1 con; 0-2 aty)
%            Number of variables   :  310 (  22 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(v3_down,axiom,
    ( state(X1,X2,X3,v3(s(X4),X5),X6,X7,X8,X9,X10,X11,e1(X4,X5),X12)
    | ~ state(X1,X2,X3,v3(X4,X5),X6,X7,X8,X9,X10,X11,e1(s(s(X4)),X5),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',v3_down) ).

cnf(initial_state,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',initial_state) ).

cnf(v1_down,axiom,
    ( state(X1,v1(s(X2),X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(X2,X3),X12)
    | ~ state(X1,v1(X2,X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(s(s(X2)),X3),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',v1_down) ).

cnf(swap_blanks,axiom,
    ( state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X13,X14),e2(X11,X12))
    | ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X11,X12),e2(X13,X14)) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',swap_blanks) ).

cnf(v4_down,axiom,
    ( state(X1,X2,X3,X4,v4(s(X5),X6),X7,X8,X9,X10,X11,e1(X5,X6),X12)
    | ~ state(X1,X2,X3,X4,v4(X5,X6),X7,X8,X9,X10,X11,e1(s(s(X5)),X6),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',v4_down) ).

cnf(h_right,axiom,
    ( state(X1,X2,X3,X4,X5,h(X6,s(X7)),X8,X9,X10,X11,e1(X6,X7),X12)
    | ~ state(X1,X2,X3,X4,X5,h(X6,X7),X8,X9,X10,X11,e1(X6,s(s(X7))),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',h_right) ).

cnf(s1_up,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',s1_up) ).

cnf(s3_up,axiom,
    ( state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,X10),X11,e1(s(X9),X10),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,X7,X8,s3(s(X9),X10),X11,e1(X9,X10),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',s3_up) ).

cnf(v1_up,axiom,
    ( state(X1,v1(X2,X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(s(s(X2)),X3),X12)
    | ~ state(X1,v1(s(X2),X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(X2,X3),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',v1_up) ).

cnf(s1_left,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(X7,s(X8)),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(X7,s(X8)),X9,X10,X11,e1(X7,X8),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',s1_left) ).

cnf(v3_right,axiom,
    ( state(X1,X2,X3,v3(X4,s(X5)),X6,X7,X8,X9,X10,X11,e1(X4,X5),e2(s(X4),X5))
    | ~ state(X1,X2,X3,v3(X4,X5),X6,X7,X8,X9,X10,X11,e1(X4,s(X5)),e2(s(X4),s(X5))) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',v3_right) ).

cnf(s1_down,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',s1_down) ).

cnf(b_left,axiom,
    ( state(bb(X1,X2),X3,X4,X5,X6,X7,X8,X9,X10,X11,e1(X1,s(s(X2))),e2(s(X1),s(s(X2))))
    | ~ state(bb(X1,s(X2)),X3,X4,X5,X6,X7,X8,X9,X10,X11,e1(X1,X2),e2(s(X1),X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',b_left) ).

cnf(goal_state,negated_conjecture,
    ~ state(bb(o,o),X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11),
    file('/export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p',goal_state) ).

cnf(c_0_14,axiom,
    ( state(X1,X2,X3,v3(s(X4),X5),X6,X7,X8,X9,X10,X11,e1(X4,X5),X12)
    | ~ state(X1,X2,X3,v3(X4,X5),X6,X7,X8,X9,X10,X11,e1(s(s(X4)),X5),X12) ),
    v3_down ).

cnf(c_0_15,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    initial_state ).

cnf(c_0_16,axiom,
    ( state(X1,v1(s(X2),X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(X2,X3),X12)
    | ~ state(X1,v1(X2,X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(s(s(X2)),X3),X12) ),
    v1_down ).

cnf(c_0_17,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,axiom,
    ( state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X13,X14),e2(X11,X12))
    | ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X11,X12),e2(X13,X14)) ),
    swap_blanks ).

cnf(c_0_19,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(o,o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,axiom,
    ( state(X1,X2,X3,X4,v4(s(X5),X6),X7,X8,X9,X10,X11,e1(X5,X6),X12)
    | ~ state(X1,X2,X3,X4,v4(X5,X6),X7,X8,X9,X10,X11,e1(s(s(X5)),X6),X12) ),
    v4_down ).

cnf(c_0_21,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(s(s(o)))),e2(o,o)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,axiom,
    ( state(X1,X2,X3,X4,X5,h(X6,s(X7)),X8,X9,X10,X11,e1(X6,X7),X12)
    | ~ state(X1,X2,X3,X4,X5,h(X6,X7),X8,X9,X10,X11,e1(X6,s(s(X7))),X12) ),
    h_right ).

cnf(c_0_23,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),s(s(s(o)))),e2(o,o)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12) ),
    s1_up ).

cnf(c_0_25,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),s(o)),e2(o,o)),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,axiom,
    ( state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,X10),X11,e1(s(X9),X10),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,X7,X8,s3(s(X9),X10),X11,e1(X9,X10),X12) ),
    s3_up ).

cnf(c_0_27,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(o))),s(o)),e2(o,o)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(o))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(o)),e2(o,o)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,axiom,
    ( state(X1,v1(X2,X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(s(s(X2)),X3),X12)
    | ~ state(X1,v1(s(X2),X3),X4,X5,X6,X7,X8,X9,X10,X11,e1(X2,X3),X12) ),
    v1_up ).

cnf(c_0_30,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(o))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(o,o),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_18,c_0_28]) ).

cnf(c_0_31,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(X7,s(X8)),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(X7,s(X8)),X9,X10,X11,e1(X7,X8),X12) ),
    s1_left ).

cnf(c_0_32,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(o))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),o),s2(s(s(s(o))),s(s(o))),s3(s(s(s(o))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),s(o)),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,axiom,
    ( state(X1,X2,X3,v3(X4,s(X5)),X6,X7,X8,X9,X10,X11,e1(X4,X5),e2(s(X4),X5))
    | ~ state(X1,X2,X3,v3(X4,X5),X6,X7,X8,X9,X10,X11,e1(X4,s(X5)),e2(s(X4),s(X5))) ),
    v3_right ).

cnf(c_0_35,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(o))),s(o)),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_26,c_0_33]) ).

cnf(c_0_36,axiom,
    ( state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12)
    | ~ state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12) ),
    s1_down ).

cnf(c_0_37,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(o)),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(o))),o),e2(s(s(s(s(o)))),o)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(o))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),o)),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_39,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(o))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(o,o),e2(s(s(s(s(o)))),o)),
    inference(spm,[status(thm)],[c_0_16,c_0_38]) ).

cnf(c_0_40,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(o))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(o,o)),
    inference(spm,[status(thm)],[c_0_18,c_0_39]) ).

cnf(c_0_41,hypothesis,
    state(bb(o,s(o)),v1(s(o),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(s(o)))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(o))),o),e2(o,o)),
    inference(spm,[status(thm)],[c_0_36,c_0_40]) ).

cnf(c_0_42,hypothesis,
    state(bb(o,s(o)),v1(s(s(o)),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(s(o)))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(o),o),e2(o,o)),
    inference(spm,[status(thm)],[c_0_16,c_0_41]) ).

cnf(c_0_43,axiom,
    ( state(bb(X1,X2),X3,X4,X5,X6,X7,X8,X9,X10,X11,e1(X1,s(s(X2))),e2(s(X1),s(s(X2))))
    | ~ state(bb(X1,s(X2)),X3,X4,X5,X6,X7,X8,X9,X10,X11,e1(X1,X2),e2(s(X1),X2)) ),
    b_left ).

cnf(c_0_44,hypothesis,
    state(bb(o,s(o)),v1(s(s(o)),o),v2(o,s(s(s(o)))),v3(s(s(s(o))),s(o)),v4(s(s(s(o))),s(s(s(o)))),h(s(s(o)),s(s(o))),s1(s(s(s(s(o)))),o),s2(s(s(s(o))),s(s(o))),s3(s(s(o)),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(o,o),e2(s(o),o)),
    inference(spm,[status(thm)],[c_0_18,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    ~ state(bb(o,o),X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11),
    goal_state ).

cnf(c_0_46,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : PUZ040-1 : TPTP v8.1.2. Bugfixed v2.6.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n015.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 19:19:31 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.16/0.46  Running first-order model finding
% 0.16/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0OIQebjlQP/E---3.1_27048.p
% 0.59/300.16  # Version: 3.1pre001
% 0.59/300.16  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/300.16  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.59/300.16  # Starting new_bool_1 with 300s (1) cores
% 0.59/300.16  # Starting sh5l with 300s (1) cores
% 0.59/300.16  # new_bool_3 with pid 27213 completed with status 0
% 0.59/300.16  # Result found by new_bool_3
% 0.59/300.16  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/300.16  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.59/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/300.16  # Search class: FHUNF-FFLF21-MFFFFFNN
% 0.59/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/300.16  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 164s (1) cores
% 0.59/300.16  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 27220 completed with status 0
% 0.59/300.16  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.59/300.16  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/300.16  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.59/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/300.16  # Search class: FHUNF-FFLF21-MFFFFFNN
% 0.59/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/300.16  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 164s (1) cores
% 0.59/300.16  # Preprocessing time       : 0.002 s
% 0.59/300.16  # Presaturation interreduction done
% 0.59/300.16  
% 0.59/300.16  # Proof found!
% 0.59/300.16  # SZS status Unsatisfiable
% 0.59/300.16  # SZS output start CNFRefutation
% See solution above
% 0.59/300.16  # Parsed axioms                        : 43
% 0.59/300.16  # Removed by relevancy pruning/SinE    : 0
% 0.59/300.16  # Initial clauses                      : 43
% 0.59/300.16  # Removed in clause preprocessing      : 0
% 0.59/300.16  # Initial clauses in saturation        : 43
% 0.59/300.16  # Processed clauses                    : 203
% 0.59/300.16  # ...of these trivial                  : 5
% 0.59/300.16  # ...subsumed                          : 0
% 0.59/300.16  # ...remaining for further processing  : 198
% 0.59/300.16  # Other redundant clauses eliminated   : 0
% 0.59/300.16  # Clauses deleted for lack of memory   : 0
% 0.59/300.16  # Backward-subsumed                    : 0
% 0.59/300.16  # Backward-rewritten                   : 0
% 0.59/300.16  # Generated clauses                    : 349
% 0.59/300.16  # ...of the previous two non-redundant : 219
% 0.59/300.16  # ...aggressively subsumed             : 0
% 0.59/300.16  # Contextual simplify-reflections      : 0
% 0.59/300.16  # Paramodulations                      : 349
% 0.59/300.16  # Factorizations                       : 0
% 0.59/300.16  # NegExts                              : 0
% 0.59/300.16  # Equation resolutions                 : 0
% 0.59/300.16  # Total rewrite steps                  : 134
% 0.59/300.16  # Propositional unsat checks           : 0
% 0.59/300.16  #    Propositional check models        : 0
% 0.59/300.16  #    Propositional check unsatisfiable : 0
% 0.59/300.16  #    Propositional clauses             : 0
% 0.59/300.16  #    Propositional clauses after purity: 0
% 0.59/300.16  #    Propositional unsat core size     : 0
% 0.59/300.16  #    Propositional preprocessing time  : 0.000
% 0.59/300.16  #    Propositional encoding time       : 0.000
% 0.59/300.16  #    Propositional solver time         : 0.000
% 0.59/300.16  #    Success case prop preproc time    : 0.000
% 0.59/300.16  #    Success case prop encoding time   : 0.000
% 0.59/300.16  #    Success case prop solver time     : 0.000
% 0.59/300.16  # Current number of processed clauses  : 155
% 0.59/300.16  #    Positive orientable unit clauses  : 113
% 0.59/300.16  #    Positive unorientable unit clauses: 0
% 0.59/300.16  #    Negative unit clauses             : 1
% 0.59/300.16  #    Non-unit-clauses                  : 41
% 0.59/300.16  # Current number of unprocessed clauses: 102
% 0.59/300.16  # ...number of literals in the above   : 102
% 0.59/300.16  # Current number of archived formulas  : 0
% 0.59/300.16  # Current number of archived clauses   : 43
% 0.59/300.16  # Clause-clause subsumption calls (NU) : 1100
% 0.59/300.16  # Rec. Clause-clause subsumption calls : 1100
% 0.59/300.16  # Non-unit clause-clause subsumptions  : 0
% 0.59/300.16  # Unit Clause-clause subsumption calls : 0
% 0.59/300.16  # Rewrite failures with RHS unbound    : 0
% 0.59/300.16  # BW rewrite match attempts            : 3178
% 0.59/300.16  # BW rewrite match successes           : 0
% 0.59/300.16  # Condensation attempts                : 0
% 0.59/300.16  # Condensation successes               : 0
% 0.59/300.16  # Termbank termtop insertions          : 31729
% 0.59/300.16  
% 0.59/300.16  # -------------------------------------------------
% 0.59/300.16  # User time                : 0.032 s
% 0.59/300.16  # System time              : 0.011 s
% 0.59/300.16  # Total time               : 0.043 s
% 0.59/300.16  # Maximum resident set size: 1784 pages
% 0.59/300.16  
% 0.59/300.16  # -------------------------------------------------
% 0.59/300.16  # User time                : 0.034 s
% 0.59/300.16  # System time              : 0.014 s
% 0.59/300.16  # Total time               : 0.048 s
% 0.59/300.16  # Maximum resident set size: 1728 pages
% 0.59/300.16  % E---3.1 exiting
%------------------------------------------------------------------------------