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

View Problem - Process Solution

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

% Computer : n020.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:05 EDT 2022

% Result   : Theorem 7.48s 2.49s
% Output   : CNFRefutation 7.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  10 unt;   9 nHn;  29 RR)
%            Number of literals    :   78 (   0 equ;  45 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   31 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
    ( exemplifies_property(existence,X1)
    | exemplifies_relation(greater_than,esk6_1(X1),X1)
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_21) ).

cnf(i_0_8,plain,
    ( object(X1)
    | ~ is_the(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_8) ).

cnf(i_0_20,plain,
    ( exemplifies_property(existence,X1)
    | exemplifies_property(conceivable,esk6_1(X1))
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_20) ).

cnf(i_0_22,plain,
    ( object(esk6_1(X1))
    | exemplifies_property(existence,X1)
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_22) ).

cnf(i_0_24,negated_conjecture,
    ~ exemplifies_property(existence,god),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_24) ).

cnf(i_0_23,plain,
    is_the(god,none_greater),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_23) ).

cnf(i_0_7,plain,
    ( exemplifies_property(X1,X2)
    | ~ property(X1)
    | ~ object(X2)
    | ~ object(X3)
    | ~ is_the(X2,X1)
    | ~ is_the(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_7) ).

cnf(i_0_9,plain,
    ( property(X1)
    | ~ is_the(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_9) ).

cnf(i_0_13,plain,
    ( ~ object(X1)
    | ~ object(X2)
    | ~ exemplifies_property(none_greater,X1)
    | ~ exemplifies_property(conceivable,X2)
    | ~ exemplifies_relation(greater_than,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd8dkjnh/input.p',i_0_13) ).

cnf(c_0_34,plain,
    ( exemplifies_property(existence,X1)
    | exemplifies_relation(greater_than,esk6_1(X1),X1)
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    i_0_21 ).

cnf(c_0_35,plain,
    ( object(X1)
    | ~ is_the(X1,X2) ),
    i_0_8 ).

cnf(c_0_36,plain,
    ( exemplifies_property(existence,X1)
    | exemplifies_property(conceivable,esk6_1(X1))
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    i_0_20 ).

cnf(c_0_37,plain,
    ( object(esk6_1(X1))
    | exemplifies_property(existence,X1)
    | ~ object(X1)
    | ~ is_the(X1,none_greater) ),
    i_0_22 ).

cnf(c_0_38,negated_conjecture,
    ~ exemplifies_property(existence,god),
    i_0_24 ).

cnf(c_0_39,plain,
    ( exemplifies_relation(greater_than,esk6_1(X1),X1)
    | exemplifies_property(existence,X1)
    | ~ is_the(X1,none_greater) ),
    inference(csr,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,plain,
    is_the(god,none_greater),
    i_0_23 ).

cnf(c_0_41,plain,
    ( exemplifies_property(conceivable,esk6_1(X1))
    | exemplifies_property(existence,X1)
    | ~ is_the(X1,none_greater) ),
    inference(csr,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_42,plain,
    ( exemplifies_property(existence,X1)
    | object(esk6_1(X1))
    | ~ is_the(X1,none_greater) ),
    inference(csr,[status(thm)],[c_0_37,c_0_35]) ).

cnf(c_0_43,plain,
    ( exemplifies_property(X1,X2)
    | ~ property(X1)
    | ~ object(X2)
    | ~ object(X3)
    | ~ is_the(X2,X1)
    | ~ is_the(X3,X1) ),
    i_0_7 ).

cnf(c_0_44,plain,
    ( property(X1)
    | ~ is_the(X2,X1) ),
    i_0_9 ).

cnf(c_0_45,plain,
    ( ~ object(X1)
    | ~ object(X2)
    | ~ exemplifies_property(none_greater,X1)
    | ~ exemplifies_property(conceivable,X2)
    | ~ exemplifies_relation(greater_than,X2,X1) ),
    i_0_13 ).

cnf(c_0_46,negated_conjecture,
    exemplifies_relation(greater_than,esk6_1(god),god),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).

cnf(c_0_47,negated_conjecture,
    exemplifies_property(conceivable,esk6_1(god)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_40])]) ).

cnf(c_0_48,negated_conjecture,
    object(esk6_1(god)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_42]),c_0_40])]) ).

cnf(c_0_49,plain,
    object(god),
    inference(spm,[status(thm)],[c_0_35,c_0_40]) ).

cnf(c_0_50,plain,
    ( exemplifies_property(X1,X2)
    | ~ is_the(X3,X1)
    | ~ is_the(X2,X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_43,c_0_35]),c_0_35]),c_0_44]) ).

cnf(c_0_51,plain,
    ~ exemplifies_property(none_greater,god),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_49])]) ).

cnf(c_0_52,plain,
    ( exemplifies_property(none_greater,X1)
    | ~ is_the(X1,none_greater) ),
    inference(spm,[status(thm)],[c_0_50,c_0_40]) ).

cnf(c_0_53,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_40])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : PHI013+1 : TPTP v8.1.0. Released v7.2.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun  2 01:03:25 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.48/2.49  # ENIGMATIC: Solved by autoschedule:
% 7.48/2.49  # No SInE strategy applied
% 7.48/2.49  # Trying AutoSched0 for 150 seconds
% 7.48/2.49  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 7.48/2.49  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.48/2.49  #
% 7.48/2.49  # Preprocessing time       : 0.021 s
% 7.48/2.49  # Presaturation interreduction done
% 7.48/2.49  
% 7.48/2.49  # Proof found!
% 7.48/2.49  # SZS status Theorem
% 7.48/2.49  # SZS output start CNFRefutation
% See solution above
% 7.48/2.49  # Training examples: 0 positive, 0 negative
% 7.48/2.49  
% 7.48/2.49  # -------------------------------------------------
% 7.48/2.49  # User time                : 0.025 s
% 7.48/2.49  # System time              : 0.003 s
% 7.48/2.49  # Total time               : 0.028 s
% 7.48/2.49  # Maximum resident set size: 7116 pages
% 7.48/2.49  
%------------------------------------------------------------------------------