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

View Problem - Process Solution

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

% Computer : n010.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 : Tue Jul 19 08:39:16 EDT 2022

% Result   : Theorem 8.68s 2.44s
% Output   : CNFRefutation 8.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (   9 unt;   5 nHn;  24 RR)
%            Number of literals    :   85 (   8 equ;  51 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-5 aty)
%            Number of variables   :   69 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( in(X1,X2)
    | X2 != relation_dom(X3)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_8) ).

cnf(i_0_2,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_2) ).

cnf(i_0_16,plain,
    ( in(unordered_pair(unordered_pair(X1,esk5_5(X2,X3,X4,X1,X5)),singleton(X1)),X2)
    | X4 != relation_composition(X2,X3)
    | ~ relation(X4)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_16) ).

cnf(i_0_23,plain,
    ( relation(relation_composition(X1,X2))
    | ~ relation(X2)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_23) ).

cnf(i_0_9,plain,
    ( in(unordered_pair(unordered_pair(X1,esk2_3(X2,X3,X1)),singleton(X1)),X2)
    | X3 != relation_dom(X2)
    | ~ relation(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_9) ).

cnf(i_0_4,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_4) ).

cnf(i_0_46,negated_conjecture,
    relation(esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_46) ).

cnf(i_0_45,negated_conjecture,
    relation(esk16_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_45) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_3) ).

cnf(i_0_44,negated_conjecture,
    ~ subset(relation_dom(relation_composition(esk15_0,esk16_0)),relation_dom(esk15_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-upor9hki/lgb.p',i_0_44) ).

cnf(c_0_57,plain,
    ( in(X1,X2)
    | X2 != relation_dom(X3)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
    i_0_8 ).

cnf(c_0_58,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
    inference(er,[status(thm)],[c_0_57]) ).

cnf(c_0_59,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_60,plain,
    ( in(unordered_pair(unordered_pair(X1,esk5_5(X2,X3,X4,X1,X5)),singleton(X1)),X2)
    | X4 != relation_composition(X2,X3)
    | ~ relation(X4)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4) ),
    i_0_16 ).

cnf(c_0_61,plain,
    ( relation(relation_composition(X1,X2))
    | ~ relation(X2)
    | ~ relation(X1) ),
    i_0_23 ).

cnf(c_0_62,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_63,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,esk5_5(X2,X3,relation_composition(X2,X3),X1,X4))),X2)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),relation_composition(X2,X3)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_59])]),c_0_61]) ).

cnf(c_0_64,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),relation_composition(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_65,plain,
    ( in(unordered_pair(unordered_pair(X1,esk2_3(X2,X3,X1)),singleton(X1)),X2)
    | X3 != relation_dom(X2)
    | ~ relation(X2)
    | ~ in(X1,X3) ),
    i_0_9 ).

cnf(c_0_66,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ relation(X3)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X4)),relation_composition(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_59]) ).

cnf(c_0_67,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_3(X2,relation_dom(X2),X1))),X2)
    | ~ relation(X2)
    | ~ in(X1,relation_dom(X2)) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_59])]) ).

cnf(c_0_68,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ relation(X3)
    | ~ in(X1,relation_dom(relation_composition(X2,X3))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_61]) ).

cnf(c_0_69,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_4 ).

cnf(c_0_70,plain,
    ( in(esk1_2(relation_dom(relation_composition(X1,X2)),X3),relation_dom(X1))
    | subset(relation_dom(relation_composition(X1,X2)),X3)
    | ~ relation(X1)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_71,negated_conjecture,
    relation(esk15_0),
    i_0_46 ).

cnf(c_0_72,negated_conjecture,
    ( in(esk1_2(relation_dom(relation_composition(esk15_0,X1)),X2),relation_dom(esk15_0))
    | subset(relation_dom(relation_composition(esk15_0,X1)),X2)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_73,negated_conjecture,
    relation(esk16_0),
    i_0_45 ).

cnf(c_0_74,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_3 ).

cnf(c_0_75,negated_conjecture,
    ( in(esk1_2(relation_dom(relation_composition(esk15_0,esk16_0)),X1),relation_dom(esk15_0))
    | subset(relation_dom(relation_composition(esk15_0,esk16_0)),X1) ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_76,negated_conjecture,
    ~ subset(relation_dom(relation_composition(esk15_0,esk16_0)),relation_dom(esk15_0)),
    i_0_44 ).

cnf(c_0_77,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU182+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n010.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 07:05:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.68/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.68/2.44  # No SInE strategy applied
% 8.68/2.44  # Trying AutoSched0 for 150 seconds
% 8.68/2.44  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.68/2.44  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.68/2.44  #
% 8.68/2.44  # Preprocessing time       : 0.030 s
% 8.68/2.44  # Presaturation interreduction done
% 8.68/2.44  
% 8.68/2.44  # Proof found!
% 8.68/2.44  # SZS status Theorem
% 8.68/2.44  # SZS output start CNFRefutation
% See solution above
% 8.68/2.44  # Training examples: 0 positive, 0 negative
% 8.68/2.44  
% 8.68/2.44  # -------------------------------------------------
% 8.68/2.44  # User time                : 0.035 s
% 8.68/2.44  # System time              : 0.010 s
% 8.68/2.44  # Total time               : 0.046 s
% 8.68/2.44  # Maximum resident set size: 7120 pages
% 8.68/2.44  
%------------------------------------------------------------------------------