TSTP Solution File: NUM853+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM853+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:06 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 12 unt; 2 nHn; 19 RR)
% Number of literals : 27 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
~ greater(vd486,vd488),
file('NUM853+2.p',unknown),
[] ).
cnf(4,axiom,
~ greater(u,u),
file('NUM853+2.p',unknown),
[] ).
cnf(13,axiom,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
file('NUM853+2.p',unknown),
[] ).
cnf(16,axiom,
( ~ less(u,v)
| greater(v,u) ),
file('NUM853+2.p',unknown),
[] ).
cnf(17,axiom,
( ~ greater(u,v)
| less(v,u) ),
file('NUM853+2.p',unknown),
[] ).
cnf(19,axiom,
( ~ less(u,v)
| ~ greater(u,v) ),
file('NUM853+2.p',unknown),
[] ).
cnf(23,axiom,
( less(u,v)
| greater(u,v)
| equal(u,v) ),
file('NUM853+2.p',unknown),
[] ).
cnf(32,axiom,
( ~ greater(u,v)
| greater(vmul(u,w),vmul(v,w)) ),
file('NUM853+2.p',unknown),
[] ).
cnf(46,plain,
( less(vd486,vd488)
| equal(vd488,vd486) ),
inference(res,[status(thm),theory(equality)],[23,2]),
[iquote('0:Res:23.1,2.0')] ).
cnf(49,plain,
equal(vd488,vd486),
inference(spt,[spt(split,[position(s1)])],[46]),
[iquote('1:Spt:46.1')] ).
cnf(53,plain,
greater(vmul(vd486,vd487),vmul(vd486,vd487)),
inference(rew,[status(thm),theory(equality)],[49,13]),
[iquote('1:Rew:49.0,13.0')] ).
cnf(54,plain,
$false,
inference(mrr,[status(thm)],[53,4]),
[iquote('1:MRR:53.0,4.0')] ).
cnf(55,plain,
~ equal(vd488,vd486),
inference(spt,[spt(split,[position(sa)])],[54,49]),
[iquote('1:Spt:54.0,46.1,49.0')] ).
cnf(56,plain,
less(vd486,vd488),
inference(spt,[spt(split,[position(s2)])],[46]),
[iquote('1:Spt:54.0,46.0')] ).
cnf(95,plain,
greater(vd488,vd486),
inference(res,[status(thm),theory(equality)],[56,16]),
[iquote('1:Res:56.0,16.0')] ).
cnf(104,plain,
( ~ greater(u,v)
| ~ greater(v,u) ),
inference(res,[status(thm),theory(equality)],[17,19]),
[iquote('0:Res:17.1,19.0')] ).
cnf(1065,plain,
~ greater(vmul(vd488,vd487),vmul(vd486,vd487)),
inference(res,[status(thm),theory(equality)],[13,104]),
[iquote('0:Res:13.0,104.0')] ).
cnf(1084,plain,
~ greater(vd488,vd486),
inference(res,[status(thm),theory(equality)],[32,1065]),
[iquote('0:Res:32.1,1065.0')] ).
cnf(1085,plain,
$false,
inference(mrr,[status(thm)],[1084,95]),
[iquote('1:MRR:1084.0,95.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM853+2 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 18:39:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.55
% 0.20/0.55 SPASS V 3.9
% 0.20/0.55 SPASS beiseite: Proof found.
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 SPASS derived 921 clauses, backtracked 6 clauses, performed 1 splits and kept 509 clauses.
% 0.20/0.55 SPASS allocated 85915 KBytes.
% 0.20/0.55 SPASS spent 0:00:00.19 on the problem.
% 0.20/0.55 0:00:00.04 for the input.
% 0.20/0.55 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.55 0:00:00.01 for inferences.
% 0.20/0.55 0:00:00.00 for the backtracking.
% 0.20/0.55 0:00:00.08 for the reduction.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Here is a proof with depth 3, length 19 :
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 Formulae used in the proof : holds_a40_conseq_a40_307_a41__a44__a32_490_a44__a32_0_a41_ ass_a40_cond_a40_goal_a40_130_a41__a44__a32_0_a41__a44__a32_3_a41_ holds_a40_antec_a40_307_a41__a44__a32_489_a44__a32_0_a41_ ass_a40_cond_a40_147_a44__a32_0_a41__a44__a32_0_a41_ ass_a40_cond_a40_140_a44__a32_0_a41__a44__a32_0_a41_ ass_a40_cond_a40_goal_a40_130_a41__a44__a32_0_a41__a44__a32_2_a41_ ass_a40_cond_a40_goal_a40_130_a41__a44__a32_0_a41__a44__a32_0_a41_ ass_a40_cond_a40_299_a44__a32_0_a41__a44__a32_2_a41_
% 0.20/0.55
%------------------------------------------------------------------------------