TSTP Solution File: NUM924+5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n031.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 : 300s
% DateTime : Tue Aug 22 10:53:07 EDT 2023
% Result : Theorem 4.67s 2.15s
% Output : CNFRefutation 5.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 40
% Syntax : Number of formulae : 54 ( 22 unt; 32 typ; 0 def)
% Number of atoms : 22 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 25 >; 12 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ord_less_eq > ord_less > zprime > twoSqu33214720sum2sq > semiring_1 > semiring > ring_char_0 > ring_11004092258visors > number_semiring > number_ring > number > linordered_ring > linordered_idom > linorder > linord581940658strict > times_times > power_power > plus_plus > ti > number_number_of > #nlpp > zero_zero > undefined > one_one > bit1 > bit0 > t > s > pls > nat > m > int > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(semiring_1,type,
semiring_1: $i > $o ).
tff(m,type,
m: $i ).
tff(ord_less_eq,type,
ord_less_eq: ( $i * $i * $i ) > $o ).
tff(ord_less,type,
ord_less: ( $i * $i * $i ) > $o ).
tff(linord581940658strict,type,
linord581940658strict: $i > $o ).
tff(one_one,type,
one_one: $i > $i ).
tff(number,type,
number: $i > $o ).
tff(t,type,
t: $i ).
tff(pls,type,
pls: $i ).
tff(linordered_ring,type,
linordered_ring: $i > $o ).
tff(ring_11004092258visors,type,
ring_11004092258visors: $i > $o ).
tff(zprime,type,
zprime: $i > $o ).
tff(bit0,type,
bit0: $i > $i ).
tff(plus_plus,type,
plus_plus: ( $i * $i * $i ) > $i ).
tff(s,type,
s: $i ).
tff(number_ring,type,
number_ring: $i > $o ).
tff(power_power,type,
power_power: ( $i * $i * $i ) > $i ).
tff(nat,type,
nat: $i ).
tff(twoSqu33214720sum2sq,type,
twoSqu33214720sum2sq: $i > $o ).
tff(undefined,type,
undefined: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(int,type,
int: $i ).
tff(ti,type,
ti: ( $i * $i ) > $i ).
tff(linordered_idom,type,
linordered_idom: $i > $o ).
tff(bit1,type,
bit1: $i > $i ).
tff(number_number_of,type,
number_number_of: ( $i * $i ) > $i ).
tff(ring_char_0,type,
ring_char_0: $i > $o ).
tff(times_times,type,
times_times: ( $i * $i * $i ) > $i ).
tff(zero_zero,type,
zero_zero: $i > $i ).
tff(number_semiring,type,
number_semiring: $i > $o ).
tff(semiring,type,
semiring: $i > $o ).
tff(linorder,type,
linorder: $i > $o ).
tff(f_285,axiom,
! [K_1] : ( number_number_of(int,K_1) = K_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
tff(f_632,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_97_zero__is__num__zero) ).
tff(f_631,axiom,
! [Z,W] : ( plus_plus(int,Z,W) = plus_plus(int,W,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
tff(f_655,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)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f_287,axiom,
! [Z,W] : ( times_times(int,Z,W) = times_times(int,W,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
tff(f_203,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) ).
tff(f_477,axiom,
! [W] : ( times_times(int,pls,W) = pls ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
tff(f_202,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) ).
tff(c_156,plain,
! [K_1_117] : ( number_number_of(int,K_1_117) = K_1_117 ),
inference(cnfTransformation,[status(thm)],[f_285]) ).
tff(c_397,plain,
number_number_of(int,pls) = zero_zero(int),
inference(cnfTransformation,[status(thm)],[f_632]) ).
tff(c_437,plain,
zero_zero(int) = pls,
inference(demodulation,[status(thm),theory(equality)],[c_156,c_397]) ).
tff(c_395,plain,
! [Z_301,W_302] : ( plus_plus(int,Z_301,W_302) = plus_plus(int,W_302,Z_301) ),
inference(cnfTransformation,[status(thm)],[f_631]) ).
tff(c_433,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(cnfTransformation,[status(thm)],[f_655]) ).
tff(c_434,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),zero_zero(int)),
inference(demodulation,[status(thm),theory(equality)],[c_395,c_433]) ).
tff(c_447,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm),theory(equality)],[c_437,c_434]) ).
tff(c_158,plain,
! [Z_118,W_119] : ( times_times(int,Z_118,W_119) = times_times(int,W_119,Z_118) ),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_106,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_455,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(demodulation,[status(thm),theory(equality)],[c_158,c_158,c_156,c_395,c_395,c_106]) ).
tff(c_282,plain,
! [W_218] : ( times_times(int,pls,W_218) = pls ),
inference(cnfTransformation,[status(thm)],[f_477]) ).
tff(c_104,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(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_457,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_282,c_158,c_158,c_158,c_158,c_156,c_156,c_395,c_395,c_437,c_104]) ).
tff(c_458,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_447,c_457]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% 0.12/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 15:24:14 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.67/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.67/2.15
% 4.67/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.45/2.18
% 5.45/2.18 Inference rules
% 5.45/2.18 ----------------------
% 5.45/2.18 #Ref : 0
% 5.45/2.18 #Sup : 0
% 5.45/2.18 #Fact : 0
% 5.45/2.18 #Define : 0
% 5.45/2.18 #Split : 0
% 5.45/2.18 #Chain : 0
% 5.45/2.18 #Close : 0
% 5.45/2.18
% 5.45/2.18 Ordering : KBO
% 5.45/2.18
% 5.45/2.18 Simplification rules
% 5.45/2.18 ----------------------
% 5.45/2.18 #Subsume : 199
% 5.45/2.18 #Demod : 63
% 5.45/2.18 #Tautology : 15
% 5.45/2.18 #SimpNegUnit : 1
% 5.45/2.18 #BackRed : 0
% 5.45/2.18
% 5.45/2.18 #Partial instantiations: 0
% 5.45/2.18 #Strategies tried : 1
% 5.45/2.18
% 5.45/2.18 Timing (in seconds)
% 5.45/2.18 ----------------------
% 5.45/2.18 Preprocessing : 0.84
% 5.45/2.18 Parsing : 0.42
% 5.45/2.18 CNF conversion : 0.08
% 5.45/2.18 Main loop : 0.30
% 5.45/2.18 Inferencing : 0.00
% 5.45/2.18 Reduction : 0.17
% 5.45/2.18 Demodulation : 0.13
% 5.45/2.18 BG Simplification : 0.06
% 5.45/2.18 Subsumption : 0.09
% 5.45/2.18 Abstraction : 0.02
% 5.45/2.18 MUC search : 0.00
% 5.45/2.18 Cooper : 0.00
% 5.45/2.18 Total : 1.18
% 5.45/2.18 Index Insertion : 0.00
% 5.45/2.18 Index Deletion : 0.00
% 5.45/2.18 Index Matching : 0.00
% 5.45/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------