TSTP Solution File: NUM924+5 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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 14:31:39 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 14 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(25,axiom,
equal(number_number_of(int,u),u),
file('NUM924+5.p',unknown),
[] ).
cnf(29,axiom,
equal(times_times(int,pls,u),pls),
file('NUM924+5.p',unknown),
[] ).
cnf(30,axiom,
equal(number_number_of(int,pls),zero_zero(int)),
file('NUM924+5.p',unknown),
[] ).
cnf(45,axiom,
equal(times_times(int,u,v),times_times(int,v,u)),
file('NUM924+5.p',unknown),
[] ).
cnf(52,axiom,
equal(plus_plus(int,u,v),plus_plus(int,v,u)),
file('NUM924+5.p',unknown),
[] ).
cnf(83,axiom,
equal(times_times(int,bit0(u),v),bit0(times_times(int,u,v))),
file('NUM924+5.p',unknown),
[] ).
cnf(142,axiom,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('NUM924+5.p',unknown),
[] ).
cnf(203,axiom,
equal(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))),
file('NUM924+5.p',unknown),
[] ).
cnf(212,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('NUM924+5.p',unknown),
[] ).
cnf(215,plain,
equal(zero_zero(int),pls),
inference(rew,[status(thm),theory(equality)],[25,30]),
[iquote('0:Rew:25.0,30.0')] ).
cnf(230,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(rew,[status(thm),theory(equality)],[52,142,215]),
[iquote('0:Rew:52.0,142.0,215.0,142.0')] ).
cnf(234,plain,
equal(times_times(int,t,plus_plus(int,one_one(int),bit0(bit0(times_times(int,m,bit1(pls)))))),plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls)))))),
inference(rew,[status(thm),theory(equality)],[45,203,52,83,25]),
[iquote('0:Rew:45.0,203.0,52.0,203.0,45.0,203.0,83.0,203.0,83.0,203.0,25.0,203.0,52.0,203.0')] ).
cnf(238,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(rew,[status(thm),theory(equality)],[234,212,45,29,52,83,25,215]),
[iquote('0:Rew:234.0,212.0,45.0,212.0,29.0,212.0,45.0,212.0,52.0,212.0,45.0,212.0,83.0,212.0,83.0,212.0,25.0,212.0,215.0,212.0')] ).
cnf(239,plain,
$false,
inference(mrr,[status(thm)],[238,230]),
[iquote('0:MRR:238.0,230.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 21:29:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49
% 0.20/0.49 SPASS V 3.9
% 0.20/0.49 SPASS beiseite: Proof found.
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 191 clauses.
% 0.20/0.49 SPASS allocated 98300 KBytes.
% 0.20/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.49 0:00:00.04 for the input.
% 0.20/0.49 0:00:00.05 for the FLOTTER CNF translation.
% 0.20/0.49 0:00:00.00 for inferences.
% 0.20/0.49 0:00:00.00 for the backtracking.
% 0.20/0.49 0:00:00.02 for the reduction.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Here is a proof with depth 0, length 14 :
% 0.20/0.49 % SZS output start Refutation
% See solution above
% 0.20/0.49 Formulae used in the proof : fact_22_number__of__is__id fact_62_mult__Pls fact_97_zero__is__num__zero fact_23_zmult__commute fact_96_zadd__commute fact_63_mult__Bit0 conj_0 fact_3_t 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
% 0.20/0.49
%------------------------------------------------------------------------------