TSTP Solution File: SYN549+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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 : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 06:03:39 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   87 (   7 unt;   0 def)
%            Number of atoms       :  410 (   0 equ)
%            Maximal formula atoms :   80 (   4 avg)
%            Number of connectives :  470 ( 147   ~; 291   |;  27   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   95 (   0 sgn  15   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ? [X1] :
      ( reachable(initial_world,X1)
      & ! [X2] :
          ( reachable(X1,X2)
         => ( ? [X3] :
                ( reachable(X2,X3)
                & ( p(X3)
                  | ? [X4] :
                      ( reachable(X3,X4)
                      & q(X4) ) ) )
          <=> ( ? [X5] :
                  ( reachable(X2,X5)
                  & p(X5) )
              | ? [X5] :
                  ( reachable(X2,X5)
                  & q(X5) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',prove_this) ).

fof(reflexivity_of_reachable,axiom,
    ! [X1] : reachable(X1,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',reflexivity_of_reachable) ).

fof(transitivity_of_reachable,axiom,
    ! [X1,X2,X3] :
      ( ( reachable(X1,X2)
        & reachable(X2,X3) )
     => reachable(X1,X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',transitivity_of_reachable) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] :
        ( reachable(initial_world,X1)
        & ! [X2] :
            ( reachable(X1,X2)
           => ( ? [X3] :
                  ( reachable(X2,X3)
                  & ( p(X3)
                    | ? [X4] :
                        ( reachable(X3,X4)
                        & q(X4) ) ) )
            <=> ( ? [X5] :
                    ( reachable(X2,X5)
                    & p(X5) )
                | ? [X5] :
                    ( reachable(X2,X5)
                    & q(X5) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_4,negated_conjecture,
    ! [X6,X8,X9,X10,X11] :
      ( ( reachable(X6,esk1_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( ~ reachable(esk1_1(X6),X10)
        | ~ p(X10)
        | ~ p(X8)
        | ~ reachable(esk1_1(X6),X8)
        | ~ reachable(initial_world,X6) )
      & ( ~ reachable(esk1_1(X6),X11)
        | ~ q(X11)
        | ~ p(X8)
        | ~ reachable(esk1_1(X6),X8)
        | ~ reachable(initial_world,X6) )
      & ( ~ reachable(esk1_1(X6),X10)
        | ~ p(X10)
        | ~ reachable(X8,X9)
        | ~ q(X9)
        | ~ reachable(esk1_1(X6),X8)
        | ~ reachable(initial_world,X6) )
      & ( ~ reachable(esk1_1(X6),X11)
        | ~ q(X11)
        | ~ reachable(X8,X9)
        | ~ q(X9)
        | ~ reachable(esk1_1(X6),X8)
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | reachable(esk1_1(X6),esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | reachable(esk1_1(X6),esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | p(esk4_1(X6))
        | reachable(esk1_1(X6),esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | p(esk4_1(X6))
        | reachable(esk1_1(X6),esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | reachable(esk2_1(X6),esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | reachable(esk2_1(X6),esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | p(esk4_1(X6))
        | reachable(esk2_1(X6),esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | p(esk4_1(X6))
        | reachable(esk2_1(X6),esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | q(esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | reachable(esk1_1(X6),esk4_1(X6))
        | q(esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( reachable(esk1_1(X6),esk5_1(X6))
        | p(esk4_1(X6))
        | q(esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) )
      & ( q(esk5_1(X6))
        | p(esk4_1(X6))
        | q(esk3_1(X6))
        | p(esk2_1(X6))
        | ~ reachable(initial_world,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).

fof(c_0_5,plain,
    ! [X2] : reachable(X2,X2),
    inference(variable_rename,[status(thm)],[reflexivity_of_reachable]) ).

cnf(c_0_6,negated_conjecture,
    ( reachable(esk1_1(X1),esk2_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    reachable(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( reachable(esk1_1(X1),esk2_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ( reachable(esk1_1(X1),esk2_1(X1))
    | p(esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( reachable(esk1_1(X1),esk2_1(X1))
    | p(esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ reachable(initial_world,X1)
    | ~ reachable(esk1_1(X1),X2)
    | ~ q(X3)
    | ~ reachable(X2,X3)
    | ~ q(X4)
    | ~ reachable(esk1_1(X1),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_12,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7])]),c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_7])]),c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_7]) ).

fof(c_0_20,plain,
    ! [X4,X5,X6] :
      ( ~ reachable(X4,X5)
      | ~ reachable(X5,X6)
      | reachable(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_reachable])]) ).

cnf(c_0_21,negated_conjecture,
    ( p(esk2_1(X1))
    | reachable(esk2_1(X1),esk3_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ reachable(initial_world,X1)
    | ~ reachable(esk1_1(X1),X2)
    | ~ p(X2)
    | ~ p(X3)
    | ~ reachable(esk1_1(X1),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_23,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk2_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_15]) ).

cnf(c_0_25,plain,
    ( reachable(X1,X2)
    | ~ reachable(X3,X2)
    | ~ reachable(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ( p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk2_1(initial_world),esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_7]) ).

cnf(c_0_27,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk2_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_7])]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(X1,esk3_1(initial_world))
    | ~ reachable(X1,esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    reachable(esk1_1(initial_world),esk2_1(initial_world)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    ( p(esk2_1(X1))
    | q(esk3_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ reachable(initial_world,X1)
    | ~ reachable(esk1_1(X1),X2)
    | ~ p(X2)
    | ~ q(X3)
    | ~ reachable(esk1_1(X1),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_32,negated_conjecture,
    ( p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk3_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ( q(esk3_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_7]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p(esk2_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_7])]) ).

cnf(c_0_35,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_7])]),c_0_33]),c_0_34]) ).

cnf(c_0_36,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ p(esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_29]) ).

cnf(c_0_37,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(X1,esk3_1(initial_world))
    | ~ reachable(X1,esk1_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_32]),c_0_36]) ).

cnf(c_0_38,negated_conjecture,
    ( p(esk2_1(X1))
    | reachable(esk2_1(X1),esk3_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_39,negated_conjecture,
    ( p(esk2_1(X1))
    | reachable(esk2_1(X1),esk3_1(X1))
    | p(esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_40,negated_conjecture,
    ( p(esk2_1(X1))
    | reachable(esk2_1(X1),esk3_1(X1))
    | p(esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_41,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk3_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_7]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ reachable(initial_world,X1)
    | ~ reachable(esk1_1(X1),X2)
    | ~ q(X3)
    | ~ reachable(X2,X3)
    | ~ p(X4)
    | ~ reachable(esk1_1(X1),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_43,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk2_1(initial_world),esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_7]) ).

cnf(c_0_44,negated_conjecture,
    ( p(esk2_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk2_1(initial_world),esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_7]) ).

cnf(c_0_45,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk2_1(initial_world),esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_7]) ).

cnf(c_0_46,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(esk3_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_41]),c_0_7])]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ q(X1)
    | ~ p(esk2_1(initial_world))
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_7])]) ).

cnf(c_0_48,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(X1,esk3_1(initial_world))
    | ~ reachable(X1,esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_43]) ).

cnf(c_0_49,negated_conjecture,
    ( p(esk2_1(X1))
    | q(esk3_1(X1))
    | reachable(esk1_1(X1),esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_50,negated_conjecture,
    ( p(esk4_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(X1,esk3_1(initial_world))
    | ~ reachable(X1,esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_44]) ).

cnf(c_0_51,negated_conjecture,
    ( p(esk2_1(X1))
    | q(esk3_1(X1))
    | p(esk4_1(X1))
    | reachable(esk1_1(X1),esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_52,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(X1,esk3_1(initial_world))
    | ~ reachable(X1,esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_45]) ).

cnf(c_0_53,negated_conjecture,
    ( p(esk2_1(X1))
    | q(esk3_1(X1))
    | p(esk4_1(X1))
    | q(esk5_1(X1))
    | ~ reachable(initial_world,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_54,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_47]) ).

cnf(c_0_55,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk3_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_48,c_0_29]) ).

cnf(c_0_56,negated_conjecture,
    ( q(esk3_1(initial_world))
    | q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_7]) ).

cnf(c_0_57,negated_conjecture,
    ( p(esk2_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk3_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_50,c_0_29]) ).

cnf(c_0_58,negated_conjecture,
    ( q(esk3_1(initial_world))
    | p(esk2_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_7]) ).

cnf(c_0_59,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_29]) ).

cnf(c_0_60,negated_conjecture,
    ( q(esk3_1(initial_world))
    | q(esk5_1(initial_world))
    | p(esk2_1(initial_world))
    | p(esk4_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_53,c_0_7]) ).

cnf(c_0_61,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_7]) ).

cnf(c_0_62,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_55]),c_0_7])]),c_0_56]),c_0_47]) ).

cnf(c_0_63,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_55]),c_0_7])]),c_0_56]),c_0_34]) ).

cnf(c_0_64,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_57]),c_0_7])]),c_0_58]),c_0_47]) ).

cnf(c_0_65,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_7])]),c_0_58]),c_0_34]) ).

cnf(c_0_66,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_59]),c_0_7])]),c_0_60]),c_0_47]) ).

cnf(c_0_67,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_59]),c_0_7])]),c_0_60]),c_0_34]) ).

cnf(c_0_68,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ q(esk3_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_41]) ).

cnf(c_0_69,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_7]) ).

cnf(c_0_70,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ p(esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_63,c_0_29]) ).

cnf(c_0_71,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_64,c_0_7]) ).

cnf(c_0_72,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world))
    | ~ p(esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_29]) ).

cnf(c_0_73,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_66,c_0_7]) ).

cnf(c_0_74,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world))
    | ~ p(esk2_1(initial_world)) ),
    inference(spm,[status(thm)],[c_0_67,c_0_29]) ).

cnf(c_0_75,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_33]),c_0_36]) ).

cnf(c_0_76,negated_conjecture,
    ( q(esk5_1(initial_world))
    | reachable(esk1_1(initial_world),esk4_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_55]),c_0_56]),c_0_70]) ).

cnf(c_0_77,negated_conjecture,
    ( p(esk4_1(initial_world))
    | reachable(esk1_1(initial_world),esk5_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_57]),c_0_58]),c_0_72]) ).

cnf(c_0_78,negated_conjecture,
    ( q(esk5_1(initial_world))
    | p(esk4_1(initial_world)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_59]),c_0_60]),c_0_74]) ).

cnf(c_0_79,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_75]),c_0_7])]),c_0_76]) ).

cnf(c_0_80,negated_conjecture,
    ( p(esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X2)
    | ~ reachable(X2,X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_77]),c_0_7])]),c_0_78]) ).

cnf(c_0_81,negated_conjecture,
    ( reachable(esk1_1(initial_world),esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_79,c_0_7]) ).

cnf(c_0_82,negated_conjecture,
    ( p(esk4_1(initial_world))
    | ~ q(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(spm,[status(thm)],[c_0_80,c_0_7]) ).

cnf(c_0_83,negated_conjecture,
    reachable(esk1_1(initial_world),esk4_1(initial_world)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_75]),c_0_76]) ).

cnf(c_0_84,negated_conjecture,
    p(esk4_1(initial_world)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_77]),c_0_78]) ).

cnf(c_0_85,negated_conjecture,
    ( ~ p(X1)
    | ~ reachable(esk1_1(initial_world),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_83]),c_0_84]),c_0_7])]) ).

cnf(c_0_86,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_83]),c_0_84])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n015.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 : Mon Jul 11 19:36:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.22/1.41  # Preprocessing time       : 0.015 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 87
% 0.22/1.41  # Proof object clause steps            : 80
% 0.22/1.41  # Proof object formula steps           : 7
% 0.22/1.41  # Proof object conjectures             : 81
% 0.22/1.41  # Proof object clause conjectures      : 78
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 18
% 0.22/1.41  # Proof object initial formulas used   : 3
% 0.22/1.41  # Proof object generating inferences   : 62
% 0.22/1.41  # Proof object simplifying inferences  : 68
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 3
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 19
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 19
% 0.22/1.41  # Processed clauses                    : 3092
% 0.22/1.41  # ...of these trivial                  : 0
% 0.22/1.41  # ...subsumed                          : 742
% 0.22/1.41  # ...remaining for further processing  : 2350
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 1198
% 0.22/1.41  # Backward-rewritten                   : 110
% 0.22/1.41  # Generated clauses                    : 7603
% 0.22/1.41  # ...of the previous two non-trivial   : 7104
% 0.22/1.41  # Contextual simplify-reflections      : 1078
% 0.22/1.41  # Paramodulations                      : 7603
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 0
% 0.22/1.41  # Current number of processed clauses  : 1042
% 0.22/1.41  #    Positive orientable unit clauses  : 133
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 0
% 0.22/1.41  #    Non-unit-clauses                  : 909
% 0.22/1.41  # Current number of unprocessed clauses: 1144
% 0.22/1.41  # ...number of literals in the above   : 5612
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 1308
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 498875
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 82921
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 3018
% 0.22/1.41  # Unit Clause-clause subsumption calls : 23320
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 3429
% 0.22/1.41  # BW rewrite match successes           : 6
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 239423
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.530 s
% 0.22/1.41  # System time              : 0.007 s
% 0.22/1.41  # Total time               : 0.537 s
% 0.22/1.41  # Maximum resident set size: 8052 pages
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------