TSTP Solution File: NUM468+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM468+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:30 EDT 2022
% Result : Theorem 0.74s 1.00s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 22 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aNaturalNumber0(xl),
file('NUM468+2.p',unknown),
[] ).
cnf(11,axiom,
aNaturalNumber0(sdtsldt0(xm,xl)),
file('NUM468+2.p',unknown),
[] ).
cnf(12,axiom,
aNaturalNumber0(sdtsldt0(xn,xl)),
file('NUM468+2.p',unknown),
[] ).
cnf(19,axiom,
equal(sdtasdt0(xl,sdtsldt0(xm,xl)),xm),
file('NUM468+2.p',unknown),
[] ).
cnf(20,axiom,
equal(sdtasdt0(xl,sdtsldt0(xn,xl)),xn),
file('NUM468+2.p',unknown),
[] ).
cnf(35,axiom,
~ equal(sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))),sdtpldt0(xm,xn)),
file('NUM468+2.p',unknown),
[] ).
cnf(56,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| ~ aNaturalNumber0(w)
| equal(sdtasdt0(w,sdtpldt0(v,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u))) ),
file('NUM468+2.p',unknown),
[] ).
cnf(4093,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ aNaturalNumber0(xl)
| ~ equal(sdtpldt0(sdtasdt0(xl,sdtsldt0(xm,xl)),sdtasdt0(xl,sdtsldt0(xn,xl))),sdtpldt0(xm,xn)) ),
inference(spl,[status(thm),theory(equality)],[56,35]),
[iquote('0:SpL:56.3,35.0')] ).
cnf(4094,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ aNaturalNumber0(xl)
| ~ equal(sdtpldt0(xm,xn),sdtpldt0(xm,xn)) ),
inference(rew,[status(thm),theory(equality)],[19,4093,20]),
[iquote('0:Rew:19.0,4093.3,20.0,4093.3')] ).
cnf(4095,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ aNaturalNumber0(xl) ),
inference(obv,[status(thm),theory(equality)],[4094]),
[iquote('0:Obv:4094.3')] ).
cnf(4096,plain,
$false,
inference(ssi,[status(thm)],[4095,3,11,12]),
[iquote('0:SSi:4095.2,4095.1,4095.0,3.0,11.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM468+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n014.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 08:05:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.74/1.00
% 0.74/1.00 SPASS V 3.9
% 0.74/1.00 SPASS beiseite: Proof found.
% 0.74/1.00 % SZS status Theorem
% 0.74/1.00 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.74/1.00 SPASS derived 2498 clauses, backtracked 618 clauses, performed 21 splits and kept 1595 clauses.
% 0.74/1.00 SPASS allocated 100451 KBytes.
% 0.74/1.00 SPASS spent 0:00:00.62 on the problem.
% 0.74/1.00 0:00:00.04 for the input.
% 0.74/1.00 0:00:00.04 for the FLOTTER CNF translation.
% 0.74/1.00 0:00:00.03 for inferences.
% 0.74/1.00 0:00:00.01 for the backtracking.
% 0.74/1.00 0:00:00.46 for the reduction.
% 0.74/1.00
% 0.74/1.00
% 0.74/1.00 Here is a proof with depth 1, length 11 :
% 0.74/1.00 % SZS output start Refutation
% See solution above
% 0.74/1.00 Formulae used in the proof : m__1240 m__ mAMDistr
% 0.74/1.00
%------------------------------------------------------------------------------