↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n012.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 21 04:51:58 EDT 2022

% Result   : Theorem 6.81s 2.33s
% Output   : CNFRefutation 6.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   4 unt;   9 nHn;  23 RR)
%            Number of literals    :   58 (   0 equ;  29 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    4 (   3 usr;   4 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_25,negated_conjecture,
    ( p1
    | p2
    | ~ p3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_25) ).

cnf(i_0_9,negated_conjecture,
    ( p1
    | p2
    | p3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_9) ).

cnf(i_0_7,negated_conjecture,
    ( p2
    | ~ p1
    | ~ p3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_7) ).

cnf(i_0_32,negated_conjecture,
    ( ~ p1
    | ~ p2
    | ~ p3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_32) ).

cnf(i_0_2,negated_conjecture,
    ( p1
    | ~ p2
    | ~ p3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_2) ).

cnf(i_0_23,negated_conjecture,
    ( p2
    | p3
    | ~ p1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_23) ).

cnf(i_0_16,negated_conjecture,
    ( p3
    | ~ p1
    | ~ p2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_16) ).

cnf(i_0_18,negated_conjecture,
    ( p1
    | p3
    | ~ p2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5m0hx69a/lgb.p',i_0_18) ).

cnf(c_0_41,negated_conjecture,
    ( p1
    | p2
    | ~ p3 ),
    i_0_25 ).

cnf(c_0_42,negated_conjecture,
    ( p1
    | p2
    | p3 ),
    i_0_9 ).

cnf(c_0_43,negated_conjecture,
    ( p2
    | ~ p1
    | ~ p3 ),
    i_0_7 ).

cnf(c_0_44,negated_conjecture,
    ( ~ p1
    | ~ p2
    | ~ p3 ),
    i_0_32 ).

cnf(c_0_45,negated_conjecture,
    ( p1
    | ~ p2
    | ~ p3 ),
    i_0_2 ).

cnf(c_0_46,negated_conjecture,
    ( p2
    | p1 ),
    inference(csr,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ p3
    | ~ p1 ),
    inference(csr,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ( p2
    | p3
    | ~ p1 ),
    i_0_23 ).

cnf(c_0_49,negated_conjecture,
    ~ p3,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    ( p3
    | ~ p1
    | ~ p2 ),
    i_0_16 ).

cnf(c_0_51,negated_conjecture,
    ( p1
    | p3
    | ~ p2 ),
    i_0_18 ).

cnf(c_0_52,negated_conjecture,
    p2,
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_48,c_0_49]),c_0_46]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ p2
    | ~ p1 ),
    inference(csr,[status(thm)],[c_0_50,c_0_47]) ).

cnf(c_0_54,negated_conjecture,
    p1,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),c_0_49]) ).

cnf(c_0_55,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_52])]),c_0_54])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN393+1.003 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 21:35:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 6.81/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.81/2.33  # No SInE strategy applied
% 6.81/2.33  # Trying AutoSched0 for 150 seconds
% 6.81/2.33  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.81/2.33  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.81/2.33  #
% 6.81/2.33  # Preprocessing time       : 0.023 s
% 6.81/2.33  
% 6.81/2.33  # Proof found!
% 6.81/2.33  # SZS status Theorem
% 6.81/2.33  # SZS output start CNFRefutation
% See solution above
% 6.81/2.33  # Training examples: 0 positive, 0 negative
% 6.81/2.33  
% 6.81/2.33  # -------------------------------------------------
% 6.81/2.33  # User time                : 0.024 s
% 6.81/2.33  # System time              : 0.008 s
% 6.81/2.33  # Total time               : 0.032 s
% 6.81/2.33  # Maximum resident set size: 7120 pages
% 6.81/2.33  
%------------------------------------------------------------------------------