↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : PUZ001+1 : TPTP v8.1.0. Released v2.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 : Mon Jul 18 18:07:51 EDT 2022

% Result   : Theorem 5.90s 2.85s
% Output   : CNFRefutation 5.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  16 unt;  10 nHn;  31 RR)
%            Number of literals    :   62 (  21 equ;  23 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( hates(X1,X2)
    | ~ killed(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_7) ).

cnf(i_0_1,plain,
    killed(esk1_0,agatha),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_1) ).

cnf(i_0_6,plain,
    ( X1 = agatha
    | X1 = butler
    | X1 = charles
    | ~ lives(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_6) ).

cnf(i_0_2,plain,
    lives(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_2) ).

cnf(i_0_12,plain,
    ( hates(butler,X1)
    | ~ hates(agatha,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_12) ).

cnf(i_0_10,plain,
    ( X1 = butler
    | hates(agatha,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_10) ).

cnf(i_0_8,plain,
    ( ~ killed(X1,X2)
    | ~ richer(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_8) ).

cnf(i_0_11,plain,
    ( richer(X1,agatha)
    | hates(butler,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_11) ).

cnf(i_0_9,plain,
    ( ~ hates(agatha,X1)
    | ~ hates(charles,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_9) ).

cnf(i_0_13,plain,
    ~ hates(X1,esk2_1(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_13) ).

cnf(i_0_14,plain,
    agatha != butler,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_14) ).

cnf(i_0_15,negated_conjecture,
    ~ killed(agatha,agatha),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmm28qy1/lgb.p',i_0_15) ).

cnf(c_0_28,plain,
    ( hates(X1,X2)
    | ~ killed(X1,X2) ),
    i_0_7 ).

cnf(c_0_29,plain,
    killed(esk1_0,agatha),
    i_0_1 ).

cnf(c_0_30,plain,
    ( X1 = agatha
    | X1 = butler
    | X1 = charles
    | ~ lives(X1) ),
    i_0_6 ).

cnf(c_0_31,plain,
    lives(esk1_0),
    i_0_2 ).

cnf(c_0_32,plain,
    ( hates(butler,X1)
    | ~ hates(agatha,X1) ),
    i_0_12 ).

cnf(c_0_33,plain,
    ( X1 = butler
    | hates(agatha,X1) ),
    i_0_10 ).

cnf(c_0_34,plain,
    ( ~ killed(X1,X2)
    | ~ richer(X1,X2) ),
    i_0_8 ).

cnf(c_0_35,plain,
    ( richer(X1,agatha)
    | hates(butler,X1) ),
    i_0_11 ).

cnf(c_0_36,plain,
    ( ~ hates(agatha,X1)
    | ~ hates(charles,X1) ),
    i_0_9 ).

cnf(c_0_37,plain,
    hates(esk1_0,agatha),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_38,plain,
    ( esk1_0 = agatha
    | esk1_0 = butler
    | esk1_0 = charles ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_39,plain,
    ~ hates(X1,esk2_1(X1)),
    i_0_13 ).

cnf(c_0_40,plain,
    ( X1 = butler
    | hates(butler,X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_41,plain,
    ( hates(butler,X1)
    | ~ killed(X1,agatha) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_42,plain,
    ( X1 = butler
    | ~ hates(charles,X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_33]) ).

cnf(c_0_43,plain,
    ( esk1_0 = butler
    | esk1_0 = agatha
    | hates(charles,agatha) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,plain,
    agatha != butler,
    i_0_14 ).

cnf(c_0_45,plain,
    esk2_1(butler) = butler,
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_46,plain,
    hates(butler,esk1_0),
    inference(spm,[status(thm)],[c_0_41,c_0_29]) ).

cnf(c_0_47,plain,
    ( esk1_0 = agatha
    | esk1_0 = butler ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_48,plain,
    ~ hates(butler,butler),
    inference(spm,[status(thm)],[c_0_39,c_0_45]) ).

cnf(c_0_49,plain,
    esk1_0 = agatha,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).

cnf(c_0_50,negated_conjecture,
    ~ killed(agatha,agatha),
    i_0_15 ).

cnf(c_0_51,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_49]),c_0_50]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n022.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat May 28 22:19:55 EDT 2022
% 0.14/0.29  % CPUTime  : 
% 0.14/0.40  # ENIGMATIC: Selected complete mode:
% 5.90/2.85  # ENIGMATIC: Solved by autoschedule-lgb:
% 5.90/2.85  # No SInE strategy applied
% 5.90/2.85  # Trying AutoSched0 for 150 seconds
% 5.90/2.85  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 5.90/2.85  # and selection function SelectNewComplexAHPNS.
% 5.90/2.85  #
% 5.90/2.85  # Preprocessing time       : 0.022 s
% 5.90/2.85  
% 5.90/2.85  # Proof found!
% 5.90/2.85  # SZS status Theorem
% 5.90/2.85  # SZS output start CNFRefutation
% See solution above
% 5.90/2.85  # Training examples: 0 positive, 0 negative
% 5.90/2.85  
% 5.90/2.85  # -------------------------------------------------
% 5.90/2.85  # User time                : 0.023 s
% 5.90/2.85  # System time              : 0.004 s
% 5.90/2.85  # Total time               : 0.028 s
% 5.90/2.85  # Maximum resident set size: 7124 pages
% 5.90/2.85  
%------------------------------------------------------------------------------