↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV396+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n012.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 : Wed Jul 20 17:47:05 EDT 2022

% Result   : Theorem 8.58s 2.45s
% Output   : CNFRefutation 8.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   73 (  19 unt;   0 def)
%            Number of atoms       :  195 (  66 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  183 (  61   ~;  81   |;  25   &)
%                                         (   4 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    8 (   5 usr;   2 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   8 con; 0-3 aty)
%            Number of variables   :  192 (  24 sgn 114   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l32_co,conjecture,
    ! [X1] :
      ( ! [X2,X3,X4,X5] :
          ( ( pair_in_list(X1,X4,X5)
            & strictly_less_than(X4,X5)
            & ok(remove_cpq(triple(X2,X1,X3),X4)) )
         => pair_in_list(remove_slb(X1,X4),X4,X5) )
     => ! [X6,X7,X8,X9,X10,X11] :
          ( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
            & strictly_less_than(X8,X9)
            & ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
         => pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_co) ).

fof(ax43,axiom,
    ! [X1,X2,X3,X4] :
      ( ~ contains_slb(X2,X4)
     => remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).

fof(ax40,axiom,
    ! [X1,X2] :
      ( ok(triple(X1,X2,bad))
    <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).

fof(ax45,axiom,
    ! [X1,X2,X3,X4] :
      ( ( contains_slb(X2,X4)
        & strictly_less_than(X4,lookup_slb(X2,X4)) )
     => remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax45) ).

fof(ax21,axiom,
    ! [X1,X2,X3,X4] :
      ( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
    <=> ( contains_slb(X1,X3)
        | X2 = X3 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).

fof(ax27,axiom,
    ! [X1,X2,X3,X4] :
      ( ( X2 != X3
        & contains_slb(X1,X3) )
     => lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax27) ).

fof(stricly_smaller_definition,axiom,
    ! [X1,X2] :
      ( strictly_less_than(X1,X2)
    <=> ( less_than(X1,X2)
        & ~ less_than(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

fof(totality,axiom,
    ! [X1,X2] :
      ( less_than(X1,X2)
      | less_than(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).

fof(ax41,axiom,
    ! [X1,X2,X3] :
      ( ~ ok(triple(X1,X2,X3))
     => X3 = bad ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).

fof(ax44,axiom,
    ! [X1,X2,X3,X4] :
      ( ( contains_slb(X2,X4)
        & less_than(lookup_slb(X2,X4),X4) )
     => remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax44) ).

fof(ax25,axiom,
    ! [X1,X2,X3,X4] :
      ( ( X2 != X3
        & contains_slb(X1,X3) )
     => remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax25) ).

fof(ax23,axiom,
    ! [X1,X2,X3,X4,X5] :
      ( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
    <=> ( pair_in_list(X1,X3,X5)
        | ( X2 = X3
          & X4 = X5 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).

fof(ax24,axiom,
    ! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax24) ).

fof(ax26,axiom,
    ! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax26) ).

fof(c_0_14,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2,X3,X4,X5] :
            ( ( pair_in_list(X1,X4,X5)
              & strictly_less_than(X4,X5)
              & ok(remove_cpq(triple(X2,X1,X3),X4)) )
           => pair_in_list(remove_slb(X1,X4),X4,X5) )
       => ! [X6,X7,X8,X9,X10,X11] :
            ( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
              & strictly_less_than(X8,X9)
              & ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
           => pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
    inference(assume_negation,[status(cth)],[l32_co]) ).

fof(c_0_15,negated_conjecture,
    ! [X126,X127,X128,X129] :
      ( ( ~ pair_in_list(esk1_0,X128,X129)
        | ~ strictly_less_than(X128,X129)
        | ~ ok(remove_cpq(triple(X126,esk1_0,X127),X128))
        | pair_in_list(remove_slb(esk1_0,X128),X128,X129) )
      & pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
      & strictly_less_than(esk4_0,esk5_0)
      & ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
      & ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).

fof(c_0_16,plain,
    ! [X95,X96,X97,X98] :
      ( contains_slb(X96,X98)
      | remove_cpq(triple(X95,X96,X97),X98) = triple(X95,X96,bad) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])]) ).

fof(c_0_17,plain,
    ! [X86,X87] : ~ ok(triple(X86,X87,bad)),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])]) ).

fof(c_0_18,plain,
    ! [X103,X104,X105,X106] :
      ( ~ contains_slb(X104,X106)
      | ~ strictly_less_than(X106,lookup_slb(X104,X106))
      | remove_cpq(triple(X103,X104,X105),X106) = triple(remove_pqp(X103,X106),remove_slb(X104,X106),bad) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).

fof(c_0_19,plain,
    ! [X25,X26,X27,X28] :
      ( ( ~ contains_slb(insert_slb(X25,pair(X26,X28)),X27)
        | contains_slb(X25,X27)
        | X26 = X27 )
      & ( ~ contains_slb(X25,X27)
        | contains_slb(insert_slb(X25,pair(X26,X28)),X27) )
      & ( X26 != X27
        | contains_slb(insert_slb(X25,pair(X26,X28)),X27) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).

cnf(c_0_20,negated_conjecture,
    ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ( contains_slb(X1,X2)
    | remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    ~ ok(triple(X1,X2,bad)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,plain,
    ( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)
    | ~ contains_slb(X1,X2)
    | ~ strictly_less_than(X2,lookup_slb(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X46,X47,X48,X49] :
      ( X47 = X48
      | ~ contains_slb(X46,X48)
      | lookup_slb(insert_slb(X46,pair(X47,X49)),X48) = lookup_slb(X46,X48) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])]) ).

cnf(c_0_25,plain,
    ( contains_slb(X1,X4)
    | X2 = X4
    | ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_27,plain,
    ( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
    | ~ contains_slb(X2,X4)
    | ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,plain,
    ( X1 = X2
    | lookup_slb(insert_slb(X3,pair(X1,X4)),X2) = lookup_slb(X3,X2)
    | ~ contains_slb(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( esk6_0 = esk4_0
    | contains_slb(esk1_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

fof(c_0_30,plain,
    ! [X18,X19] :
      ( ( less_than(X18,X19)
        | ~ strictly_less_than(X18,X19) )
      & ( ~ less_than(X19,X18)
        | ~ strictly_less_than(X18,X19) )
      & ( ~ less_than(X18,X19)
        | less_than(X19,X18)
        | strictly_less_than(X18,X19) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])]) ).

fof(c_0_31,plain,
    ! [X15,X16] :
      ( less_than(X15,X16)
      | less_than(X16,X15) ),
    inference(variable_rename,[status(thm)],[totality]) ).

fof(c_0_32,plain,
    ! [X88,X89,X90] :
      ( ok(triple(X88,X89,X90))
      | X90 = bad ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax41])])]) ).

fof(c_0_33,plain,
    ! [X99,X100,X101,X102] :
      ( ~ contains_slb(X100,X102)
      | ~ less_than(lookup_slb(X100,X102),X102)
      | remove_cpq(triple(X99,X100,X101),X102) = triple(remove_pqp(X99,X102),remove_slb(X100,X102),X101) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).

cnf(c_0_34,negated_conjecture,
    ~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_26])]) ).

cnf(c_0_35,negated_conjecture,
    ( lookup_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = lookup_slb(esk1_0,esk4_0)
    | esk6_0 = esk4_0
    | X1 = esk4_0 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    ( less_than(X2,X1)
    | strictly_less_than(X1,X2)
    | ~ less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_37,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_38,plain,
    ! [X39,X40,X41,X42] :
      ( X40 = X41
      | ~ contains_slb(X39,X41)
      | remove_slb(insert_slb(X39,pair(X40,X42)),X41) = insert_slb(remove_slb(X39,X41),pair(X40,X42)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])]) ).

cnf(c_0_39,plain,
    ( ok(triple(X1,X2,X3))
    | X3 = bad ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_40,plain,
    ( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)
    | ~ contains_slb(X1,X2)
    | ~ less_than(lookup_slb(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_41,negated_conjecture,
    ( esk6_0 = esk4_0
    | ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_42,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,plain,
    ( X1 = X2
    | remove_slb(insert_slb(X3,pair(X1,X4)),X2) = insert_slb(remove_slb(X3,X2),pair(X1,X4))
    | ~ contains_slb(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_44,plain,
    ( X1 = bad
    | ok(remove_cpq(triple(X2,X3,X1),X4))
    | ~ contains_slb(X3,X4)
    | ~ less_than(lookup_slb(X3,X4),X4) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    ( esk6_0 = esk4_0
    | less_than(lookup_slb(esk1_0,esk4_0),esk4_0) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

fof(c_0_46,plain,
    ! [X31,X32,X33,X34,X35] :
      ( ( X32 = X33
        | pair_in_list(X31,X33,X35)
        | ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35) )
      & ( X34 = X35
        | pair_in_list(X31,X33,X35)
        | ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35) )
      & ( ~ pair_in_list(X31,X33,X35)
        | pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35) )
      & ( X32 != X33
        | X34 != X35
        | pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).

cnf(c_0_47,negated_conjecture,
    ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_48,negated_conjecture,
    ( remove_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = insert_slb(remove_slb(esk1_0,esk4_0),pair(X1,X2))
    | esk6_0 = esk4_0
    | X1 = esk4_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_29]) ).

cnf(c_0_49,negated_conjecture,
    ( pair_in_list(remove_slb(esk1_0,X1),X1,X2)
    | ~ pair_in_list(esk1_0,X1,X2)
    | ~ strictly_less_than(X1,X2)
    | ~ ok(remove_cpq(triple(X3,esk1_0,X4),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_50,negated_conjecture,
    ( esk6_0 = esk4_0
    | X1 = bad
    | ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_29]) ).

cnf(c_0_51,plain,
    ( X1 = X2
    | pair_in_list(X3,X2,X4)
    | ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_53,negated_conjecture,
    ( esk6_0 = esk4_0
    | ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,plain,
    ( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
    | ~ pair_in_list(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_55,negated_conjecture,
    ( esk6_0 = esk4_0
    | X1 = bad
    | pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X2)
    | ~ pair_in_list(esk1_0,esk4_0,X2)
    | ~ strictly_less_than(esk4_0,X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_56,negated_conjecture,
    ( esk6_0 = esk4_0
    | pair_in_list(esk1_0,esk4_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_57,negated_conjecture,
    strictly_less_than(esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_58,negated_conjecture,
    ( esk6_0 = esk4_0
    | ~ pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_59,negated_conjecture,
    ( esk6_0 = esk4_0
    | X1 = bad ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_58]) ).

cnf(c_0_60,negated_conjecture,
    ( esk6_0 = esk4_0
    | ~ ok(bad) ),
    inference(spm,[status(thm)],[c_0_22,c_0_59]) ).

cnf(c_0_61,negated_conjecture,
    ( esk6_0 = esk4_0
    | ~ ok(X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_59]) ).

fof(c_0_62,plain,
    ! [X36,X37,X38] : remove_slb(insert_slb(X36,pair(X37,X38)),X37) = X36,
    inference(variable_rename,[status(thm)],[ax24]) ).

fof(c_0_63,plain,
    ! [X43,X44,X45] : lookup_slb(insert_slb(X43,pair(X44,X45)),X44) = X45,
    inference(variable_rename,[status(thm)],[ax26]) ).

cnf(c_0_64,plain,
    ( X1 = X2
    | pair_in_list(X3,X4,X2)
    | ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_65,negated_conjecture,
    esk6_0 = esk4_0,
    inference(spm,[status(thm)],[c_0_61,c_0_20]) ).

cnf(c_0_66,plain,
    remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_67,plain,
    lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
    inference(split_conjunct,[status(thm)],[c_0_63]) ).

cnf(c_0_68,negated_conjecture,
    ( esk7_0 = esk5_0
    | pair_in_list(esk1_0,esk4_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_64,c_0_52]) ).

cnf(c_0_69,negated_conjecture,
    ~ pair_in_list(esk1_0,esk4_0,esk5_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_65]),c_0_66]) ).

cnf(c_0_70,negated_conjecture,
    ~ strictly_less_than(esk4_0,esk7_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_65]),c_0_67]) ).

cnf(c_0_71,negated_conjecture,
    esk7_0 = esk5_0,
    inference(sr,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_72,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71]),c_0_57])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV396+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Wed Jun 15 15:42:56 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.58/2.45  # ENIGMATIC: Solved by autoschedule:
% 8.58/2.45  # No SInE strategy applied
% 8.58/2.45  # Trying AutoSched0 for 150 seconds
% 8.58/2.45  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 8.58/2.45  # and selection function PSelectComplexExceptUniqMaxHorn.
% 8.58/2.45  #
% 8.58/2.45  # Preprocessing time       : 0.029 s
% 8.58/2.45  
% 8.58/2.45  # Proof found!
% 8.58/2.45  # SZS status Theorem
% 8.58/2.45  # SZS output start CNFRefutation
% See solution above
% 8.58/2.45  # Training examples: 0 positive, 0 negative
% 8.58/2.45  
% 8.58/2.45  # -------------------------------------------------
% 8.58/2.45  # User time                : 0.121 s
% 8.58/2.45  # System time              : 0.008 s
% 8.58/2.45  # Total time               : 0.129 s
% 8.58/2.45  # Maximum resident set size: 7124 pages
% 8.58/2.45  
%------------------------------------------------------------------------------