↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : REL024+2 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 19:13:18 EDT 2022

% Result   : Theorem 7.59s 2.29s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   47 (  47 unt;   0 nHn;   7 RR)
%            Number of literals    :   47 (  46 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   71 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_7) ).

cnf(i_0_6,plain,
    converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_6) ).

cnf(i_0_3,plain,
    composition(X1,one) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_3) ).

cnf(i_0_5,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_5) ).

cnf(i_0_12,plain,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_12) ).

cnf(i_0_10,plain,
    complement(join(complement(X1),complement(complement(X1)))) = zero,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_10) ).

cnf(i_0_9,plain,
    join(X1,complement(X1)) = top,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_9) ).

cnf(i_0_14,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_14) ).

cnf(i_0_13,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_13) ).

cnf(i_0_4,plain,
    join(converse(X1),converse(X2)) = converse(join(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_4) ).

cnf(i_0_2,plain,
    join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_2) ).

cnf(i_0_11,negated_conjecture,
    join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0)) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cuy4c8k/lgb.p',i_0_11) ).

cnf(c_0_27,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    i_0_7 ).

cnf(c_0_28,plain,
    converse(converse(X1)) = X1,
    i_0_6 ).

cnf(c_0_29,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    composition(X1,one) = X1,
    i_0_3 ).

cnf(c_0_31,plain,
    composition(converse(one),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]) ).

cnf(c_0_32,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    i_0_5 ).

cnf(c_0_33,plain,
    join(X1,X2) = join(X2,X1),
    i_0_12 ).

cnf(c_0_34,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(rw,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_31,c_0_34]) ).

cnf(c_0_37,plain,
    complement(join(complement(X1),complement(complement(X1)))) = zero,
    i_0_10 ).

cnf(c_0_38,plain,
    join(X1,complement(X1)) = top,
    i_0_9 ).

cnf(c_0_39,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]),c_0_36]) ).

cnf(c_0_40,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    i_0_14 ).

cnf(c_0_42,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    i_0_13 ).

cnf(c_0_43,plain,
    join(zero,zero) = zero,
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_41,c_0_33]) ).

cnf(c_0_45,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    join(zero,complement(complement(X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_39]),c_0_40]),c_0_33]) ).

cnf(c_0_47,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_49,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_39,c_0_48]) ).

cnf(c_0_50,plain,
    join(converse(X1),converse(X2)) = converse(join(X1,X2)),
    i_0_4 ).

cnf(c_0_51,plain,
    join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
    i_0_2 ).

cnf(c_0_52,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_42,c_0_49]) ).

cnf(c_0_53,negated_conjecture,
    join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0)) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
    i_0_11 ).

cnf(c_0_54,plain,
    converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
    inference(spm,[status(thm)],[c_0_50,c_0_29]) ).

cnf(c_0_55,plain,
    join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
    inference(spm,[status(thm)],[c_0_51,c_0_27]) ).

cnf(c_0_56,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_33]) ).

cnf(c_0_57,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_52,c_0_33]) ).

cnf(c_0_58,negated_conjecture,
    join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0))))) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
    inference(rw,[status(thm)],[c_0_53,c_0_33]) ).

cnf(c_0_59,plain,
    join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_50]),c_0_27]),c_0_28]),c_0_28]),c_0_28]) ).

cnf(c_0_60,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_61,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : REL024+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n022.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 : Fri Jul  8 14:29:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.59/2.29  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.29  # No SInE strategy applied
% 7.59/2.29  # Trying AutoSched0 for 150 seconds
% 7.59/2.29  # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 7.59/2.29  # and selection function SelectNewComplexAHP.
% 7.59/2.29  #
% 7.59/2.29  # Preprocessing time       : 0.016 s
% 7.59/2.29  # Presaturation interreduction done
% 7.59/2.29  
% 7.59/2.29  # Proof found!
% 7.59/2.29  # SZS status Theorem
% 7.59/2.29  # SZS output start CNFRefutation
% See solution above
% 7.59/2.29  # Training examples: 0 positive, 0 negative
% 7.59/2.29  
% 7.59/2.29  # -------------------------------------------------
% 7.59/2.29  # User time                : 0.067 s
% 7.59/2.29  # System time              : 0.009 s
% 7.59/2.29  # Total time               : 0.076 s
% 7.59/2.29  # Maximum resident set size: 7120 pages
% 7.59/2.29  
%------------------------------------------------------------------------------