↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : ALG194+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 15:32:52 EDT 2022

% Result   : Theorem 6.91s 2.16s
% Output   : CNFRefutation 6.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   31 (   3 unt;   2 nHn;  31 RR)
%            Number of literals    :   79 (  78 equ;  39 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_561,negated_conjecture,
    ( op(e0,e0) != e0
    | op(e1,e1) != e1
    | op(e2,e2) != e2
    | op(e3,e3) != e3
    | op(e4,e4) != e4
    | op(e5,e5) != e5
    | op(e6,e6) != e6 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_561) ).

cnf(i_0_547,negated_conjecture,
    ( op(e6,e6) = e6
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_547) ).

cnf(i_0_548,negated_conjecture,
    ( op(e5,e5) = e5
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_548) ).

cnf(i_0_549,negated_conjecture,
    ( op(e4,e4) = e4
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_549) ).

cnf(i_0_550,negated_conjecture,
    ( op(e3,e3) = e3
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_550) ).

cnf(i_0_551,negated_conjecture,
    ( op(e2,e2) = e2
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_551) ).

cnf(i_0_553,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) != e1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_553) ).

cnf(i_0_562,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4
    | op(e5,e5) = e5
    | op(e6,e6) = e6 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_562) ).

cnf(i_0_518,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e6,e6) != e6 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_518) ).

cnf(i_0_525,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e5,e5) != e5 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_525) ).

cnf(i_0_532,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e4,e4) != e4 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_532) ).

cnf(i_0_539,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e3,e3) != e3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_539) ).

cnf(i_0_546,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e2,e2) != e2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_546) ).

cnf(i_0_559,negated_conjecture,
    ( op(e1,e1) = e1
    | op(e0,e0) != e0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1w5kv7wn/lgb.p',i_0_559) ).

cnf(c_0_577,negated_conjecture,
    ( op(e0,e0) != e0
    | op(e1,e1) != e1
    | op(e2,e2) != e2
    | op(e3,e3) != e3
    | op(e4,e4) != e4
    | op(e5,e5) != e5
    | op(e6,e6) != e6 ),
    i_0_561 ).

cnf(c_0_578,negated_conjecture,
    ( op(e6,e6) = e6
    | op(e1,e1) != e1 ),
    i_0_547 ).

cnf(c_0_579,negated_conjecture,
    ( op(e5,e5) = e5
    | op(e1,e1) != e1 ),
    i_0_548 ).

cnf(c_0_580,negated_conjecture,
    ( op(e4,e4) = e4
    | op(e1,e1) != e1 ),
    i_0_549 ).

cnf(c_0_581,negated_conjecture,
    ( op(e3,e3) = e3
    | op(e1,e1) != e1 ),
    i_0_550 ).

cnf(c_0_582,negated_conjecture,
    ( op(e2,e2) = e2
    | op(e1,e1) != e1 ),
    i_0_551 ).

cnf(c_0_583,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) != e1 ),
    i_0_553 ).

cnf(c_0_584,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4
    | op(e5,e5) = e5
    | op(e6,e6) = e6 ),
    i_0_562 ).

cnf(c_0_585,negated_conjecture,
    op(e1,e1) != e1,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_577,c_0_578]),c_0_579]),c_0_580]),c_0_581]),c_0_582]),c_0_583]) ).

cnf(c_0_586,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e6,e6) != e6 ),
    i_0_518 ).

cnf(c_0_587,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e5,e5) != e5 ),
    i_0_525 ).

cnf(c_0_588,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e4,e4) != e4 ),
    i_0_532 ).

cnf(c_0_589,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e3,e3) != e3 ),
    i_0_539 ).

cnf(c_0_590,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e2,e2) != e2 ),
    i_0_546 ).

cnf(c_0_591,negated_conjecture,
    ( op(e1,e1) = e1
    | op(e0,e0) != e0 ),
    i_0_559 ).

cnf(c_0_592,negated_conjecture,
    op(e0,e0) = e0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_584,c_0_585]),c_0_586]),c_0_587]),c_0_588]),c_0_589]),c_0_590]) ).

cnf(c_0_593,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_591,c_0_592])]),c_0_585]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/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 : Wed Jun  8 03:40:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 6.91/2.16  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.91/2.16  # No SInE strategy applied
% 6.91/2.16  # Trying AutoSched0 for 150 seconds
% 6.91/2.16  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.91/2.16  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.91/2.16  #
% 6.91/2.16  # Preprocessing time       : 0.023 s
% 6.91/2.16  # Presaturation interreduction done
% 6.91/2.16  
% 6.91/2.16  # Proof found!
% 6.91/2.16  # SZS status Theorem
% 6.91/2.16  # SZS output start CNFRefutation
% See solution above
% 6.91/2.16  # Training examples: 0 positive, 0 negative
% 6.91/2.16  
% 6.91/2.16  # -------------------------------------------------
% 6.91/2.16  # User time                : 0.027 s
% 6.91/2.16  # System time              : 0.003 s
% 6.91/2.16  # Total time               : 0.030 s
% 6.91/2.16  # Maximum resident set size: 7120 pages
% 6.91/2.16  
%------------------------------------------------------------------------------