TSTP Solution File: NUM455+6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:26:22 EDT 2022
% Result : Theorem 0.48s 0.69s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 11 unt; 1 nHn; 17 RR)
% Number of literals : 24 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(32,axiom,
~ equal(sdtpldt0(sz10,xp),sz10),
file('NUM455+6.p',unknown),
[] ).
cnf(40,axiom,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
file('NUM455+6.p',unknown),
[] ).
cnf(42,axiom,
~ equal(sdtpldt0(sz10,smndt0(xp)),sz10),
file('NUM455+6.p',unknown),
[] ).
cnf(43,axiom,
( ~ aElementOf0(u,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| skP4(u) ),
file('NUM455+6.p',unknown),
[] ).
cnf(57,axiom,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
file('NUM455+6.p',unknown),
[] ).
cnf(77,axiom,
( ~ skP4(u)
| equal(u,sz10)
| equal(u,smndt0(sz10)) ),
file('NUM455+6.p',unknown),
[] ).
cnf(144,axiom,
( ~ equal(sdtpldt0(sz10,xp),smndt0(sz10))
| ~ equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) ),
file('NUM455+6.p',unknown),
[] ).
cnf(265,plain,
skP4(sdtpldt0(sz10,xp)),
inference(res,[status(thm),theory(equality)],[40,43]),
[iquote('0:Res:40.0,43.0')] ).
cnf(266,plain,
skP4(sdtpldt0(sz10,smndt0(xp))),
inference(res,[status(thm),theory(equality)],[57,43]),
[iquote('0:Res:57.0,43.0')] ).
cnf(284,plain,
( ~ skP4(sdtpldt0(sz10,xp))
| equal(sdtpldt0(sz10,xp),smndt0(sz10)) ),
inference(res,[status(thm),theory(equality)],[77,32]),
[iquote('0:Res:77.1,32.0')] ).
cnf(285,plain,
( ~ skP4(sdtpldt0(sz10,smndt0(xp)))
| equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) ),
inference(res,[status(thm),theory(equality)],[77,42]),
[iquote('0:Res:77.1,42.0')] ).
cnf(335,plain,
equal(sdtpldt0(sz10,xp),smndt0(sz10)),
inference(mrr,[status(thm)],[284,265]),
[iquote('0:MRR:284.0,265.0')] ).
cnf(341,plain,
( ~ equal(smndt0(sz10),smndt0(sz10))
| ~ equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) ),
inference(rew,[status(thm),theory(equality)],[335,144]),
[iquote('0:Rew:335.0,144.0')] ).
cnf(344,plain,
equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)),
inference(mrr,[status(thm)],[285,266]),
[iquote('0:MRR:285.0,266.0')] ).
cnf(354,plain,
~ equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)),
inference(obv,[status(thm),theory(equality)],[341]),
[iquote('0:Obv:341.0')] ).
cnf(355,plain,
~ equal(smndt0(sz10),smndt0(sz10)),
inference(rew,[status(thm),theory(equality)],[344,354]),
[iquote('0:Rew:344.0,354.0')] ).
cnf(356,plain,
$false,
inference(obv,[status(thm),theory(equality)],[355]),
[iquote('0:Obv:355.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n029.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 15:00:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.48/0.69
% 0.48/0.69 SPASS V 3.9
% 0.48/0.69 SPASS beiseite: Proof found.
% 0.48/0.69 % SZS status Theorem
% 0.48/0.69 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.69 SPASS derived 86 clauses, backtracked 0 clauses, performed 0 splits and kept 259 clauses.
% 0.48/0.69 SPASS allocated 101014 KBytes.
% 0.48/0.69 SPASS spent 0:00:00.35 on the problem.
% 0.48/0.69 0:00:00.04 for the input.
% 0.48/0.69 0:00:00.25 for the FLOTTER CNF translation.
% 0.48/0.69 0:00:00.00 for inferences.
% 0.48/0.69 0:00:00.00 for the backtracking.
% 0.48/0.69 0:00:00.02 for the reduction.
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69 Here is a proof with depth 1, length 17 :
% 0.48/0.69 % SZS output start Refutation
% See solution above
% 0.48/0.69 Formulae used in the proof : m__2258 m__2232 m__ m__2286
% 0.48/0.69
%------------------------------------------------------------------------------