↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n022.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 00:15:31 EDT 2022

% Result   : Theorem 8.15s 2.47s
% Output   : CNFRefutation 8.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (   5 unt;   2 nHn;  13 RR)
%            Number of literals    :   29 (   5 equ;  12 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nky01cbm/lgb.p',i_0_12) ).

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

cnf(i_0_13,negated_conjecture,
    ( unordered_pair(unordered_pair(esk6_1(X1),esk7_1(X1)),singleton(esk6_1(X1))) = X1
    | ~ in(X1,esk4_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nky01cbm/lgb.p',i_0_13) ).

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

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

cnf(i_0_11,negated_conjecture,
    ~ subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nky01cbm/lgb.p',i_0_11) ).

cnf(c_0_20,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0) ),
    i_0_12 ).

cnf(c_0_21,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_22,negated_conjecture,
    ( unordered_pair(unordered_pair(esk6_1(X1),esk7_1(X1)),singleton(esk6_1(X1))) = X1
    | ~ in(X1,esk4_0) ),
    i_0_13 ).

cnf(c_0_23,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( unordered_pair(singleton(esk6_1(X1)),unordered_pair(esk6_1(X1),esk7_1(X1))) = X1
    | ~ in(X1,esk4_0) ),
    inference(rw,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_25,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_3 ).

cnf(c_0_26,negated_conjecture,
    ( in(X1,esk5_0)
    | ~ in(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    ( subset(X1,esk5_0)
    | ~ in(esk1_2(X1,esk5_0),esk4_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_4 ).

cnf(c_0_29,negated_conjecture,
    ~ subset(esk4_0,esk5_0),
    i_0_11 ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul 11 08:06:56 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 8.15/2.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.15/2.47  # No SInE strategy applied
% 8.15/2.47  # Trying AutoSched0 for 150 seconds
% 8.15/2.47  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.15/2.47  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.15/2.47  #
% 8.15/2.47  # Preprocessing time       : 0.013 s
% 8.15/2.47  # Presaturation interreduction done
% 8.15/2.47  
% 8.15/2.47  # Proof found!
% 8.15/2.47  # SZS status Theorem
% 8.15/2.47  # SZS output start CNFRefutation
% See solution above
% 8.15/2.47  # Training examples: 0 positive, 0 negative
% 8.15/2.47  
% 8.15/2.47  # -------------------------------------------------
% 8.15/2.47  # User time                : 0.014 s
% 8.15/2.47  # System time              : 0.005 s
% 8.15/2.47  # Total time               : 0.019 s
% 8.15/2.47  # Maximum resident set size: 7124 pages
% 8.15/2.47  
%------------------------------------------------------------------------------