TSTP Solution File: NUM924+5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n017.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 09:46:44 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_97_zero__is__num__zero,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_97_zero__is__num__zero) ).
fof(fact_22_number__of__is__id,axiom,
! [X14] : number_number_of(int,X14) = X14,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(fact_23_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(fact_96_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
fof(fact_3_t,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(fact_62_mult__Pls,axiom,
! [X11] : times_times(int,pls,X11) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(c_0_8,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_9,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,plain,
zero_zero(int) = number_number_of(int,pls),
inference(split_conjunct,[status(thm)],[fact_97_zero__is__num__zero]) ).
fof(c_0_12,plain,
! [X143] : number_number_of(int,X143) = X143,
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_13,plain,
! [X144,X145] : times_times(int,X144,X145) = times_times(int,X145,X144),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_14,plain,
! [X292,X293] : plus_plus(int,X292,X293) = plus_plus(int,X293,X292),
inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).
cnf(c_0_15,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),number_number_of(int,pls)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
cnf(c_0_18,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X223] : times_times(int,pls,X223) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_21,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
cnf(c_0_23,plain,
times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_18]),c_0_19]),c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16]),c_0_18]),c_0_19]),c_0_18]),c_0_23]),c_0_16]),c_0_18]),c_0_19]),c_0_11]),c_0_16]),c_0_18]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.32 % Computer : n017.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jul 6 20:51:44 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.12/0.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35
% 0.12/0.35 # Proof found!
% 0.12/0.35 # SZS status Theorem
% 0.12/0.35 # SZS output start CNFRefutation
% See solution above
% 0.12/0.35 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------