↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n012.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:39 EDT 2022

% Result   : Theorem 7.80s 2.46s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   40 (  18 unt;   2 nHn;  35 RR)
%            Number of literals    :   76 (  19 equ;  43 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   56 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_43) ).

cnf(i_0_127,negated_conjecture,
    one_sorted_str(esk6_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_127) ).

cnf(i_0_125,negated_conjecture,
    subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0)) != esk7_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_125) ).

cnf(i_0_131,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_131) ).

cnf(i_0_122,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_122) ).

cnf(i_0_129,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_129) ).

cnf(i_0_50,plain,
    ( element(subset_difference(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_50) ).

cnf(i_0_56,plain,
    ~ empty(powerset(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_56) ).

cnf(i_0_121,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_121) ).

cnf(i_0_126,negated_conjecture,
    element(esk7_0,powerset(the_carrier(esk6_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_126) ).

cnf(i_0_41,plain,
    set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_41) ).

cnf(i_0_124,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_124) ).

cnf(i_0_120,plain,
    ( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_120) ).

cnf(i_0_123,plain,
    ( subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2
    | ~ one_sorted_str(X1)
    | ~ element(X2,powerset(the_carrier(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kkvxxsqp/lgb.p',i_0_123) ).

cnf(c_0_146,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    i_0_43 ).

cnf(c_0_147,negated_conjecture,
    one_sorted_str(esk6_0),
    i_0_127 ).

cnf(c_0_148,negated_conjecture,
    subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0)) != esk7_0,
    i_0_125 ).

cnf(c_0_149,negated_conjecture,
    cast_as_carrier_subset(esk6_0) = the_carrier(esk6_0),
    inference(spm,[status(thm)],[c_0_146,c_0_147]) ).

cnf(c_0_150,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    i_0_131 ).

cnf(c_0_151,plain,
    subset(X1,X1),
    i_0_122 ).

cnf(c_0_152,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_129 ).

cnf(c_0_153,plain,
    ( element(subset_difference(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_50 ).

cnf(c_0_154,plain,
    ~ empty(powerset(X1)),
    i_0_56 ).

cnf(c_0_155,negated_conjecture,
    subset_difference(the_carrier(esk6_0),the_carrier(esk6_0),subset_difference(the_carrier(esk6_0),the_carrier(esk6_0),esk7_0)) != esk7_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_149]),c_0_149]) ).

cnf(c_0_156,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_121 ).

cnf(c_0_157,negated_conjecture,
    element(esk7_0,powerset(the_carrier(esk6_0))),
    i_0_126 ).

cnf(c_0_158,plain,
    element(X1,powerset(X1)),
    inference(spm,[status(thm)],[c_0_150,c_0_151]) ).

cnf(c_0_159,plain,
    ( in(subset_difference(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_154]) ).

cnf(c_0_160,plain,
    subset_difference(the_carrier(esk6_0),the_carrier(esk6_0),set_difference(the_carrier(esk6_0),esk7_0)) != esk7_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_157]),c_0_158])]) ).

cnf(c_0_161,plain,
    set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
    i_0_41 ).

cnf(c_0_162,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    i_0_124 ).

cnf(c_0_163,plain,
    ( in(set_difference(X1,X2),powerset(X3))
    | ~ element(X2,powerset(X3))
    | ~ element(X1,powerset(X3)) ),
    inference(spm,[status(thm)],[c_0_159,c_0_156]) ).

cnf(c_0_164,plain,
    ( set_difference(esk7_0,set_difference(esk7_0,the_carrier(esk6_0))) != esk7_0
    | ~ element(set_difference(the_carrier(esk6_0),esk7_0),powerset(the_carrier(esk6_0))) ),
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_156]),c_0_158])]),c_0_161]) ).

cnf(c_0_165,plain,
    ( element(set_difference(X1,X2),powerset(X3))
    | ~ element(X2,powerset(X3))
    | ~ element(X1,powerset(X3)) ),
    inference(spm,[status(thm)],[c_0_162,c_0_163]) ).

cnf(c_0_166,plain,
    set_difference(esk7_0,set_difference(esk7_0,the_carrier(esk6_0))) != esk7_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_157]),c_0_158])]) ).

cnf(c_0_167,plain,
    ( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_120 ).

cnf(c_0_168,plain,
    ( subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2
    | ~ one_sorted_str(X1)
    | ~ element(X2,powerset(the_carrier(X1))) ),
    i_0_123 ).

cnf(c_0_169,plain,
    ( subset_intersection2(X1,esk7_0,the_carrier(esk6_0)) != esk7_0
    | ~ element(the_carrier(esk6_0),powerset(X1))
    | ~ element(esk7_0,powerset(X1)) ),
    inference(spm,[status(thm)],[c_0_166,c_0_167]) ).

cnf(c_0_170,plain,
    ( subset_intersection2(the_carrier(esk6_0),X1,the_carrier(esk6_0)) = X1
    | ~ element(X1,powerset(the_carrier(esk6_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_149]),c_0_147])]) ).

cnf(c_0_171,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_158]),c_0_157])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU309+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n012.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.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 20 13:55:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.80/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.46  # No SInE strategy applied
% 7.80/2.46  # Trying AutoSched0 for 150 seconds
% 7.80/2.46  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.80/2.46  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.80/2.46  #
% 7.80/2.46  # Preprocessing time       : 0.027 s
% 7.80/2.46  
% 7.80/2.46  # Proof found!
% 7.80/2.46  # SZS status Theorem
% 7.80/2.46  # SZS output start CNFRefutation
% See solution above
% 7.80/2.46  # Training examples: 0 positive, 0 negative
% 7.80/2.46  
% 7.80/2.46  # -------------------------------------------------
% 7.80/2.46  # User time                : 0.037 s
% 7.80/2.46  # System time              : 0.006 s
% 7.80/2.46  # Total time               : 0.043 s
% 7.80/2.46  # Maximum resident set size: 7128 pages
% 7.80/2.46  
%------------------------------------------------------------------------------