TSTP Solution File: NUM925+4 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n006.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 08:41:13 EDT 2022

% Result   : Theorem 10.15s 3.60s
% Output   : CNFRefutation 10.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   34 (  28 unt;   2 nHn;  25 RR)
%            Number of literals    :   46 (  34 equ;  14 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  14 con; 0-2 aty)
%            Number of variables   :   22 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3701,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit1,pls)) = one_one_nat,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_3701) ).

cnf(i_0_440,plain,
    zero_zero_int = pls,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_440) ).

cnf(i_0_2096,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit1,pls)) = hAPP_nat_nat(suc,zero_zero_nat),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_2096) ).

cnf(i_0_1,negated_conjecture,
    hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) = zero_zero_int,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_1) ).

cnf(i_0_2116,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls))) = hAPP_nat_nat(suc,hAPP_nat_nat(suc,zero_zero_nat)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_2116) ).

cnf(i_0_723,plain,
    hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1),X1) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_723) ).

cnf(i_0_3587,plain,
    ( X1 = zero_zero_nat
    | hAPP_nat_int(semiri1621563631at_int,X1) != zero_zero_int ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_3587) ).

cnf(i_0_2082,plain,
    hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,X1)) = hAPP_nat_int(semiri1621563631at_int,hAPP_nat_nat(suc,X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_2082) ).

cnf(i_0_1911,plain,
    hAPP_nat_nat(suc,X1) != zero_zero_nat,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_1911) ).

cnf(i_0_121,plain,
    ( X1 = zero_zero_int
    | X2 = zero_zero_int
    | hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X2),X1) != zero_zero_int
    | ~ is_int(X1)
    | ~ is_int(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_121) ).

cnf(i_0_3825,hypothesis,
    ( is_int(hAPP_int_int(X1,X2))
    | ~ is_int(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_3825) ).

cnf(i_0_3826,hypothesis,
    is_int(hAPP_nat_int(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8m699x2j/lgb.p',i_0_3826) ).

cnf(c_0_3839,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit1,pls)) = one_one_nat,
    i_0_3701 ).

cnf(c_0_3840,plain,
    zero_zero_int = pls,
    i_0_440 ).

cnf(c_0_3841,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit1,pls)) = hAPP_nat_nat(suc,zero_zero_nat),
    i_0_2096 ).

cnf(c_0_3842,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit1,zero_zero_int)) = one_one_nat,
    inference(rw,[status(thm)],[c_0_3839,c_0_3840]) ).

cnf(c_0_3843,negated_conjecture,
    hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) = zero_zero_int,
    i_0_1 ).

cnf(c_0_3844,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls))) = hAPP_nat_nat(suc,hAPP_nat_nat(suc,zero_zero_nat)),
    i_0_2116 ).

cnf(c_0_3845,plain,
    hAPP_nat_nat(suc,zero_zero_nat) = one_one_nat,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3841,c_0_3840]),c_0_3842]) ).

cnf(c_0_3846,negated_conjecture,
    hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,zero_zero_int)))) = zero_zero_int,
    inference(rw,[status(thm)],[c_0_3843,c_0_3840]) ).

cnf(c_0_3847,plain,
    hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,zero_zero_int))) = hAPP_nat_nat(suc,one_one_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3844,c_0_3840]),c_0_3845]) ).

cnf(c_0_3848,plain,
    hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1),X1) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
    i_0_723 ).

cnf(c_0_3849,negated_conjecture,
    hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_nat_nat(suc,one_one_nat)) = zero_zero_int,
    inference(rw,[status(thm)],[c_0_3846,c_0_3847]) ).

cnf(c_0_3850,plain,
    hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1),X1) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1),hAPP_nat_nat(suc,one_one_nat)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3848,c_0_3840]),c_0_3847]) ).

cnf(c_0_3851,plain,
    ( X1 = zero_zero_nat
    | hAPP_nat_int(semiri1621563631at_int,X1) != zero_zero_int ),
    i_0_3587 ).

cnf(c_0_3852,plain,
    hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,X1)) = hAPP_nat_int(semiri1621563631at_int,hAPP_nat_nat(suc,X1)),
    i_0_2082 ).

cnf(c_0_3853,plain,
    hAPP_nat_nat(suc,X1) != zero_zero_nat,
    i_0_1911 ).

cnf(c_0_3854,plain,
    ( X1 = zero_zero_int
    | X2 = zero_zero_int
    | hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X2),X1) != zero_zero_int
    | ~ is_int(X1)
    | ~ is_int(X2) ),
    i_0_121 ).

cnf(c_0_3855,negated_conjecture,
    hAPP_int_int(hAPP_int_fun_int_int(times_times_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))) = zero_zero_int,
    inference(rw,[status(thm)],[c_0_3849,c_0_3850]) ).

cnf(c_0_3856,plain,
    hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,X1)) != zero_zero_int,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3851,c_0_3852]),c_0_3853]) ).

cnf(c_0_3857,negated_conjecture,
    ~ is_int(hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3854,c_0_3855]),c_0_3856]) ).

cnf(c_0_3858,hypothesis,
    ( is_int(hAPP_int_int(X1,X2))
    | ~ is_int(X2) ),
    i_0_3825 ).

cnf(c_0_3859,hypothesis,
    is_int(hAPP_nat_int(X1,X2)),
    i_0_3826 ).

cnf(c_0_3860,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3857,c_0_3858]),c_0_3859])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM925+4 : TPTP v8.1.0. Released v5.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jul  7 13:14:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.48  # ENIGMATIC: Selected SinE mode:
% 0.47/0.70  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.70  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.47/0.70  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.47/0.70  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.15/3.60  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.15/3.60  # No SInE strategy applied
% 10.15/3.60  # Trying AutoSched0 for 150 seconds
% 10.15/3.60  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.15/3.60  # and selection function SelectComplexExceptUniqMaxHorn.
% 10.15/3.60  #
% 10.15/3.60  # Preprocessing time       : 0.032 s
% 10.15/3.60  # Presaturation interreduction done
% 10.15/3.60  
% 10.15/3.60  # Proof found!
% 10.15/3.60  # SZS status Theorem
% 10.15/3.60  # SZS output start CNFRefutation
% See solution above
% 10.15/3.60  # Training examples: 0 positive, 0 negative
% 10.15/3.60  
% 10.15/3.60  # -------------------------------------------------
% 10.15/3.60  # User time                : 0.070 s
% 10.15/3.60  # System time              : 0.009 s
% 10.15/3.60  # Total time               : 0.079 s
% 10.15/3.60  # Maximum resident set size: 9488 pages
% 10.15/3.60  
%------------------------------------------------------------------------------