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

View Problem - Process Solution

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

% Computer : n028.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 16:45:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( exemplifies_property(X1,esk1_3(X1,X2,X3))
    | X2 != X3
    | ~ object(X3)
    | ~ object(X2)
    | ~ property(X1)
    | ~ is_the(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_14) ).

cnf(i_0_4,plain,
    ( object(X1)
    | ~ is_the(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_4) ).

cnf(i_0_5,plain,
    ( property(X1)
    | ~ is_the(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_5) ).

cnf(i_0_12,plain,
    ( esk1_3(X1,X2,X3) = X3
    | X2 != X3
    | ~ object(X3)
    | ~ object(X2)
    | ~ property(X1)
    | ~ is_the(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_12) ).

cnf(i_0_18,negated_conjecture,
    is_the(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_18) ).

cnf(i_0_17,negated_conjecture,
    esk5_0 = esk3_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_17) ).

cnf(i_0_16,negated_conjecture,
    ~ exemplifies_property(esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c22xbfli/lgb.p',i_0_16) ).

cnf(c_0_26,plain,
    ( exemplifies_property(X1,esk1_3(X1,X2,X3))
    | X2 != X3
    | ~ object(X3)
    | ~ object(X2)
    | ~ property(X1)
    | ~ is_the(X2,X1) ),
    i_0_14 ).

cnf(c_0_27,plain,
    ( object(X1)
    | ~ is_the(X1,X2) ),
    i_0_4 ).

cnf(c_0_28,plain,
    ( property(X1)
    | ~ is_the(X2,X1) ),
    i_0_5 ).

cnf(c_0_29,plain,
    ( esk1_3(X1,X2,X3) = X3
    | X2 != X3
    | ~ object(X3)
    | ~ object(X2)
    | ~ property(X1)
    | ~ is_the(X2,X1) ),
    i_0_12 ).

cnf(c_0_30,plain,
    ( exemplifies_property(X1,esk1_3(X1,X2,X2))
    | ~ is_the(X2,X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_27]) ).

cnf(c_0_31,plain,
    ( esk1_3(X1,X2,X2) = X2
    | ~ is_the(X2,X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_27]),c_0_28])]),c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    is_the(esk3_0,esk4_0),
    i_0_18 ).

cnf(c_0_33,negated_conjecture,
    esk5_0 = esk3_0,
    i_0_17 ).

cnf(c_0_34,plain,
    ( exemplifies_property(X1,X2)
    | ~ is_the(X2,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    is_the(esk5_0,esk4_0),
    inference(rw,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ exemplifies_property(esk4_0,esk5_0),
    i_0_16 ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jun  2 01:04:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.43  # ENIGMATIC: Selected complete mode:
% 7.98/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.98/2.35  # No SInE strategy applied
% 7.98/2.35  # Trying AutoSched0 for 150 seconds
% 7.98/2.35  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S035N
% 7.98/2.35  # and selection function PSelectUnlessPosMax.
% 7.98/2.35  #
% 7.98/2.35  # Preprocessing time       : 0.023 s
% 7.98/2.35  # Presaturation interreduction done
% 7.98/2.35  
% 7.98/2.35  # Proof found!
% 7.98/2.35  # SZS status Theorem
% 7.98/2.35  # SZS output start CNFRefutation
% See solution above
% 7.98/2.35  # Training examples: 0 positive, 0 negative
% 7.98/2.35  
% 7.98/2.35  # -------------------------------------------------
% 7.98/2.35  # User time                : 0.022 s
% 7.98/2.35  # System time              : 0.008 s
% 7.98/2.35  # Total time               : 0.030 s
% 7.98/2.35  # Maximum resident set size: 7124 pages
% 7.98/2.35  
%------------------------------------------------------------------------------