TSTP Solution File: NUM299+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM299+1 : TPTP v8.1.0. Released v3.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:25:14 EDT 2022
% Result : Theorem 182.05s 182.28s
% Output : Refutation 182.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 25 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
less(nn2,nn4),
file('NUM299+1.p',unknown),
[] ).
cnf(22,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('NUM299+1.p',unknown),
[] ).
cnf(24,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('NUM299+1.p',unknown),
[] ).
cnf(32,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('NUM299+1.p',unknown),
[] ).
cnf(33,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('NUM299+1.p',unknown),
[] ).
cnf(223,axiom,
( ~ less(u,v)
| ~ less(v,u) ),
file('NUM299+1.p',unknown),
[] ).
cnf(394,axiom,
( ~ rdn_positive_less(rdnn(u),rdnn(v))
| ~ rdn_positive_less(rdnn(w),rdnn(u))
| rdn_positive_less(rdnn(w),rdnn(v)) ),
file('NUM299+1.p',unknown),
[] ).
cnf(396,axiom,
( ~ rdn_positive_less(u,v)
| ~ rdn_translate(w,rdn_neg(u))
| ~ rdn_translate(x,rdn_neg(v))
| less(x,w) ),
file('NUM299+1.p',unknown),
[] ).
cnf(408,plain,
~ less(nn4,nn2),
inference(res,[status(thm),theory(equality)],[1,223]),
[iquote('0:Res:1.0,223.0')] ).
cnf(847,plain,
( ~ rdn_positive_less(rdnn(u),rdnn(n3))
| rdn_positive_less(rdnn(u),rdnn(n4)) ),
inference(res,[status(thm),theory(equality)],[33,394]),
[iquote('0:Res:33.0,394.0')] ).
cnf(866,plain,
( ~ rdn_positive_less(rdnn(n2),u)
| ~ rdn_translate(v,rdn_neg(u))
| less(v,nn2) ),
inference(res,[status(thm),theory(equality)],[22,396]),
[iquote('0:Res:22.0,396.1')] ).
cnf(20909,plain,
( ~ rdn_positive_less(rdnn(n2),rdnn(n4))
| less(nn4,nn2) ),
inference(res,[status(thm),theory(equality)],[24,866]),
[iquote('0:Res:24.0,866.1')] ).
cnf(21032,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(mrr,[status(thm)],[20909,408]),
[iquote('0:MRR:20909.1,408.0')] ).
cnf(74450,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(res,[status(thm),theory(equality)],[847,21032]),
[iquote('0:Res:847.1,21032.0')] ).
cnf(74451,plain,
$false,
inference(mrr,[status(thm)],[74450,32]),
[iquote('0:MRR:74450.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM299+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n008.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 : Tue Jul 5 18:22:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 182.05/182.28
% 182.05/182.28 SPASS V 3.9
% 182.05/182.28 SPASS beiseite: Proof found.
% 182.05/182.28 % SZS status Theorem
% 182.05/182.28 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 182.05/182.28 SPASS derived 73364 clauses, backtracked 0 clauses, performed 0 splits and kept 73755 clauses.
% 182.05/182.28 SPASS allocated 145377 KBytes.
% 182.05/182.28 SPASS spent 0:2:56.32 on the problem.
% 182.05/182.28 0:00:00.04 for the input.
% 182.05/182.28 0:00:00.10 for the FLOTTER CNF translation.
% 182.05/182.28 0:00:03.73 for inferences.
% 182.05/182.28 0:00:00.00 for the backtracking.
% 182.05/182.28 0:02:09.00 for the reduction.
% 182.05/182.28
% 182.05/182.28
% 182.05/182.28 Here is a proof with depth 3, length 15 :
% 182.05/182.28 % SZS output start Refutation
% See solution above
% 182.05/182.28 Formulae used in the proof : nn2_not_less_nn4 rdnn2 rdnn4 rdn_positive_less23 rdn_positive_less34 less_property rdn_positive_less_transitivity less_entry_point_neg_neg
% 182.05/182.28
%------------------------------------------------------------------------------