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

View Problem - Process Solution

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

% Computer : n005.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:00 EDT 2022

% Result   : Theorem 7.70s 2.42s
% Output   : CNFRefutation 7.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   42 (   9 unt;  11 nHn;  26 RR)
%            Number of literals    :   82 (  16 equ;  34 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  102 (  34 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_78,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | ~ contains_pq(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_78) ).

cnf(i_0_55,plain,
    i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_55) ).

cnf(i_0_82,negated_conjecture,
    ( ~ contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)
    | ~ contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_82) ).

cnf(i_0_79,plain,
    ( X1 = X2
    | contains_pq(X3,X2)
    | ~ contains_pq(insert_pq(X3,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_79) ).

cnf(i_0_38,plain,
    ( contains_cpq(triple(X1,X2,X3),X4)
    | ~ contains_slb(X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_38) ).

cnf(i_0_81,negated_conjecture,
    ( contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)
    | contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_81) ).

cnf(i_0_15,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | ~ contains_slb(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_15) ).

cnf(i_0_39,plain,
    ( contains_slb(X1,X2)
    | ~ contains_cpq(triple(X3,X1,X4),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_39) ).

cnf(i_0_84,negated_conjecture,
    ( contains_pq(i(triple(X1,esk5_0,X2)),X3)
    | ~ contains_cpq(triple(X1,esk5_0,X2),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_84) ).

cnf(i_0_16,plain,
    ( X1 = X2
    | contains_slb(X3,X2)
    | ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_16) ).

cnf(i_0_83,negated_conjecture,
    ( contains_cpq(triple(X1,esk5_0,X2),X3)
    | ~ contains_pq(i(triple(X1,esk5_0,X2)),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_83) ).

cnf(i_0_77,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | X2 != X3 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_77) ).

cnf(i_0_14,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | X2 != X4 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ovhtdliu/lgb.p',i_0_14) ).

cnf(c_0_98,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | ~ contains_pq(X1,X3) ),
    i_0_78 ).

cnf(c_0_99,plain,
    i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
    i_0_55 ).

cnf(c_0_100,negated_conjecture,
    ( ~ contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)
    | ~ contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0) ),
    i_0_82 ).

cnf(c_0_101,plain,
    ( contains_pq(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)),X6)
    | ~ contains_pq(i(triple(X1,X2,X5)),X6) ),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_102,plain,
    ( X1 = X2
    | contains_pq(X3,X2)
    | ~ contains_pq(insert_pq(X3,X1),X2) ),
    i_0_79 ).

cnf(c_0_103,negated_conjecture,
    ( ~ contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0)
    | ~ contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0) ),
    inference(spm,[status(thm)],[c_0_100,c_0_101]) ).

cnf(c_0_104,plain,
    ( contains_cpq(triple(X1,X2,X3),X4)
    | ~ contains_slb(X2,X4) ),
    i_0_38 ).

cnf(c_0_105,plain,
    ( X1 = X2
    | contains_pq(i(triple(X3,X4,X5)),X2)
    | ~ contains_pq(i(triple(X3,insert_slb(X4,pair(X1,X6)),X5)),X2) ),
    inference(spm,[status(thm)],[c_0_102,c_0_99]) ).

cnf(c_0_106,negated_conjecture,
    ( contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)
    | contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0) ),
    i_0_81 ).

cnf(c_0_107,plain,
    ( ~ contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)
    | ~ contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0) ),
    inference(spm,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_108,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | ~ contains_slb(X1,X4) ),
    i_0_15 ).

cnf(c_0_109,plain,
    ( contains_slb(X1,X2)
    | ~ contains_cpq(triple(X3,X1,X4),X2) ),
    i_0_39 ).

cnf(c_0_110,negated_conjecture,
    ( esk10_0 = esk8_0
    | contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0)
    | contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_111,plain,
    ( ~ contains_slb(esk5_0,esk10_0)
    | ~ contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0) ),
    inference(spm,[status(thm)],[c_0_107,c_0_108]) ).

cnf(c_0_112,negated_conjecture,
    ( contains_pq(i(triple(X1,esk5_0,X2)),X3)
    | ~ contains_cpq(triple(X1,esk5_0,X2),X3) ),
    i_0_84 ).

cnf(c_0_113,plain,
    ( X1 = X2
    | contains_slb(X3,X2)
    | ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
    i_0_16 ).

cnf(c_0_114,plain,
    ( esk10_0 = esk8_0
    | contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)
    | contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0) ),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_115,negated_conjecture,
    ~ contains_slb(esk5_0,esk10_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_104]) ).

cnf(c_0_116,negated_conjecture,
    ( contains_cpq(triple(X1,esk5_0,X2),X3)
    | ~ contains_pq(i(triple(X1,esk5_0,X2)),X3) ),
    i_0_83 ).

cnf(c_0_117,plain,
    ( esk10_0 = esk8_0
    | contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]) ).

cnf(c_0_118,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | X2 != X3 ),
    i_0_77 ).

cnf(c_0_119,negated_conjecture,
    ( esk10_0 = esk8_0
    | contains_cpq(triple(esk6_0,esk5_0,esk7_0),esk10_0) ),
    inference(spm,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_120,plain,
    contains_pq(insert_pq(X1,X2),X2),
    inference(er,[status(thm)],[c_0_118]) ).

cnf(c_0_121,plain,
    esk10_0 = esk8_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_119]),c_0_115]) ).

cnf(c_0_122,plain,
    contains_pq(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)),X3),
    inference(spm,[status(thm)],[c_0_120,c_0_99]) ).

cnf(c_0_123,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | X2 != X4 ),
    i_0_14 ).

cnf(c_0_124,negated_conjecture,
    ~ contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk8_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_121]),c_0_122]),c_0_121])]) ).

cnf(c_0_125,plain,
    contains_slb(insert_slb(X1,pair(X2,X3)),X2),
    inference(er,[status(thm)],[c_0_123]) ).

cnf(c_0_126,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_104]),c_0_125])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV370+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n005.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun 15 00:51:26 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.70/2.42  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.42  # No SInE strategy applied
% 7.70/2.42  # Trying AutoSched0 for 150 seconds
% 7.70/2.42  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.70/2.42  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.70/2.42  #
% 7.70/2.42  # Preprocessing time       : 0.023 s
% 7.70/2.42  # Presaturation interreduction done
% 7.70/2.42  
% 7.70/2.42  # Proof found!
% 7.70/2.42  # SZS status Theorem
% 7.70/2.42  # SZS output start CNFRefutation
% See solution above
% 7.70/2.42  # Training examples: 0 positive, 0 negative
% 7.70/2.42  
% 7.70/2.42  # -------------------------------------------------
% 7.70/2.42  # User time                : 0.031 s
% 7.70/2.42  # System time              : 0.005 s
% 7.70/2.42  # Total time               : 0.036 s
% 7.70/2.42  # Maximum resident set size: 7128 pages
% 7.70/2.42  
%------------------------------------------------------------------------------