TSTP Solution File: REL008+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : REL008+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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:56 EDT 2022

% Result   : Theorem 10.11s 2.72s
% Output   : CNFRefutation 10.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (  18 unt;   0 nHn;   3 RR)
%            Number of literals    :   18 (  17 equ;   2 neg)
%            Maximal clause size   :    1 (   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   :   35 (   0 sgn)

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

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

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

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

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

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

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

cnf(c_0_20,plain,
    converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    converse(join(X1,converse(X2))) = join(converse(X1),X2),
    inference(spm,[status(thm)],[c_0_19,c_0_18]) ).

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

cnf(c_0_23,plain,
    join(converse(X1),composition(X2,converse(X3))) = converse(join(X1,composition(X3,converse(X2)))),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_25,plain,
    converse(join(composition(X1,X2),composition(X1,converse(X3)))) = converse(composition(X1,join(X2,converse(X3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_24]) ).

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

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

cnf(c_0_28,plain,
    join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
    inference(spm,[status(thm)],[c_0_26,c_0_18]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : REL008+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 13:34:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.11/2.72  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.11/2.72  # No SInE strategy applied
% 10.11/2.72  # Trying AutoSched0 for 150 seconds
% 10.11/2.72  # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 10.11/2.72  # and selection function SelectNewComplexAHP.
% 10.11/2.72  #
% 10.11/2.72  # Preprocessing time       : 0.022 s
% 10.11/2.72  # Presaturation interreduction done
% 10.11/2.72  
% 10.11/2.72  # Proof found!
% 10.11/2.72  # SZS status Theorem
% 10.11/2.72  # SZS output start CNFRefutation
% See solution above
% 10.11/2.72  # Training examples: 0 positive, 0 negative
% 10.11/2.72  
% 10.11/2.72  # -------------------------------------------------
% 10.11/2.72  # User time                : 0.155 s
% 10.11/2.72  # System time              : 0.017 s
% 10.11/2.72  # Total time               : 0.173 s
% 10.11/2.72  # Maximum resident set size: 7128 pages
% 10.11/2.72  
%------------------------------------------------------------------------------