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

View Problem - Process Solution

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

% Computer : n027.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 20:24:47 EDT 2022

% Result   : Theorem 8.30s 2.39s
% Output   : CNFRefutation 8.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   16 (  14 unt;   0 nHn;  16 RR)
%            Number of literals    :   22 (   7 equ;   9 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_34,negated_conjecture,
    sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_34) ).

cnf(i_0_28,plain,
    ( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
    | ~ aScalar0(X3)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_28) ).

cnf(i_0_29,hypothesis,
    aScalar0(xv),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_29) ).

cnf(i_0_30,hypothesis,
    aScalar0(xu),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_30) ).

cnf(i_0_31,hypothesis,
    aScalar0(xy),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_31) ).

cnf(i_0_33,hypothesis,
    sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_33) ).

cnf(i_0_32,hypothesis,
    aScalar0(xx),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3gxfy4e2/input.p',i_0_32) ).

cnf(c_0_42,negated_conjecture,
    sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    i_0_34 ).

cnf(c_0_43,plain,
    ( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
    | ~ aScalar0(X3)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    i_0_28 ).

cnf(c_0_44,hypothesis,
    aScalar0(xv),
    i_0_29 ).

cnf(c_0_45,hypothesis,
    aScalar0(xu),
    i_0_30 ).

cnf(c_0_46,hypothesis,
    aScalar0(xy),
    i_0_31 ).

cnf(c_0_47,negated_conjecture,
    sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_46])]) ).

cnf(c_0_48,hypothesis,
    sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    i_0_33 ).

cnf(c_0_49,hypothesis,
    aScalar0(xx),
    i_0_32 ).

cnf(c_0_50,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_48]),c_0_44]),c_0_45]),c_0_49])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : RNG045+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n027.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon May 30 08:21:03 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.30/2.39  # ENIGMATIC: Solved by autoschedule:
% 8.30/2.39  # No SInE strategy applied
% 8.30/2.39  # Trying AutoSched0 for 150 seconds
% 8.30/2.39  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.30/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.30/2.39  #
% 8.30/2.39  # Preprocessing time       : 0.014 s
% 8.30/2.39  
% 8.30/2.39  # Proof found!
% 8.30/2.39  # SZS status Theorem
% 8.30/2.39  # SZS output start CNFRefutation
% See solution above
% 8.30/2.39  # Training examples: 0 positive, 0 negative
% 8.30/2.39  
% 8.30/2.39  # -------------------------------------------------
% 8.30/2.39  # User time                : 0.013 s
% 8.30/2.39  # System time              : 0.006 s
% 8.30/2.39  # Total time               : 0.019 s
% 8.30/2.39  # Maximum resident set size: 7124 pages
% 8.30/2.39  
%------------------------------------------------------------------------------