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

View Problem - Process Solution

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

% Computer : n019.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:04 EDT 2022

% Result   : Theorem 8.39s 2.48s
% Output   : CNFRefutation 8.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   47 (  13 unt;  18 nHn;  26 RR)
%            Number of literals    :  106 (   9 equ;  43 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :  116 (  37 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
    ~ ok(triple(X1,X2,bad)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_30) ).

cnf(i_0_35,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
    | ~ contains_slb(X2,X4)
    | ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_35) ).

cnf(i_0_49,lemma,
    ( contains_slb(X1,X2)
    | ~ ok(remove_cpq(triple(X3,X1,X4),X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_49) ).

cnf(i_0_46,negated_conjecture,
    ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_46) ).

cnf(i_0_55,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1)
    | ~ less_than(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_55) ).

cnf(i_0_58,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_58) ).

cnf(i_0_53,lemma,
    ( less_than(X1,X2)
    | ~ pair_in_list(X3,X2,X1)
    | ~ check_cpq(triple(X4,X3,X5)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_53) ).

cnf(i_0_34,plain,
    ( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
    | ~ contains_slb(X3,X2)
    | ~ less_than(lookup_slb(X3,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_34) ).

cnf(i_0_50,lemma,
    ( X1 = X2
    | pair_in_list(remove_slb(X3,X2),X1,X4)
    | ~ contains_slb(X3,X2)
    | ~ pair_in_list(X3,X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_50) ).

cnf(i_0_52,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | pair_in_list(X2,esk5_2(X1,X2),esk6_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_52) ).

cnf(i_0_47,negated_conjecture,
    check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_47) ).

cnf(i_0_51,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | ~ less_than(esk6_2(X1,X2),esk5_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_51) ).

cnf(i_0_48,lemma,
    ( less_than(X1,X2)
    | ~ pair_in_list(X3,X2,X1)
    | ~ check_cpq(remove_cpq(triple(X4,X3,X5),X2))
    | ~ ok(remove_cpq(triple(X4,X3,X5),X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_48) ).

cnf(i_0_45,negated_conjecture,
    ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eny16jeh/lgb.p',i_0_45) ).

cnf(c_0_73,plain,
    ~ ok(triple(X1,X2,bad)),
    i_0_30 ).

cnf(c_0_74,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
    | ~ contains_slb(X2,X4)
    | ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
    i_0_35 ).

cnf(c_0_75,lemma,
    ( contains_slb(X1,X2)
    | ~ ok(remove_cpq(triple(X3,X1,X4),X2)) ),
    i_0_49 ).

cnf(c_0_76,plain,
    ( ~ strictly_less_than(X1,lookup_slb(X2,X1))
    | ~ ok(remove_cpq(triple(X3,X2,X4),X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).

cnf(c_0_77,negated_conjecture,
    ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    i_0_46 ).

cnf(c_0_78,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1)
    | ~ less_than(X1,X2) ),
    i_0_55 ).

cnf(c_0_79,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    i_0_58 ).

cnf(c_0_80,lemma,
    ( less_than(X1,X2)
    | ~ pair_in_list(X3,X2,X1)
    | ~ check_cpq(triple(X4,X3,X5)) ),
    i_0_53 ).

cnf(c_0_81,plain,
    ( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
    | ~ contains_slb(X3,X2)
    | ~ less_than(lookup_slb(X3,X2),X2) ),
    i_0_34 ).

cnf(c_0_82,negated_conjecture,
    ~ strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0)),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_83,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_84,lemma,
    ( X1 = X2
    | pair_in_list(remove_slb(X3,X2),X1,X4)
    | ~ contains_slb(X3,X2)
    | ~ pair_in_list(X3,X1,X4) ),
    i_0_50 ).

cnf(c_0_85,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | pair_in_list(X2,esk5_2(X1,X2),esk6_2(X1,X2)) ),
    i_0_52 ).

cnf(c_0_86,lemma,
    ( less_than(X1,X2)
    | ~ contains_slb(X3,X4)
    | ~ pair_in_list(remove_slb(X3,X4),X2,X1)
    | ~ less_than(lookup_slb(X3,X4),X4)
    | ~ check_cpq(remove_cpq(triple(X5,X3,X6),X4)) ),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_87,negated_conjecture,
    check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    i_0_47 ).

cnf(c_0_88,lemma,
    contains_slb(esk2_0,esk4_0),
    inference(spm,[status(thm)],[c_0_75,c_0_77]) ).

cnf(c_0_89,plain,
    less_than(lookup_slb(esk2_0,esk4_0),esk4_0),
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_90,lemma,
    ( esk5_2(X1,X2) = X3
    | pair_in_list(remove_slb(X2,X3),esk5_2(X1,X2),esk6_2(X1,X2))
    | check_cpq(triple(X1,X2,X4))
    | ~ contains_slb(X2,X3) ),
    inference(spm,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_91,negated_conjecture,
    ( less_than(X1,X2)
    | ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_89])]) ).

cnf(c_0_92,lemma,
    ( esk5_2(X1,esk2_0) = esk4_0
    | pair_in_list(remove_slb(esk2_0,esk4_0),esk5_2(X1,esk2_0),esk6_2(X1,esk2_0))
    | check_cpq(triple(X1,esk2_0,X2)) ),
    inference(spm,[status(thm)],[c_0_90,c_0_88]) ).

cnf(c_0_93,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | ~ less_than(esk6_2(X1,X2),esk5_2(X1,X2)) ),
    i_0_51 ).

cnf(c_0_94,lemma,
    ( esk5_2(X1,esk2_0) = esk4_0
    | check_cpq(triple(X1,esk2_0,X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]) ).

cnf(c_0_95,lemma,
    ( less_than(X1,X2)
    | ~ pair_in_list(X3,X2,X1)
    | ~ check_cpq(remove_cpq(triple(X4,X3,X5),X2))
    | ~ ok(remove_cpq(triple(X4,X3,X5),X2)) ),
    i_0_48 ).

cnf(c_0_96,lemma,
    ( pair_in_list(esk2_0,esk4_0,esk6_2(X1,esk2_0))
    | check_cpq(triple(X1,esk2_0,X2))
    | check_cpq(triple(X1,esk2_0,X3)) ),
    inference(spm,[status(thm)],[c_0_85,c_0_94]) ).

cnf(c_0_97,negated_conjecture,
    ( less_than(X1,esk4_0)
    | ~ pair_in_list(esk2_0,esk4_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_77]),c_0_87])]) ).

cnf(c_0_98,lemma,
    ( pair_in_list(esk2_0,esk4_0,esk6_2(X1,esk2_0))
    | check_cpq(triple(X1,esk2_0,X2)) ),
    inference(ef,[status(thm)],[c_0_96]) ).

cnf(c_0_99,lemma,
    ( check_cpq(triple(X1,esk2_0,X2))
    | check_cpq(triple(X1,esk2_0,X3))
    | ~ less_than(esk6_2(X1,esk2_0),esk4_0) ),
    inference(spm,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_100,negated_conjecture,
    ( less_than(esk6_2(X1,esk2_0),esk4_0)
    | check_cpq(triple(X1,esk2_0,X2)) ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_101,negated_conjecture,
    ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    i_0_45 ).

cnf(c_0_102,lemma,
    ( check_cpq(triple(X1,esk2_0,X2))
    | check_cpq(triple(X1,esk2_0,X3))
    | check_cpq(triple(X1,esk2_0,X4)) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_103,negated_conjecture,
    ( check_cpq(triple(esk1_0,esk2_0,X1))
    | check_cpq(triple(esk1_0,esk2_0,X2)) ),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_104,negated_conjecture,
    check_cpq(triple(esk1_0,esk2_0,X1)),
    inference(ef,[status(thm)],[c_0_103]) ).

cnf(c_0_105,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_104])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 : Wed Jun 15 17:57:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.39/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.39/2.48  # No SInE strategy applied
% 8.39/2.48  # Trying AutoSched0 for 150 seconds
% 8.39/2.48  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.39/2.48  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/2.48  #
% 8.39/2.48  # Preprocessing time       : 0.024 s
% 8.39/2.48  # Presaturation interreduction done
% 8.39/2.48  
% 8.39/2.48  # Proof found!
% 8.39/2.48  # SZS status Theorem
% 8.39/2.48  # SZS output start CNFRefutation
% See solution above
% 8.39/2.48  # Training examples: 0 positive, 0 negative
% 8.39/2.48  
% 8.39/2.48  # -------------------------------------------------
% 8.39/2.48  # User time                : 0.043 s
% 8.39/2.48  # System time              : 0.006 s
% 8.39/2.48  # Total time               : 0.049 s
% 8.39/2.48  # Maximum resident set size: 7120 pages
% 8.39/2.48  
%------------------------------------------------------------------------------