↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU150+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n003.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:53 EDT 2022

% Result   : Theorem 7.92s 2.41s
% Output   : CNFRefutation 7.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (   9 unt;   0 nHn;  20 RR)
%            Number of literals    :   33 (  20 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_116,lemma,
    ( X1 = X2
    | unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5x6ovljs/lgb.p',i_0_116) ).

cnf(i_0_118,negated_conjecture,
    unordered_pair(esk14_0,esk14_0) = unordered_pair(esk15_0,esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5x6ovljs/lgb.p',i_0_118) ).

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

cnf(i_0_65,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5x6ovljs/lgb.p',i_0_65) ).

cnf(i_0_109,lemma,
    ( X1 = X2
    | ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5x6ovljs/lgb.p',i_0_109) ).

cnf(i_0_117,negated_conjecture,
    esk16_0 != esk15_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5x6ovljs/lgb.p',i_0_117) ).

cnf(c_0_125,lemma,
    ( X1 = X2
    | unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
    i_0_116 ).

cnf(c_0_126,negated_conjecture,
    unordered_pair(esk14_0,esk14_0) = unordered_pair(esk15_0,esk16_0),
    i_0_118 ).

cnf(c_0_127,negated_conjecture,
    ( esk14_0 = X1
    | unordered_pair(esk15_0,esk16_0) != unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_128,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    i_0_22 ).

cnf(c_0_129,negated_conjecture,
    esk14_0 = esk15_0,
    inference(er,[status(thm)],[c_0_127]) ).

cnf(c_0_130,plain,
    ( in(X1,X2)
    | X2 != unordered_pair(X3,X1) ),
    inference(er,[status(thm)],[c_0_128]) ).

cnf(c_0_131,negated_conjecture,
    unordered_pair(esk15_0,esk16_0) = unordered_pair(esk15_0,esk15_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_129]),c_0_129]) ).

cnf(c_0_132,plain,
    ( in(esk16_0,X1)
    | X1 != unordered_pair(esk15_0,esk15_0) ),
    inference(spm,[status(thm)],[c_0_130,c_0_131]) ).

cnf(c_0_133,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    i_0_65 ).

cnf(c_0_134,plain,
    in(esk16_0,unordered_pair(esk15_0,esk15_0)),
    inference(er,[status(thm)],[c_0_132]) ).

cnf(c_0_135,lemma,
    ( X1 = X2
    | ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
    i_0_109 ).

cnf(c_0_136,lemma,
    subset(unordered_pair(esk16_0,esk16_0),unordered_pair(esk15_0,esk15_0)),
    inference(spm,[status(thm)],[c_0_133,c_0_134]) ).

cnf(c_0_137,negated_conjecture,
    esk16_0 != esk15_0,
    i_0_117 ).

cnf(c_0_138,lemma,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU150+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 00:08:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.92/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.41  # No SInE strategy applied
% 7.92/2.41  # Trying AutoSched0 for 150 seconds
% 7.92/2.41  # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.92/2.41  # and selection function SelectNewComplexAHP.
% 7.92/2.41  #
% 7.92/2.41  # Preprocessing time       : 0.023 s
% 7.92/2.41  
% 7.92/2.41  # Proof found!
% 7.92/2.41  # SZS status Theorem
% 7.92/2.41  # SZS output start CNFRefutation
% See solution above
% 7.92/2.41  # Training examples: 0 positive, 0 negative
% 7.92/2.41  
% 7.92/2.41  # -------------------------------------------------
% 7.92/2.41  # User time                : 0.030 s
% 7.92/2.41  # System time              : 0.003 s
% 7.92/2.41  # Total time               : 0.034 s
% 7.92/2.41  # Maximum resident set size: 7128 pages
% 7.92/2.41  
%------------------------------------------------------------------------------