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

View Problem - Process Solution

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

% 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 04:52:08 EDT 2022

% Result   : Theorem 7.72s 2.24s
% Output   : CNFRefutation 7.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   67 (   9 unt;   0 def)
%            Number of atoms       :  194 (  47 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  244 ( 117   ~; 123   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   87 (  46 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
    ( f(esk2_0)
    | esk3_1(X1) != X1
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_7) ).

cnf(i_0_2,negated_conjecture,
    ( X1 = X2
    | f(esk5_0)
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_2) ).

cnf(i_0_8,negated_conjecture,
    ( f(esk2_0)
    | f(esk3_1(X1))
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_8) ).

cnf(i_0_4,negated_conjecture,
    ( f(esk4_0)
    | f(esk5_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_4) ).

cnf(i_0_9,negated_conjecture,
    ( f(esk1_0)
    | esk3_1(X1) != X1
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_9) ).

cnf(i_0_10,negated_conjecture,
    ( f(esk1_0)
    | f(esk3_1(X1))
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_10) ).

cnf(i_0_5,negated_conjecture,
    ( esk3_1(X1) != X1
    | esk2_0 != esk1_0
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_5) ).

cnf(i_0_1,negated_conjecture,
    ( X1 = X2
    | esk5_0 = X3
    | ~ f(X2)
    | ~ f(X1)
    | ~ f(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_1) ).

cnf(i_0_6,negated_conjecture,
    ( f(esk3_1(X1))
    | esk2_0 != esk1_0
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8lflxwl3/lgb.p',i_0_6) ).

cnf(c_0_20,negated_conjecture,
    ( f(esk2_0)
    | esk3_1(X1) != X1
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_7 ).

cnf(c_0_21,negated_conjecture,
    ( X1 = X2
    | f(esk5_0)
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_2 ).

cnf(c_0_22,negated_conjecture,
    ( f(esk2_0)
    | f(esk3_1(X1))
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_8 ).

cnf(c_0_23,negated_conjecture,
    ( f(esk5_0)
    | f(esk2_0)
    | ~ f(X1)
    | ~ f(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    ( f(esk4_0)
    | f(esk5_0) ),
    i_0_4 ).

cnf(c_0_25,negated_conjecture,
    ( f(esk1_0)
    | esk3_1(X1) != X1
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_9 ).

cnf(c_0_26,negated_conjecture,
    ( f(esk1_0)
    | f(esk3_1(X1))
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_10 ).

fof(c_0_27,plain,
    ( ~ epred2_0
  <=> ! [X2] : ~ f(X2) ),
    introduced(definition) ).

cnf(c_0_28,negated_conjecture,
    ( f(esk2_0)
    | f(esk5_0)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( f(esk5_0)
    | f(esk1_0)
    | ~ f(X1)
    | ~ f(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21])]),c_0_26]) ).

fof(c_0_30,plain,
    ( ~ epred1_0
  <=> ! [X1] :
        ( ~ f(X1)
        | esk3_1(X1) != X1
        | esk1_0 != esk2_0 ) ),
    introduced(definition) ).

cnf(c_0_31,negated_conjecture,
    ( esk3_1(X1) != X1
    | esk2_0 != esk1_0
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_5 ).

cnf(c_0_32,negated_conjecture,
    ( epred2_0
    | ~ f(X1) ),
    inference(split_equiv,[status(thm)],[c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( X1 = X2
    | esk5_0 = X3
    | ~ f(X2)
    | ~ f(X1)
    | ~ f(X3) ),
    i_0_1 ).

cnf(c_0_34,negated_conjecture,
    ( f(esk5_0)
    | f(esk2_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_24]) ).

cnf(c_0_35,negated_conjecture,
    ( f(esk1_0)
    | f(esk5_0)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_30]),c_0_27]) ).

cnf(c_0_37,negated_conjecture,
    epred2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    ( esk5_0 = X1
    | X2 != esk5_0
    | ~ f(X1)
    | ~ f(X2) ),
    inference(ef,[status(thm)],[c_0_33]) ).

cnf(c_0_39,negated_conjecture,
    ( esk2_0 = X1
    | f(esk5_0)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ( f(esk5_0)
    | f(esk1_0) ),
    inference(spm,[status(thm)],[c_0_35,c_0_24]) ).

cnf(c_0_41,negated_conjecture,
    ~ epred1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).

cnf(c_0_42,negated_conjecture,
    ( esk5_0 = X1
    | ~ f(esk5_0)
    | ~ f(X1) ),
    inference(er,[status(thm)],[c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    ( esk1_0 = esk2_0
    | f(esk5_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,negated_conjecture,
    ( esk3_1(X1) != X1
    | esk1_0 != esk2_0
    | ~ f(X1) ),
    inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_30]),c_0_41]) ).

cnf(c_0_45,negated_conjecture,
    ( f(esk3_1(X1))
    | esk2_0 != esk1_0
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_6 ).

cnf(c_0_46,negated_conjecture,
    ( esk1_0 = esk2_0
    | esk5_0 = X1
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    ( esk5_0 = X1
    | ~ f(X2)
    | ~ f(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33])]),c_0_45]),c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ( esk5_0 = X1
    | ~ f(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_24]),c_0_47]) ).

cnf(c_0_49,negated_conjecture,
    ( esk3_1(X1) = esk5_0
    | f(esk2_0)
    | ~ f(X2)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_22]) ).

cnf(c_0_50,negated_conjecture,
    ( f(esk2_0)
    | ~ f(X1)
    | ~ f(X2)
    | ~ f(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_49]),c_0_48]) ).

cnf(c_0_51,negated_conjecture,
    ( esk2_0 = esk5_0
    | f(esk5_0)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_34]) ).

cnf(c_0_52,negated_conjecture,
    ( esk2_0 = esk5_0
    | ~ f(X1)
    | ~ f(X2)
    | ~ f(X3) ),
    inference(spm,[status(thm)],[c_0_48,c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    ( esk2_0 = esk5_0
    | f(esk5_0) ),
    inference(spm,[status(thm)],[c_0_51,c_0_24]) ).

cnf(c_0_54,negated_conjecture,
    ( esk2_0 = esk5_0
    | ~ f(X1)
    | ~ f(X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_55,negated_conjecture,
    ( esk3_1(X1) = esk5_0
    | f(esk1_0)
    | ~ f(X2)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_26]) ).

cnf(c_0_56,negated_conjecture,
    ( esk2_0 = esk5_0
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    ( f(esk1_0)
    | ~ f(X1)
    | ~ f(X2)
    | ~ f(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_55]),c_0_48]) ).

cnf(c_0_58,negated_conjecture,
    esk2_0 = esk5_0,
    inference(spm,[status(thm)],[c_0_56,c_0_53]) ).

cnf(c_0_59,negated_conjecture,
    ( esk1_0 = esk5_0
    | ~ f(X1)
    | ~ f(X2)
    | ~ f(X3) ),
    inference(spm,[status(thm)],[c_0_48,c_0_57]) ).

cnf(c_0_60,negated_conjecture,
    ( esk1_0 = esk5_0
    | f(esk5_0) ),
    inference(rw,[status(thm)],[c_0_43,c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ( esk1_0 = esk5_0
    | ~ f(X1)
    | ~ f(X2) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_62,negated_conjecture,
    ( esk1_0 = esk5_0
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    ( f(esk3_1(X1))
    | esk1_0 != esk5_0
    | ~ f(X2)
    | ~ f(X1) ),
    inference(rw,[status(thm)],[c_0_45,c_0_58]) ).

cnf(c_0_64,negated_conjecture,
    esk1_0 = esk5_0,
    inference(spm,[status(thm)],[c_0_62,c_0_60]) ).

cnf(c_0_65,negated_conjecture,
    ( esk3_1(X1) != X1
    | esk1_0 != esk5_0
    | ~ f(X1) ),
    inference(rw,[status(thm)],[c_0_44,c_0_58]) ).

cnf(c_0_66,negated_conjecture,
    ( f(esk3_1(X1))
    | ~ f(X2)
    | ~ f(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).

fof(c_0_67,plain,
    ( ~ epred4_0
  <=> ! [X1] : ~ f(X1) ),
    introduced(definition) ).

fof(c_0_68,plain,
    ( ~ epred5_0
  <=> ! [X2] : ~ f(X2) ),
    introduced(definition) ).

cnf(c_0_69,negated_conjecture,
    ( esk3_1(X1) != X1
    | ~ f(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_64])]) ).

cnf(c_0_70,negated_conjecture,
    ( esk3_1(X1) = esk5_0
    | ~ f(X2)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_66]) ).

cnf(c_0_71,negated_conjecture,
    ( epred4_0
    | ~ f(X1) ),
    inference(split_equiv,[status(thm)],[c_0_67]) ).

cnf(c_0_72,negated_conjecture,
    f(esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_58])]) ).

cnf(c_0_73,negated_conjecture,
    ( ~ epred5_0
    | ~ epred4_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_48]),c_0_67]),c_0_68]) ).

cnf(c_0_74,negated_conjecture,
    epred4_0,
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_75,negated_conjecture,
    ~ epred5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).

cnf(c_0_76,negated_conjecture,
    ~ f(X1),
    inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_68]),c_0_75]) ).

cnf(c_0_77,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_72,c_0_76]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN415+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul 12 04:29:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.72/2.24  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.24  # No SInE strategy applied
% 7.72/2.24  # Trying AutoSched0 for 150 seconds
% 7.72/2.24  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.72/2.24  # and selection function SelectCQPrecWNTNp.
% 7.72/2.24  #
% 7.72/2.24  # Preprocessing time       : 0.020 s
% 7.72/2.24  
% 7.72/2.24  # Proof found!
% 7.72/2.24  # SZS status Theorem
% 7.72/2.24  # SZS output start CNFRefutation
% See solution above
% 7.72/2.24  # Training examples: 0 positive, 0 negative
% 7.72/2.24  
% 7.72/2.24  # -------------------------------------------------
% 7.72/2.24  # User time                : 0.024 s
% 7.72/2.24  # System time              : 0.007 s
% 7.72/2.24  # Total time               : 0.031 s
% 7.72/2.24  # Maximum resident set size: 7124 pages
% 7.72/2.24  
%------------------------------------------------------------------------------