TSTP Solution File: NUM489+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM489+1 : 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:43 EDT 2022
% Result : Theorem 0.17s 0.41s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 22 ( 0 equ; 16 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aNaturalNumber0(xn),
file('NUM489+1.p',unknown),
[] ).
cnf(5,axiom,
aNaturalNumber0(xp),
file('NUM489+1.p',unknown),
[] ).
cnf(9,axiom,
sdtlseqdt0(xp,xn),
file('NUM489+1.p',unknown),
[] ).
cnf(16,axiom,
equal(sdtmndt0(xn,xp),xr),
file('NUM489+1.p',unknown),
[] ).
cnf(17,axiom,
~ equal(sdtpldt0(xp,xr),xn),
file('NUM489+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| ~ sdtlseqdt0(v,u)
| ~ equal(w,sdtmndt0(u,v))
| equal(sdtpldt0(v,w),u) ),
file('NUM489+1.p',unknown),
[] ).
cnf(86,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ sdtlseqdt0(xp,xn)
| ~ equal(sdtmndt0(xn,xp),xr) ),
inference(res,[status(thm),theory(equality)],[60,17]),
[iquote('0:Res:60.4,17.0')] ).
cnf(106,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ sdtlseqdt0(xp,xn)
| ~ equal(xr,xr) ),
inference(rew,[status(thm),theory(equality)],[16,86]),
[iquote('0:Rew:16.0,86.3')] ).
cnf(107,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ sdtlseqdt0(xp,xn) ),
inference(obv,[status(thm),theory(equality)],[106]),
[iquote('0:Obv:106.3')] ).
cnf(108,plain,
$false,
inference(mrr,[status(thm)],[107,5,3,9]),
[iquote('0:MRR:107.0,107.1,107.2,5.0,3.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM489+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jul 7 15:29:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.41
% 0.17/0.41 SPASS V 3.9
% 0.17/0.41 SPASS beiseite: Proof found.
% 0.17/0.41 % SZS status Theorem
% 0.17/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.41 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 76 clauses.
% 0.17/0.41 SPASS allocated 97887 KBytes.
% 0.17/0.41 SPASS spent 0:00:00.08 on the problem.
% 0.17/0.41 0:00:00.03 for the input.
% 0.17/0.41 0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.41 0:00:00.00 for inferences.
% 0.17/0.41 0:00:00.00 for the backtracking.
% 0.17/0.41 0:00:00.01 for the reduction.
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41 Here is a proof with depth 1, length 10 :
% 0.17/0.41 % SZS output start Refutation
% See solution above
% 0.17/0.41 Formulae used in the proof : m__1837 m__1870 m__1883 m__ mDefDiff
% 0.17/0.41
%------------------------------------------------------------------------------