TSTP Solution File: SEU186+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n007.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:19 EDT 2022

% Result   : Theorem 8.67s 2.42s
% Output   : CNFRefutation 8.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  10 unt;   2 nHn;  13 RR)
%            Number of literals    :   28 (   9 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_259,negated_conjecture,
    ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_259) ).

cnf(i_0_4,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_4) ).

cnf(i_0_12,plain,
    ( unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))) = X2
    | ~ relation(X1)
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_12) ).

cnf(i_0_25,plain,
    ( X1 = empty_set
    | in(esk8_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_25) ).

cnf(i_0_258,negated_conjecture,
    esk48_0 != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_258) ).

cnf(i_0_260,negated_conjecture,
    relation(esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w10wasd6/input.p',i_0_260) ).

cnf(c_0_267,negated_conjecture,
    ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),esk48_0),
    i_0_259 ).

cnf(c_0_268,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_4 ).

cnf(c_0_269,plain,
    ( unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))) = X2
    | ~ relation(X1)
    | ~ in(X2,X1) ),
    i_0_12 ).

cnf(c_0_270,negated_conjecture,
    ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),esk48_0),
    inference(spm,[status(thm)],[c_0_267,c_0_268]) ).

cnf(c_0_271,plain,
    ( unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))) = X2
    | ~ in(X2,X1)
    | ~ relation(X1) ),
    inference(rw,[status(thm)],[c_0_269,c_0_268]) ).

cnf(c_0_272,plain,
    ( ~ in(X1,esk48_0)
    | ~ in(X1,X2)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_270,c_0_271]) ).

cnf(c_0_273,plain,
    ( X1 = empty_set
    | in(esk8_1(X1),X1) ),
    i_0_25 ).

cnf(c_0_274,negated_conjecture,
    esk48_0 != empty_set,
    i_0_258 ).

cnf(c_0_275,plain,
    ( ~ in(esk8_1(esk48_0),X1)
    | ~ relation(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_273]),c_0_274]) ).

cnf(c_0_276,negated_conjecture,
    relation(esk48_0),
    i_0_260 ).

cnf(c_0_277,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_273]),c_0_276])]),c_0_274]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU186+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n007.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 : Mon Jun 20 03:06:46 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 8.67/2.42  # ENIGMATIC: Solved by autoschedule:
% 8.67/2.42  # No SInE strategy applied
% 8.67/2.42  # Trying AutoSched0 for 150 seconds
% 8.67/2.42  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 8.67/2.42  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.67/2.42  #
% 8.67/2.42  # Preprocessing time       : 0.032 s
% 8.67/2.42  
% 8.67/2.42  # Proof found!
% 8.67/2.42  # SZS status Theorem
% 8.67/2.42  # SZS output start CNFRefutation
% See solution above
% 8.67/2.42  # Training examples: 0 positive, 0 negative
% 8.67/2.42  
% 8.67/2.42  # -------------------------------------------------
% 8.67/2.42  # User time                : 0.139 s
% 8.67/2.42  # System time              : 0.010 s
% 8.67/2.42  # Total time               : 0.149 s
% 8.67/2.42  # Maximum resident set size: 7124 pages
% 8.67/2.42  
%------------------------------------------------------------------------------