TSTP Solution File: COM023+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : COM023+1 : 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 : Fri Jul 15 01:07:02 EDT 2022

% Result   : Theorem 7.47s 2.32s
% Output   : CNFRefutation 7.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (   7 unt;  10 nHn;  29 RR)
%            Number of literals    :   98 (   0 equ;  66 neg)
%            Maximal clause size   :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-3 aty)
%            Number of variables   :   35 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( isConfluent0(X1)
    | ~ aElement0(X2)
    | ~ aRewritingSystem0(X1)
    | ~ sdtmndtasgtdt0(esk4_1(X1),X1,X2)
    | ~ sdtmndtasgtdt0(esk5_1(X1),X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_16) ).

cnf(i_0_47,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X2,xR,X3)
    | ~ sdtmndtasgtdt0(X2,xR,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_47) ).

cnf(i_0_44,hypothesis,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_44) ).

cnf(i_0_50,negated_conjecture,
    ~ isConfluent0(xR),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_50) ).

cnf(i_0_49,hypothesis,
    ( aElement0(esk14_3(X1,X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X1,xR,X3)
    | ~ sdtmndtasgtdt0(X1,xR,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_49) ).

cnf(i_0_19,plain,
    ( isConfluent0(X1)
    | aElement0(esk5_1(X1))
    | ~ aRewritingSystem0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_19) ).

cnf(i_0_48,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X2,xR,X3)
    | ~ sdtmndtasgtdt0(X2,xR,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_48) ).

cnf(i_0_18,plain,
    ( isConfluent0(X1)
    | sdtmndtasgtdt0(esk3_1(X1),X1,esk4_1(X1))
    | ~ aRewritingSystem0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_18) ).

cnf(i_0_17,plain,
    ( isConfluent0(X1)
    | sdtmndtasgtdt0(esk3_1(X1),X1,esk5_1(X1))
    | ~ aRewritingSystem0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_17) ).

cnf(i_0_20,plain,
    ( isConfluent0(X1)
    | aElement0(esk4_1(X1))
    | ~ aRewritingSystem0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_20) ).

cnf(i_0_21,plain,
    ( isConfluent0(X1)
    | aElement0(esk3_1(X1))
    | ~ aRewritingSystem0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ej1972xf/input.p',i_0_21) ).

cnf(c_0_62,plain,
    ( isConfluent0(X1)
    | ~ aElement0(X2)
    | ~ aRewritingSystem0(X1)
    | ~ sdtmndtasgtdt0(esk4_1(X1),X1,X2)
    | ~ sdtmndtasgtdt0(esk5_1(X1),X1,X2) ),
    i_0_16 ).

cnf(c_0_63,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X2,xR,X3)
    | ~ sdtmndtasgtdt0(X2,xR,X1) ),
    i_0_47 ).

cnf(c_0_64,hypothesis,
    aRewritingSystem0(xR),
    i_0_44 ).

cnf(c_0_65,negated_conjecture,
    ~ isConfluent0(xR),
    i_0_50 ).

cnf(c_0_66,hypothesis,
    ( aElement0(esk14_3(X1,X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X1,xR,X3)
    | ~ sdtmndtasgtdt0(X1,xR,X2) ),
    i_0_49 ).

cnf(c_0_67,plain,
    ( isConfluent0(X1)
    | aElement0(esk5_1(X1))
    | ~ aRewritingSystem0(X1) ),
    i_0_19 ).

cnf(c_0_68,plain,
    ( ~ sdtmndtasgtdt0(esk5_1(xR),xR,esk14_3(X1,X2,esk4_1(xR)))
    | ~ sdtmndtasgtdt0(X1,xR,esk4_1(xR))
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ aElement0(esk4_1(xR))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),c_0_65]),c_0_66]) ).

cnf(c_0_69,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X2,xR,X3)
    | ~ sdtmndtasgtdt0(X2,xR,X1) ),
    i_0_48 ).

cnf(c_0_70,negated_conjecture,
    aElement0(esk5_1(xR)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_67]),c_0_64])]) ).

cnf(c_0_71,hypothesis,
    ( ~ sdtmndtasgtdt0(X1,xR,esk4_1(xR))
    | ~ sdtmndtasgtdt0(X1,xR,esk5_1(xR))
    | ~ aElement0(esk4_1(xR))
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).

cnf(c_0_72,plain,
    ( isConfluent0(X1)
    | sdtmndtasgtdt0(esk3_1(X1),X1,esk4_1(X1))
    | ~ aRewritingSystem0(X1) ),
    i_0_18 ).

cnf(c_0_73,plain,
    ( ~ sdtmndtasgtdt0(esk3_1(xR),xR,esk5_1(xR))
    | ~ aElement0(esk4_1(xR))
    | ~ aElement0(esk3_1(xR)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_64])]),c_0_65]) ).

cnf(c_0_74,plain,
    ( isConfluent0(X1)
    | sdtmndtasgtdt0(esk3_1(X1),X1,esk5_1(X1))
    | ~ aRewritingSystem0(X1) ),
    i_0_17 ).

cnf(c_0_75,plain,
    ( ~ aElement0(esk4_1(xR))
    | ~ aElement0(esk3_1(xR)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_64])]),c_0_65]) ).

cnf(c_0_76,plain,
    ( isConfluent0(X1)
    | aElement0(esk4_1(X1))
    | ~ aRewritingSystem0(X1) ),
    i_0_20 ).

cnf(c_0_77,plain,
    ~ aElement0(esk3_1(xR)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_64])]),c_0_65]) ).

cnf(c_0_78,plain,
    ( isConfluent0(X1)
    | aElement0(esk3_1(X1))
    | ~ aRewritingSystem0(X1) ),
    i_0_21 ).

cnf(c_0_79,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_64])]),c_0_65]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : COM023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n022.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Thu Jun 16 18:49:19 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected complete mode:
% 7.47/2.32  # ENIGMATIC: Solved by autoschedule:
% 7.47/2.32  # No SInE strategy applied
% 7.47/2.32  # Trying AutoSched0 for 150 seconds
% 7.47/2.32  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 7.47/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.47/2.32  #
% 7.47/2.32  # Preprocessing time       : 0.024 s
% 7.47/2.32  
% 7.47/2.32  # Proof found!
% 7.47/2.32  # SZS status Theorem
% 7.47/2.32  # SZS output start CNFRefutation
% See solution above
% 7.47/2.32  # Training examples: 0 positive, 0 negative
% 7.47/2.32  
% 7.47/2.32  # -------------------------------------------------
% 7.47/2.32  # User time                : 0.030 s
% 7.47/2.32  # System time              : 0.007 s
% 7.47/2.32  # Total time               : 0.036 s
% 7.47/2.32  # Maximum resident set size: 7120 pages
% 7.47/2.32  
%------------------------------------------------------------------------------