↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_282,plain,
    ( X1 = zero_zero_int
    | hAPP_nat_int(power_power_int(X1),X2) != zero_zero_int ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-am2_l9w5/lgb.p',i_0_282) ).

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

cnf(i_0_1,negated_conjecture,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int)))) = zero_zero_int,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-am2_l9w5/lgb.p',i_0_1) ).

cnf(i_0_4,plain,
    hAPP_int_int(plus_plus_int(pls),X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-am2_l9w5/lgb.p',i_0_4) ).

cnf(i_0_2,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-am2_l9w5/lgb.p',i_0_2) ).

cnf(i_0_523,plain,
    ( X1 != X2
    | ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1),X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-am2_l9w5/lgb.p',i_0_523) ).

cnf(c_0_530,plain,
    ( X1 = zero_zero_int
    | hAPP_nat_int(power_power_int(X1),X2) != zero_zero_int ),
    i_0_282 ).

cnf(c_0_531,plain,
    zero_zero_int = pls,
    i_0_9 ).

cnf(c_0_532,negated_conjecture,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int)))) = zero_zero_int,
    i_0_1 ).

cnf(c_0_533,plain,
    hAPP_int_int(plus_plus_int(pls),X1) = X1,
    i_0_4 ).

cnf(c_0_534,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    i_0_2 ).

cnf(c_0_535,plain,
    ( X1 = pls
    | hAPP_nat_int(power_power_int(X1),X2) != pls ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_530,c_0_531]),c_0_531]) ).

cnf(c_0_536,negated_conjecture,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(one_one_int),one_one_int))) = pls,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_532,c_0_533]),c_0_533]),c_0_533]),c_0_533]),c_0_531]) ).

cnf(c_0_537,plain,
    ( X1 != X2
    | ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1),X2)) ),
    i_0_523 ).

cnf(c_0_538,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    inference(rw,[status(thm)],[c_0_534,c_0_531]) ).

cnf(c_0_539,negated_conjecture,
    hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)) = pls,
    inference(spm,[status(thm)],[c_0_535,c_0_536]) ).

cnf(c_0_540,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1),X1)),
    inference(er,[status(thm)],[c_0_537]) ).

cnf(c_0_541,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_538,c_0_539]),c_0_540]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM925+2 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 : Wed Jul  6 19:27:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.49  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.84/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.84/2.41  # No SInE strategy applied
% 6.84/2.41  # Trying AutoSched0 for 150 seconds
% 6.84/2.41  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S026I
% 6.84/2.41  # and selection function SelectOptimalRestrNDepth2.
% 6.84/2.41  #
% 6.84/2.41  # Preprocessing time       : 0.023 s
% 6.84/2.41  # Presaturation interreduction done
% 6.84/2.41  
% 6.84/2.41  # Proof found!
% 6.84/2.41  # SZS status Theorem
% 6.84/2.41  # SZS output start CNFRefutation
% See solution above
% 6.84/2.41  # Training examples: 0 positive, 0 negative
% 6.84/2.41  
% 6.84/2.41  # -------------------------------------------------
% 6.84/2.41  # User time                : 0.026 s
% 6.84/2.41  # System time              : 0.007 s
% 6.84/2.41  # Total time               : 0.033 s
% 6.84/2.41  # Maximum resident set size: 7184 pages
% 6.84/2.41  
%------------------------------------------------------------------------------