TSTP Solution File: NUM302+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM302+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:15 EDT 2022
% Result : Theorem 0.48s 0.70s
% Output : Refutation 0.48s
% 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-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ less(nn2,u),
file('NUM302+1.p',unknown),
[] ).
cnf(20,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('NUM302+1.p',unknown),
[] ).
cnf(22,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('NUM302+1.p',unknown),
[] ).
cnf(389,axiom,
( ~ rdn_translate(u,rdn_neg(v))
| ~ rdn_translate(w,rdn_pos(x))
| less(u,w) ),
file('NUM302+1.p',unknown),
[] ).
cnf(409,plain,
( ~ rdn_translate(u,rdn_pos(v))
| ~ rdn_translate(nn2,rdn_neg(w)) ),
inference(res,[status(thm),theory(equality)],[389,10]),
[iquote('0:Res:389.2,10.0')] ).
cnf(431,plain,
~ rdn_translate(nn2,rdn_neg(u)),
inference(res,[status(thm),theory(equality)],[20,409]),
[iquote('0:Res:20.0,409.0')] ).
cnf(531,plain,
$false,
inference(unc,[status(thm)],[431,22]),
[iquote('0:UnC:431.0,22.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM302+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Wed Jul 6 01:48:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.48/0.70
% 0.48/0.70 SPASS V 3.9
% 0.48/0.70 SPASS beiseite: Proof found.
% 0.48/0.70 % SZS status Theorem
% 0.48/0.70 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.70 SPASS derived 122 clauses, backtracked 0 clauses, performed 0 splits and kept 514 clauses.
% 0.48/0.70 SPASS allocated 98720 KBytes.
% 0.48/0.70 SPASS spent 0:00:00.35 on the problem.
% 0.48/0.70 0:00:00.04 for the input.
% 0.48/0.70 0:00:00.11 for the FLOTTER CNF translation.
% 0.48/0.70 0:00:00.03 for inferences.
% 0.48/0.70 0:00:00.00 for the backtracking.
% 0.48/0.70 0:00:00.05 for the reduction.
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70 Here is a proof with depth 2, length 7 :
% 0.48/0.70 % SZS output start Refutation
% See solution above
% 0.48/0.70 Formulae used in the proof : nn2_less_something rdn9 rdnn2 less_entry_point_neg_pos
% 0.48/0.70
%------------------------------------------------------------------------------