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

View Problem - Process Solution

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

% Computer : n027.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:38:54 EDT 2022

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

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

cnf(i_0_24,plain,
    ( X1 = X2
    | X1 = X3
    | X4 != unordered_pair(X3,X2)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie4z7a2x/lgb.p',i_0_24) ).

cnf(i_0_79,negated_conjecture,
    unordered_pair(esk11_0,esk12_0) = unordered_pair(esk13_0,esk14_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie4z7a2x/lgb.p',i_0_79) ).

cnf(i_0_77,negated_conjecture,
    esk11_0 != esk14_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie4z7a2x/lgb.p',i_0_77) ).

cnf(i_0_78,negated_conjecture,
    esk11_0 != esk13_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie4z7a2x/lgb.p',i_0_78) ).

cnf(c_0_85,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_23 ).

cnf(c_0_86,plain,
    ( X1 = X2
    | X1 = X3
    | X4 != unordered_pair(X3,X2)
    | ~ in(X1,X4) ),
    i_0_24 ).

cnf(c_0_87,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_85])]) ).

cnf(c_0_88,negated_conjecture,
    unordered_pair(esk11_0,esk12_0) = unordered_pair(esk13_0,esk14_0),
    i_0_79 ).

cnf(c_0_89,plain,
    ( X1 = X2
    | X1 = X3
    | ~ in(X1,unordered_pair(X2,X3)) ),
    inference(er,[status(thm)],[c_0_86]) ).

cnf(c_0_90,negated_conjecture,
    in(esk11_0,unordered_pair(esk13_0,esk14_0)),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_91,negated_conjecture,
    esk11_0 != esk14_0,
    i_0_77 ).

cnf(c_0_92,negated_conjecture,
    esk11_0 != esk13_0,
    i_0_78 ).

cnf(c_0_93,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU151+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n027.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 14:53:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 7.81/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.43  # No SInE strategy applied
% 7.81/2.43  # Trying AutoSched0 for 150 seconds
% 7.81/2.43  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.81/2.43  # and selection function SelectCQArEqLast.
% 7.81/2.43  #
% 7.81/2.43  # Preprocessing time       : 0.023 s
% 7.81/2.43  # Presaturation interreduction done
% 7.81/2.43  
% 7.81/2.43  # Proof found!
% 7.81/2.43  # SZS status Theorem
% 7.81/2.43  # SZS output start CNFRefutation
% See solution above
% 7.81/2.43  # Training examples: 0 positive, 0 negative
% 7.81/2.43  
% 7.81/2.43  # -------------------------------------------------
% 7.81/2.43  # User time                : 0.023 s
% 7.81/2.43  # System time              : 0.009 s
% 7.81/2.43  # Total time               : 0.031 s
% 7.81/2.43  # Maximum resident set size: 7128 pages
% 7.81/2.43  
%------------------------------------------------------------------------------