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

View Problem - Process Solution

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

% Computer : n012.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:49 EDT 2022

% Result   : Theorem 8.46s 2.48s
% Output   : CNFRefutation 8.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   35 (  15 unt;   6 nHn;  28 RR)
%            Number of literals    :   73 (  32 equ;  36 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   95 (  22 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X4,X3,X5) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_12) ).

cnf(i_0_11,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X4,X5,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_11) ).

cnf(i_0_51,plain,
    ( ~ in(X1,X2)
    | ~ in(X3,X2)
    | ~ in(X3,esk15_2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_51) ).

cnf(i_0_14,plain,
    ( X1 = X2
    | X1 = X3
    | X1 = X4
    | X5 != unordered_triple(X4,X3,X2)
    | ~ in(X1,X5) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_14) ).

cnf(i_0_52,plain,
    ( in(esk15_2(X1,X2),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_52) ).

cnf(i_0_13,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X3,X4,X5) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_13) ).

cnf(i_0_46,negated_conjecture,
    in(esk14_0,esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_46) ).

cnf(i_0_47,negated_conjecture,
    in(esk13_0,esk14_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_47) ).

cnf(i_0_48,negated_conjecture,
    in(esk12_0,esk13_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tkfuudy3/lgb.p',i_0_48) ).

cnf(c_0_62,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X4,X3,X5) ),
    i_0_12 ).

cnf(c_0_63,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X4,X5,X3) ),
    i_0_11 ).

cnf(c_0_64,plain,
    ( ~ in(X1,X2)
    | ~ in(X3,X2)
    | ~ in(X3,esk15_2(X1,X2)) ),
    i_0_51 ).

cnf(c_0_65,plain,
    in(X1,unordered_triple(X2,X1,X3)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_62])]) ).

cnf(c_0_66,plain,
    ( X1 = X2
    | X1 = X3
    | X1 = X4
    | X5 != unordered_triple(X4,X3,X2)
    | ~ in(X1,X5) ),
    i_0_14 ).

cnf(c_0_67,plain,
    ( in(esk15_2(X1,X2),X2)
    | ~ in(X1,X2) ),
    i_0_52 ).

cnf(c_0_68,plain,
    in(X1,unordered_triple(X2,X3,X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_63])]) ).

cnf(c_0_69,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_triple(X3,X4,X5) ),
    i_0_13 ).

cnf(c_0_70,plain,
    ( ~ in(X1,esk15_2(X2,unordered_triple(X3,X1,X4)))
    | ~ in(X2,unordered_triple(X3,X1,X4)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_71,plain,
    ( X1 = X2
    | X1 = X3
    | X1 = X4
    | ~ in(X1,unordered_triple(X2,X3,X4)) ),
    inference(er,[status(thm)],[c_0_66]) ).

cnf(c_0_72,plain,
    in(esk15_2(X1,unordered_triple(X2,X3,X1)),unordered_triple(X2,X3,X1)),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_73,plain,
    in(X1,unordered_triple(X1,X2,X3)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_69])]) ).

cnf(c_0_74,plain,
    ~ in(X1,esk15_2(X2,unordered_triple(X3,X1,X2))),
    inference(spm,[status(thm)],[c_0_70,c_0_68]) ).

cnf(c_0_75,plain,
    ( esk15_2(X1,unordered_triple(X2,X3,X1)) = X2
    | esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
    | esk15_2(X1,unordered_triple(X2,X3,X1)) = X1 ),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_76,plain,
    ( ~ in(X1,esk15_2(X2,unordered_triple(X1,X3,X4)))
    | ~ in(X2,unordered_triple(X1,X3,X4)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_73]) ).

cnf(c_0_77,plain,
    ( esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
    | esk15_2(X1,unordered_triple(X2,X3,X1)) = X2
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_78,negated_conjecture,
    in(esk14_0,esk12_0),
    i_0_46 ).

cnf(c_0_79,plain,
    ~ in(X1,esk15_2(X2,unordered_triple(X1,X3,X2))),
    inference(spm,[status(thm)],[c_0_76,c_0_68]) ).

cnf(c_0_80,negated_conjecture,
    ( esk15_2(esk12_0,unordered_triple(X1,esk14_0,esk12_0)) = esk14_0
    | esk15_2(esk12_0,unordered_triple(X1,esk14_0,esk12_0)) = X1 ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_81,plain,
    ( ~ in(X1,esk15_2(X2,unordered_triple(X3,X4,X1)))
    | ~ in(X2,unordered_triple(X3,X4,X1)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_68]) ).

cnf(c_0_82,plain,
    ( esk15_2(esk12_0,unordered_triple(X1,esk14_0,esk12_0)) = X1
    | ~ in(X1,esk14_0) ),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_83,negated_conjecture,
    in(esk13_0,esk14_0),
    i_0_47 ).

cnf(c_0_84,plain,
    ~ in(X1,esk15_2(X1,unordered_triple(X2,X3,X1))),
    inference(spm,[status(thm)],[c_0_81,c_0_68]) ).

cnf(c_0_85,negated_conjecture,
    esk15_2(esk12_0,unordered_triple(esk13_0,esk14_0,esk12_0)) = esk13_0,
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_86,negated_conjecture,
    in(esk12_0,esk13_0),
    i_0_48 ).

cnf(c_0_87,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU229+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n012.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jun 20 03:16:09 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.46/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.46/2.48  # No SInE strategy applied
% 8.46/2.48  # Trying AutoSched0 for 150 seconds
% 8.46/2.48  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.46/2.48  # and selection function SelectCQArNTNpEqFirst.
% 8.46/2.48  #
% 8.46/2.48  # Preprocessing time       : 0.013 s
% 8.46/2.48  # Presaturation interreduction done
% 8.46/2.48  
% 8.46/2.48  # Proof found!
% 8.46/2.48  # SZS status Theorem
% 8.46/2.48  # SZS output start CNFRefutation
% See solution above
% 8.46/2.48  # Training examples: 0 positive, 0 negative
% 8.46/2.48  
% 8.46/2.48  # -------------------------------------------------
% 8.46/2.48  # User time                : 0.145 s
% 8.46/2.48  # System time              : 0.004 s
% 8.46/2.48  # Total time               : 0.149 s
% 8.46/2.48  # Maximum resident set size: 7128 pages
% 8.46/2.48  
%------------------------------------------------------------------------------