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

View Problem - Process Solution

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

% Computer : n032.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:17 EDT 2022

% Result   : Theorem 4.18s 2.10s
% Output   : CNFRefutation 4.18s
% 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 (   0 sgn)

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

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

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

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

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

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

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

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

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

cnf(i_0_44,negated_conjecture,
    ~ subset(relation_rng(relation_composition(esk15_0,esk16_0)),relation_rng(esk16_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-59vnxdgv/lgb.p',i_0_44) ).

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

cnf(c_0_58,plain,
    ( in(X1,relation_rng(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),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(esk5_5(X1,X2,X3,X4,X5),X5),singleton(esk5_5(X1,X2,X3,X4,X5))),X2)
    | X3 != relation_composition(X1,X2)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3) ),
    i_0_15 ).

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_rng(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X3)),X2) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_63,plain,
    ( in(unordered_pair(unordered_pair(X1,esk5_5(X2,X3,relation_composition(X2,X3),X4,X1)),singleton(esk5_5(X2,X3,relation_composition(X2,X3),X4,X1))),X3)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),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_rng(X2))
    | ~ relation(X2)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),relation_composition(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

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

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

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

cnf(c_0_68,plain,
    ( in(X1,relation_rng(X2))
    | ~ relation(X2)
    | ~ relation(X3)
    | ~ in(X1,relation_rng(relation_composition(X3,X2))) ),
    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_rng(relation_composition(X1,X2)),X3),relation_rng(X2))
    | subset(relation_rng(relation_composition(X1,X2)),X3)
    | ~ relation(X2)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

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

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

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

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_rng(relation_composition(esk15_0,esk16_0)),X1),relation_rng(esk16_0))
    | subset(relation_rng(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_rng(relation_composition(esk15_0,esk16_0)),relation_rng(esk16_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.02/0.09  % Problem  : SEU183+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.09  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Mon Jun 20 08:41:20 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.13/0.35  # ENIGMATIC: Selected complete mode:
% 4.18/2.10  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.18/2.10  # No SInE strategy applied
% 4.18/2.10  # Trying AutoSched0 for 150 seconds
% 4.18/2.10  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.18/2.10  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.18/2.10  #
% 4.18/2.10  # Preprocessing time       : 0.015 s
% 4.18/2.10  # Presaturation interreduction done
% 4.18/2.10  
% 4.18/2.10  # Proof found!
% 4.18/2.10  # SZS status Theorem
% 4.18/2.10  # SZS output start CNFRefutation
% See solution above
% 4.18/2.10  # Training examples: 0 positive, 0 negative
% 4.18/2.10  
% 4.18/2.10  # -------------------------------------------------
% 4.18/2.10  # User time                : 0.017 s
% 4.18/2.10  # System time              : 0.006 s
% 4.18/2.10  # Total time               : 0.023 s
% 4.18/2.10  # Maximum resident set size: 7128 pages
% 4.18/2.10  
%------------------------------------------------------------------------------