TSTP Solution File: NUM322+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM322+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:25:21 EDT 2022
% Result : Theorem 0.46s 0.63s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ sum__dfg(n5,nn5,u),
file('NUM322+1.p',unknown),
[] ).
cnf(16,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('NUM322+1.p',unknown),
[] ).
cnf(25,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('NUM322+1.p',unknown),
[] ).
cnf(393,axiom,
( ~ rdn_translate(u,rdn_neg(v))
| ~ rdn_translate(w,rdn_pos(v))
| sum__dfg(w,u,n0) ),
file('NUM322+1.p',unknown),
[] ).
cnf(409,plain,
( ~ rdn_translate(nn5,rdn_neg(u))
| ~ rdn_translate(n5,rdn_pos(u)) ),
inference(res,[status(thm),theory(equality)],[393,10]),
[iquote('0:Res:393.2,10.0')] ).
cnf(424,plain,
~ rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(res,[status(thm),theory(equality)],[25,409]),
[iquote('0:Res:25.0,409.0')] ).
cnf(425,plain,
$false,
inference(mrr,[status(thm)],[424,16]),
[iquote('0:MRR:424.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM322+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.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 01:18:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/0.63
% 0.46/0.63 SPASS V 3.9
% 0.46/0.63 SPASS beiseite: Proof found.
% 0.46/0.63 % SZS status Theorem
% 0.46/0.63 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.63 SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 416 clauses.
% 0.46/0.63 SPASS allocated 98718 KBytes.
% 0.46/0.63 SPASS spent 0:00:00.28 on the problem.
% 0.46/0.63 0:00:00.04 for the input.
% 0.46/0.63 0:00:00.10 for the FLOTTER CNF translation.
% 0.46/0.63 0:00:00.02 for inferences.
% 0.46/0.63 0:00:00.00 for the backtracking.
% 0.46/0.63 0:00:00.04 for the reduction.
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Here is a proof with depth 2, length 7 :
% 0.46/0.63 % SZS output start Refutation
% See solution above
% 0.46/0.63 Formulae used in the proof : sum_n5_nn5_what rdn5 rdnn5 sum_entry_point_posx_negx
% 0.46/0.63
%------------------------------------------------------------------------------