↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n011.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 : Fri Jul 15 02:50:04 EDT 2022

% Result   : Theorem 14.78s 4.75s
% Output   : CNFRefutation 14.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  13 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  12   ~;   6   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subclassEvent0321,conjecture,
    p__d__subclass(c__Funding,c__SocialInteraction),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclassEvent0321) ).

fof(predefinitionsA8,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__subclass(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__subclass(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).

fof(mergeA2526,axiom,
    p__d__subclass(c__Funding,c__Giving),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2526) ).

fof(mergeA2519,axiom,
    p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2519) ).

fof(mergeA2523,axiom,
    p__d__subclass(c__Giving,c__ChangeOfPossession),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2523) ).

fof(c_0_5,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(assume_negation,[status(cth)],[subclassEvent0321]) ).

fof(c_0_6,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X1045,X1046,X1047] :
      ( ~ p__d__subclass(X1045,X1046)
      | ~ p__d__subclass(X1046,X1047)
      | p__d__subclass(X1045,X1047) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])]) ).

cnf(c_0_8,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( p__d__subclass(X1,X3)
    | ~ p__d__subclass(X1,X2)
    | ~ p__d__subclass(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p__d__subclass(X1,c__SocialInteraction)
    | ~ p__d__subclass(c__Funding,X1) ),
    inference(pm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,plain,
    p__d__subclass(c__Funding,c__Giving),
    inference(split_conjunct,[status(thm)],[mergeA2526]) ).

cnf(c_0_12,plain,
    p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
    inference(split_conjunct,[status(thm)],[mergeA2519]) ).

cnf(c_0_13,negated_conjecture,
    ~ p__d__subclass(c__Giving,c__SocialInteraction),
    inference(pm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( p__d__subclass(X1,c__SocialInteraction)
    | ~ p__d__subclass(X1,c__ChangeOfPossession) ),
    inference(pm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_15,plain,
    p__d__subclass(c__Giving,c__ChangeOfPossession),
    inference(split_conjunct,[status(thm)],[mergeA2523]) ).

cnf(c_0_16,negated_conjecture,
    ~ p__d__subclass(c__Giving,c__ChangeOfPossession),
    inference(pm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    $false,
    inference(sr,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : CSR256+1 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun 11 05:00:33 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected SinE mode:
% 0.43/0.60  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.60  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.43/0.60  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.43/0.60  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 14.78/4.75  # ENIGMATIC: Solved by autoschedule:
% 14.78/4.75  # No SInE strategy applied
% 14.78/4.75  # Trying AutoSched0 for 149 seconds
% 14.78/4.75  # AutoSched0-Mode selected heuristic G_E___300_C01_S5PRR_S00
% 14.78/4.75  # and selection function NoSelection.
% 14.78/4.75  #
% 14.78/4.75  # Preprocessing time       : 0.511 s
% 14.78/4.75  
% 14.78/4.75  # Proof found!
% 14.78/4.75  # SZS status Theorem
% 14.78/4.75  # SZS output start CNFRefutation
% See solution above
% 14.78/4.75  # Training examples: 0 positive, 0 negative
% 14.78/4.75  
% 14.78/4.75  # -------------------------------------------------
% 14.78/4.75  # User time                : 0.636 s
% 14.78/4.75  # System time              : 0.041 s
% 14.78/4.75  # Total time               : 0.678 s
% 14.78/4.75  # Maximum resident set size: 10812 pages
% 14.78/4.75  
%------------------------------------------------------------------------------