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

View Problem - Process Solution

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

% Computer : n010.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:46:40 EDT 2022

% Result   : Theorem 6.97s 2.29s
% Output   : CNFRefutation 6.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (  10 unt;   0 nHn;  18 RR)
%            Number of literals    :   28 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   14 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_49) ).

cnf(i_0_11,plain,
    genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_11) ).

cnf(i_0_59,negated_conjecture,
    mtvisible(c_tptp_member3393_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_59) ).

cnf(i_0_12,plain,
    ( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
    | ~ mtvisible(c_tptp_spindleheadmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_12) ).

cnf(i_0_9,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_7_389(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_9) ).

cnf(i_0_7,plain,
    ( tptptypes_5_387(X1,X2)
    | ~ tptptypes_6_388(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_7) ).

cnf(i_0_58,negated_conjecture,
    ~ tptptypes_5_387(X1,c_pushingwithopenhand),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p',i_0_58) ).

cnf(c_0_67,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_49 ).

cnf(c_0_68,plain,
    genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
    i_0_11 ).

cnf(c_0_69,negated_conjecture,
    mtvisible(c_tptp_member3393_mt),
    i_0_59 ).

cnf(c_0_70,plain,
    ( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
    | ~ mtvisible(c_tptp_spindleheadmt) ),
    i_0_12 ).

cnf(c_0_71,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).

cnf(c_0_72,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_7_389(X2,X1) ),
    i_0_9 ).

cnf(c_0_73,plain,
    tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).

cnf(c_0_74,plain,
    ( tptptypes_5_387(X1,X2)
    | ~ tptptypes_6_388(X1,X2) ),
    i_0_7 ).

cnf(c_0_75,plain,
    tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_76,negated_conjecture,
    ~ tptptypes_5_387(X1,c_pushingwithopenhand),
    i_0_58 ).

cnf(c_0_77,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR030+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 11 15:55:12 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 6.97/2.29  # ENIGMATIC: Solved by autoschedule:
% 6.97/2.29  # No SInE strategy applied
% 6.97/2.29  # Trying AutoSched0 for 150 seconds
% 6.97/2.29  # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 6.97/2.29  # and selection function SelectNewComplexAHP.
% 6.97/2.29  #
% 6.97/2.29  # Preprocessing time       : 0.024 s
% 6.97/2.29  
% 6.97/2.29  # Proof found!
% 6.97/2.29  # SZS status Theorem
% 6.97/2.29  # SZS output start CNFRefutation
% See solution above
% 6.97/2.29  # Training examples: 0 positive, 0 negative
% 6.97/2.29  
% 6.97/2.29  # -------------------------------------------------
% 6.97/2.29  # User time                : 0.027 s
% 6.97/2.29  # System time              : 0.005 s
% 6.97/2.29  # Total time               : 0.032 s
% 6.97/2.29  # Maximum resident set size: 7124 pages
% 6.97/2.29  
% 6.97/2.30  eprover: Cannot stat file /export/starexec/sandbox/tmp/enigma-theBenchmark.p-igtf15zt/input.p
% 6.97/2.30  eprover: No such file or directory
%------------------------------------------------------------------------------