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

View Problem - Process Solution

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

% Computer : n024.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 : Thu Jul 21 00:01:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
    ( v_fun2(X1,X2)
    | ~ v_fun1(X1,X3)
    | ~ c_Natural_Oevaln(v_com,X3,hAPP(c_Nat_OSuc,v_n),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_uc61_lk/lgb.p',i_0_8) ).

cnf(i_0_741,plain,
    ( c_Natural_Oevaln(X1,X2,hAPP(c_Nat_OSuc,X3),X4)
    | ~ c_Natural_Oevaln(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_uc61_lk/lgb.p',i_0_741) ).

cnf(i_0_6,negated_conjecture,
    c_Natural_Oevaln(v_com,esk2_0,v_n,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_uc61_lk/lgb.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    ~ v_fun2(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_uc61_lk/lgb.p',i_0_5) ).

cnf(i_0_7,negated_conjecture,
    v_fun1(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_uc61_lk/lgb.p',i_0_7) ).

cnf(c_0_747,negated_conjecture,
    ( v_fun2(X1,X2)
    | ~ v_fun1(X1,X3)
    | ~ c_Natural_Oevaln(v_com,X3,hAPP(c_Nat_OSuc,v_n),X2) ),
    i_0_8 ).

cnf(c_0_748,plain,
    ( c_Natural_Oevaln(X1,X2,hAPP(c_Nat_OSuc,X3),X4)
    | ~ c_Natural_Oevaln(X1,X2,X3,X4) ),
    i_0_741 ).

cnf(c_0_749,plain,
    ( v_fun2(X1,X2)
    | ~ c_Natural_Oevaln(v_com,X3,v_n,X2)
    | ~ v_fun1(X1,X3) ),
    inference(spm,[status(thm)],[c_0_747,c_0_748]) ).

cnf(c_0_750,negated_conjecture,
    c_Natural_Oevaln(v_com,esk2_0,v_n,esk3_0),
    i_0_6 ).

cnf(c_0_751,negated_conjecture,
    ~ v_fun2(esk1_0,esk3_0),
    i_0_5 ).

cnf(c_0_752,negated_conjecture,
    ( v_fun2(X1,esk3_0)
    | ~ v_fun1(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_749,c_0_750]) ).

cnf(c_0_753,negated_conjecture,
    v_fun1(esk1_0,esk2_0),
    i_0_7 ).

cnf(c_0_754,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_751,c_0_752]),c_0_753])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWW297+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n024.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 : Sun Jun  5 02:03:37 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.47  # ENIGMATIC: Selected SinE mode:
% 0.51/0.70  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.70  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.51/0.70  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.51/0.70  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.05/3.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.05/3.47  # No SInE strategy applied
% 10.05/3.47  # Trying AutoSched0 for 150 seconds
% 10.05/3.47  # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 10.05/3.47  # and selection function SelectMaxLComplexAvoidPosPred.
% 10.05/3.47  #
% 10.05/3.47  # Preprocessing time       : 0.012 s
% 10.05/3.47  
% 10.05/3.47  # Proof found!
% 10.05/3.47  # SZS status Theorem
% 10.05/3.47  # SZS output start CNFRefutation
% See solution above
% 10.05/3.47  # Training examples: 0 positive, 0 negative
% 10.05/3.47  
% 10.05/3.47  # -------------------------------------------------
% 10.05/3.47  # User time                : 0.012 s
% 10.05/3.47  # System time              : 0.004 s
% 10.05/3.47  # Total time               : 0.015 s
% 10.05/3.47  # Maximum resident set size: 9528 pages
% 10.05/3.47  
%------------------------------------------------------------------------------