↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n009.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:40:27 EDT 2022

% Result   : Theorem 9.42s 2.97s
% Output   : CNFRefutation 9.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  16 unt;   2 nHn;  32 RR)
%            Number of literals    :   62 (  15 equ;  34 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :   43 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_81,plain,
    ( X1 = empty_set
    | relation_dom_as_subset(X2,X1,X3) = X2
    | ~ relation_of2_as_subset(X3,X2,X1)
    | ~ quasi_total(X3,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_81) ).

cnf(i_0_1369,negated_conjecture,
    relation_of2_as_subset(esk254_0,esk251_0,esk252_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1369) ).

cnf(i_0_1370,negated_conjecture,
    quasi_total(esk254_0,esk251_0,esk252_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1370) ).

cnf(i_0_1367,negated_conjecture,
    esk252_0 != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1367) ).

cnf(i_0_232,plain,
    ( in(X1,X2)
    | X2 != relation_rng(X3)
    | X1 != apply(X3,X4)
    | ~ function(X3)
    | ~ relation(X3)
    | ~ in(X4,relation_dom(X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_232) ).

cnf(i_0_476,plain,
    ( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
    | ~ relation_of2(X3,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_476) ).

cnf(i_0_1366,negated_conjecture,
    ~ in(apply(esk254_0,esk253_0),relation_rng(esk254_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1366) ).

cnf(i_0_1371,negated_conjecture,
    function(esk254_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1371) ).

cnf(i_0_482,plain,
    ( relation_of2(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_482) ).

cnf(i_0_7,plain,
    ( relation(X1)
    | ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_7) ).

cnf(i_0_320,plain,
    ( element(X1,powerset(cartesian_product2(X2,X3)))
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_320) ).

cnf(i_0_1368,negated_conjecture,
    in(esk253_0,esk251_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4f5dkaph/lgb.p',i_0_1368) ).

cnf(c_0_1384,plain,
    ( X1 = empty_set
    | relation_dom_as_subset(X2,X1,X3) = X2
    | ~ relation_of2_as_subset(X3,X2,X1)
    | ~ quasi_total(X3,X2,X1) ),
    i_0_81 ).

cnf(c_0_1385,negated_conjecture,
    relation_of2_as_subset(esk254_0,esk251_0,esk252_0),
    i_0_1369 ).

cnf(c_0_1386,negated_conjecture,
    quasi_total(esk254_0,esk251_0,esk252_0),
    i_0_1370 ).

cnf(c_0_1387,negated_conjecture,
    esk252_0 != empty_set,
    i_0_1367 ).

cnf(c_0_1388,plain,
    ( in(X1,X2)
    | X2 != relation_rng(X3)
    | X1 != apply(X3,X4)
    | ~ function(X3)
    | ~ relation(X3)
    | ~ in(X4,relation_dom(X3)) ),
    i_0_232 ).

cnf(c_0_1389,plain,
    ( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
    | ~ relation_of2(X3,X1,X2) ),
    i_0_476 ).

cnf(c_0_1390,negated_conjecture,
    relation_dom_as_subset(esk251_0,esk252_0,esk254_0) = esk251_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1384,c_0_1385]),c_0_1386])]),c_0_1387]) ).

cnf(c_0_1391,negated_conjecture,
    ~ in(apply(esk254_0,esk253_0),relation_rng(esk254_0)),
    i_0_1366 ).

cnf(c_0_1392,plain,
    ( in(apply(X1,X2),relation_rng(X1))
    | ~ relation(X1)
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_1388])]) ).

cnf(c_0_1393,negated_conjecture,
    function(esk254_0),
    i_0_1371 ).

cnf(c_0_1394,plain,
    ( relation_dom(esk254_0) = esk251_0
    | ~ relation_of2(esk254_0,esk251_0,esk252_0) ),
    inference(spm,[status(thm)],[c_0_1389,c_0_1390]) ).

cnf(c_0_1395,plain,
    ( relation_of2(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    i_0_482 ).

cnf(c_0_1396,plain,
    ( relation(X1)
    | ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
    i_0_7 ).

cnf(c_0_1397,plain,
    ( element(X1,powerset(cartesian_product2(X2,X3)))
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    i_0_320 ).

cnf(c_0_1398,negated_conjecture,
    ( ~ relation(esk254_0)
    | ~ in(esk253_0,relation_dom(esk254_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1391,c_0_1392]),c_0_1393])]) ).

cnf(c_0_1399,plain,
    relation_dom(esk254_0) = esk251_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1394,c_0_1395]),c_0_1385])]) ).

cnf(c_0_1400,negated_conjecture,
    in(esk253_0,esk251_0),
    i_0_1368 ).

cnf(c_0_1401,plain,
    ( relation(X1)
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_1396,c_0_1397]) ).

cnf(c_0_1402,negated_conjecture,
    ~ relation(esk254_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1398,c_0_1399]),c_0_1400])]) ).

cnf(c_0_1403,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1401,c_0_1385]),c_0_1402]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU290+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n009.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 10:10:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.42/2.97  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.42/2.97  # No SInE strategy applied
% 9.42/2.97  # Trying AutoSched0 for 150 seconds
% 9.42/2.97  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 9.42/2.97  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.42/2.97  #
% 9.42/2.97  # Preprocessing time       : 0.023 s
% 9.42/2.97  # Presaturation interreduction done
% 9.42/2.97  
% 9.42/2.97  # Proof found!
% 9.42/2.97  # SZS status Theorem
% 9.42/2.97  # SZS output start CNFRefutation
% See solution above
% 9.42/2.97  # Training examples: 0 positive, 0 negative
% 9.42/2.97  
% 9.42/2.97  # -------------------------------------------------
% 9.42/2.97  # User time                : 0.103 s
% 9.42/2.97  # System time              : 0.008 s
% 9.42/2.97  # Total time               : 0.112 s
% 9.42/2.97  # Maximum resident set size: 7120 pages
% 9.42/2.97  
%------------------------------------------------------------------------------