↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU153+1 : 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:38:55 EDT 2022

% Result   : Theorem 7.42s 2.27s
% Output   : CNFRefutation 7.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  17 RR)
%            Number of literals    :   37 (  16 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_5) ).

cnf(i_0_12,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_12) ).

cnf(i_0_22,negated_conjecture,
    in(esk4_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_22) ).

cnf(i_0_16,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_16) ).

cnf(i_0_23,negated_conjecture,
    disjoint(singleton(esk4_0),esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_23) ).

cnf(i_0_2,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_2) ).

cnf(i_0_8,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5vmcsv3x/input.p',i_0_8) ).

cnf(c_0_31,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_5 ).

cnf(c_0_32,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    i_0_12 ).

cnf(c_0_33,negated_conjecture,
    in(esk4_0,esk5_0),
    i_0_22 ).

cnf(c_0_34,plain,
    ( in(X1,X2)
    | X2 != singleton(X1) ),
    inference(er,[status(thm)],[c_0_31]) ).

cnf(c_0_35,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    i_0_16 ).

cnf(c_0_36,negated_conjecture,
    disjoint(singleton(esk4_0),esk5_0),
    i_0_23 ).

cnf(c_0_37,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_2 ).

cnf(c_0_38,negated_conjecture,
    ( in(esk4_0,X1)
    | X1 != set_intersection2(X2,esk5_0)
    | ~ in(esk4_0,X2) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    set_intersection2(esk5_0,singleton(esk4_0)) = empty_set,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_41,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_8 ).

cnf(c_0_42,plain,
    X1 != empty_set,
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]),c_0_40]),c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_40,c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 20:59:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.42/2.27  # ENIGMATIC: Solved by autoschedule:
% 7.42/2.27  # No SInE strategy applied
% 7.42/2.27  # Trying AutoSched0 for 150 seconds
% 7.42/2.27  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 7.42/2.27  # and selection function SelectCQIPrecWNTNp.
% 7.42/2.27  #
% 7.42/2.27  # Preprocessing time       : 0.012 s
% 7.42/2.27  
% 7.42/2.27  # Proof found!
% 7.42/2.27  # SZS status Theorem
% 7.42/2.27  # SZS output start CNFRefutation
% See solution above
% 7.42/2.27  # Training examples: 0 positive, 0 negative
% 7.42/2.27  
% 7.42/2.27  # -------------------------------------------------
% 7.42/2.27  # User time                : 0.012 s
% 7.42/2.27  # System time              : 0.007 s
% 7.42/2.27  # Total time               : 0.019 s
% 7.42/2.27  # Maximum resident set size: 7124 pages
% 7.42/2.27  
%------------------------------------------------------------------------------