TSTP Solution File: NUM840+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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:30:56 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% 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(1,axiom,
~ less(vd328,vd329),
file('NUM840+2.p',unknown),
[] ).
cnf(2,axiom,
~ less(u,u),
file('NUM840+2.p',unknown),
[] ).
cnf(9,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('NUM840+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ less(u,v)
| greater(v,u) ),
file('NUM840+2.p',unknown),
[] ).
cnf(12,axiom,
( ~ greater(u,v)
| less(v,u) ),
file('NUM840+2.p',unknown),
[] ).
cnf(14,axiom,
( ~ less(u,v)
| ~ greater(u,v) ),
file('NUM840+2.p',unknown),
[] ).
cnf(15,axiom,
( less(u,v)
| greater(u,v)
| equal(u,v) ),
file('NUM840+2.p',unknown),
[] ).
cnf(22,axiom,
( ~ less(u,v)
| less(vplus(u,w),vplus(v,w)) ),
file('NUM840+2.p',unknown),
[] ).
cnf(32,plain,
( greater(vd328,vd329)
| equal(vd329,vd328) ),
inference(res,[status(thm),theory(equality)],[15,1]),
[iquote('0:Res:15.2,1.0')] ).
cnf(34,plain,
equal(vd329,vd328),
inference(spt,[spt(split,[position(s1)])],[32]),
[iquote('1:Spt:32.1')] ).
cnf(35,plain,
less(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(rew,[status(thm),theory(equality)],[34,9]),
[iquote('1:Rew:34.0,9.0')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[35,2]),
[iquote('1:MRR:35.0,2.0')] ).
cnf(40,plain,
~ equal(vd329,vd328),
inference(spt,[spt(split,[position(sa)])],[39,34]),
[iquote('1:Spt:39.0,32.1,34.0')] ).
cnf(41,plain,
greater(vd328,vd329),
inference(spt,[spt(split,[position(s2)])],[32]),
[iquote('1:Spt:39.0,32.0')] ).
cnf(68,plain,
less(vd329,vd328),
inference(res,[status(thm),theory(equality)],[41,12]),
[iquote('1:Res:41.0,12.0')] ).
cnf(73,plain,
( ~ less(u,v)
| ~ less(v,u) ),
inference(res,[status(thm),theory(equality)],[11,14]),
[iquote('0:Res:11.1,14.1')] ).
cnf(74,plain,
~ less(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(res,[status(thm),theory(equality)],[9,73]),
[iquote('0:Res:9.0,73.0')] ).
cnf(392,plain,
~ less(vd329,vd328),
inference(res,[status(thm),theory(equality)],[22,74]),
[iquote('0:Res:22.1,74.0')] ).
cnf(394,plain,
$false,
inference(mrr,[status(thm)],[392,68]),
[iquote('1:MRR:392.0,68.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 05:56:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49
% 0.19/0.49 SPASS V 3.9
% 0.19/0.49 SPASS beiseite: Proof found.
% 0.19/0.49 % SZS status Theorem
% 0.19/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 SPASS derived 340 clauses, backtracked 7 clauses, performed 1 splits and kept 214 clauses.
% 0.19/0.49 SPASS allocated 85364 KBytes.
% 0.19/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.49 0:00:00.04 for the input.
% 0.19/0.49 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.49 0:00:00.01 for inferences.
% 0.19/0.49 0:00:00.00 for the backtracking.
% 0.19/0.49 0:00:00.03 for the reduction.
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Here is a proof with depth 3, length 19 :
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.49 Formulae used in the proof : holds_a40_conseq_a40_conjunct2_a40_conjunct2_a40_204_a41__a41__a41__a44__a32_336_a44__a32_0_a41_ ass_a40_cond_a40_goal_a40_130_a41__a44__a32_0_a41__a44__a32_1_a41_ holds_a40_antec_a40_conjunct2_a40_conjunct2_a40_204_a41__a41__a41__a44__a32_335_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_goal_a40_193_a41__a44__a32_0_a41__a44__a32_0_a41_
% 0.19/0.49
%------------------------------------------------------------------------------