↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n025.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:12:58 EDT 2022

% Result   : Theorem 9.24s 2.60s
% Output   : CNFRefutation 9.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (  19 unt;   0 nHn;   8 RR)
%            Number of literals    :   25 (  24 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn)

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

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

cnf(i_0_11,negated_conjecture,
    ( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
    | join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6icmtjoc/lgb.p',i_0_11) ).

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

cnf(i_0_12,negated_conjecture,
    join(esk1_0,esk2_0) = esk2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6icmtjoc/lgb.p',i_0_12) ).

cnf(i_0_4,plain,
    join(converse(X1),converse(X2)) = converse(join(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6icmtjoc/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-6icmtjoc/lgb.p',i_0_2) ).

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

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

cnf(c_0_23,negated_conjecture,
    ( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
    | join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ),
    i_0_11 ).

cnf(c_0_24,plain,
    join(X1,X2) = join(X2,X1),
    i_0_13 ).

cnf(c_0_25,negated_conjecture,
    join(esk1_0,esk2_0) = esk2_0,
    i_0_12 ).

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

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

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

cnf(c_0_29,negated_conjecture,
    ( join(composition(esk2_0,esk3_0),composition(esk1_0,esk3_0)) != composition(esk2_0,esk3_0)
    | join(composition(esk3_0,esk2_0),composition(esk3_0,esk1_0)) != composition(esk3_0,esk2_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    join(esk2_0,esk1_0) = esk2_0,
    inference(rw,[status(thm)],[c_0_25,c_0_24]) ).

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

cnf(c_0_32,plain,
    join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
    inference(spm,[status(thm)],[c_0_28,c_0_21]) ).

cnf(c_0_33,negated_conjecture,
    join(composition(esk3_0,esk2_0),composition(esk3_0,esk1_0)) != composition(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28]),c_0_30])]) ).

cnf(c_0_34,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_31,c_0_32]),c_0_26]),c_0_21]),c_0_22]),c_0_22]),c_0_22]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : REL009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 12:01:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.24/2.60  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.24/2.60  # No SInE strategy applied
% 9.24/2.60  # Trying AutoSched0 for 150 seconds
% 9.24/2.60  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.24/2.60  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.24/2.60  #
% 9.24/2.60  # Preprocessing time       : 0.023 s
% 9.24/2.60  # Presaturation interreduction done
% 9.24/2.60  
% 9.24/2.60  # Proof found!
% 9.24/2.60  # SZS status Theorem
% 9.24/2.60  # SZS output start CNFRefutation
% See solution above
% 9.24/2.60  # Training examples: 0 positive, 0 negative
% 9.24/2.60  
% 9.24/2.60  # -------------------------------------------------
% 9.24/2.60  # User time                : 0.049 s
% 9.24/2.60  # System time              : 0.011 s
% 9.24/2.60  # Total time               : 0.060 s
% 9.24/2.60  # Maximum resident set size: 7124 pages
% 9.24/2.60  
%------------------------------------------------------------------------------