TSTP Solution File: CSR026+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n005.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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2564,negated_conjecture,
    ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_2564) ).

cnf(i_0_996,plain,
    ( tptpofobject(X1,f_tptpquantityfn_2(n_756))
    | ~ runningshorts(X1)
    | ~ mtvisible(c_tptp_member2701_mt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_996) ).

cnf(i_0_2463,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_2463) ).

cnf(i_0_451,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_451) ).

cnf(i_0_2565,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_2565) ).

cnf(i_0_1054,plain,
    ( runningshorts(c_tptprunningshorts)
    | ~ mtvisible(c_cyclistsmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_1054) ).

cnf(i_0_480,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_480) ).

cnf(i_0_2064,plain,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_2064) ).

cnf(i_0_1223,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v55hutdm/lgb.p',i_0_1223) ).

cnf(c_0_2575,negated_conjecture,
    ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
    i_0_2564 ).

cnf(c_0_2576,plain,
    ( tptpofobject(X1,f_tptpquantityfn_2(n_756))
    | ~ runningshorts(X1)
    | ~ mtvisible(c_tptp_member2701_mt) ),
    i_0_996 ).

cnf(c_0_2577,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2463 ).

cnf(c_0_2578,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    i_0_451 ).

cnf(c_0_2579,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    i_0_2565 ).

cnf(c_0_2580,negated_conjecture,
    ( ~ runningshorts(c_tptprunningshorts)
    | ~ mtvisible(c_tptp_member2701_mt) ),
    inference(spm,[status(thm)],[c_0_2575,c_0_2576]) ).

cnf(c_0_2581,plain,
    ( runningshorts(c_tptprunningshorts)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_1054 ).

cnf(c_0_2582,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    i_0_480 ).

cnf(c_0_2583,plain,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    i_0_2064 ).

cnf(c_0_2584,plain,
    mtvisible(c_tptp_member3993_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2577,c_0_2578]),c_0_2579])]) ).

cnf(c_0_2585,plain,
    ( ~ mtvisible(c_tptp_member2701_mt)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(spm,[status(thm)],[c_0_2580,c_0_2581]) ).

cnf(c_0_2586,plain,
    mtvisible(c_tptp_member2701_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2577,c_0_2582]),c_0_2579])]) ).

cnf(c_0_2587,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    i_0_1223 ).

cnf(c_0_2588,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2577,c_0_2583]),c_0_2584])]) ).

cnf(c_0_2589,plain,
    ~ mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2585,c_0_2586])]) ).

cnf(c_0_2590,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2577,c_0_2587]),c_0_2588])]),c_0_2589]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR026+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n005.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 17:08:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.59  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.94/3.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.94/3.43  # No SInE strategy applied
% 9.94/3.43  # Trying AutoSched0 for 150 seconds
% 9.94/3.43  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.94/3.43  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.94/3.43  #
% 9.94/3.43  # Preprocessing time       : 0.032 s
% 9.94/3.43  # Presaturation interreduction done
% 9.94/3.43  
% 9.94/3.43  # Proof found!
% 9.94/3.43  # SZS status Theorem
% 9.94/3.43  # SZS output start CNFRefutation
% See solution above
% 9.94/3.43  # Training examples: 0 positive, 0 negative
% 9.94/3.43  
% 9.94/3.43  # -------------------------------------------------
% 9.94/3.43  # User time                : 0.069 s
% 9.94/3.43  # System time              : 0.010 s
% 9.94/3.43  # Total time               : 0.079 s
% 9.94/3.43  # Maximum resident set size: 7128 pages
% 9.94/3.43  
%------------------------------------------------------------------------------