TSTP Solution File: NUM551+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM551+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:27:25 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 6 unt; 3 nHn; 14 RR)
% Number of literals : 28 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
aSet0(xQ),
file('NUM551+1.p',unknown),
[] ).
cnf(7,axiom,
isFinite0(xQ),
file('NUM551+1.p',unknown),
[] ).
cnf(16,axiom,
~ equal(xQ,slcrc0),
file('NUM551+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ aElement0(u)
| ~ aElementOf0(u,xQ) ),
file('NUM551+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('NUM551+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ aSet0(u)
| equal(u,slcrc0)
| aElementOf0(skf11(u),u) ),
file('NUM551+1.p',unknown),
[] ).
cnf(207,plain,
( ~ aSet0(xQ)
| ~ aElement0(skf11(xQ))
| equal(xQ,slcrc0) ),
inference(res,[status(thm),theory(equality)],[43,23]),
[iquote('0:Res:43.2,23.1')] ).
cnf(209,plain,
( ~ aSet0(u)
| ~ aSet0(u)
| equal(u,slcrc0)
| aElement0(skf11(u)) ),
inference(res,[status(thm),theory(equality)],[43,35]),
[iquote('0:Res:43.2,35.1')] ).
cnf(212,plain,
( ~ aElement0(skf11(xQ))
| equal(xQ,slcrc0) ),
inference(ssi,[status(thm)],[207,7,6]),
[iquote('0:SSi:207.0,7.0,6.0')] ).
cnf(213,plain,
~ aElement0(skf11(xQ)),
inference(mrr,[status(thm)],[212,16]),
[iquote('0:MRR:212.1,16.0')] ).
cnf(216,plain,
( ~ aSet0(u)
| equal(u,slcrc0)
| aElement0(skf11(u)) ),
inference(obv,[status(thm),theory(equality)],[209]),
[iquote('0:Obv:209.0')] ).
cnf(223,plain,
( ~ aSet0(xQ)
| equal(xQ,slcrc0) ),
inference(sor,[status(thm)],[213,216]),
[iquote('0:SoR:213.0,216.2')] ).
cnf(224,plain,
equal(xQ,slcrc0),
inference(ssi,[status(thm)],[223,7,6]),
[iquote('0:SSi:223.0,7.0,6.0')] ).
cnf(225,plain,
$false,
inference(mrr,[status(thm)],[224,16]),
[iquote('0:MRR:224.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM551+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.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 08:48:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54
% 0.19/0.54 SPASS V 3.9
% 0.19/0.54 SPASS beiseite: Proof found.
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 SPASS derived 77 clauses, backtracked 0 clauses, performed 0 splits and kept 159 clauses.
% 0.19/0.54 SPASS allocated 99344 KBytes.
% 0.19/0.54 SPASS spent 0:00:00.19 on the problem.
% 0.19/0.54 0:00:00.04 for the input.
% 0.19/0.54 0:00:00.11 for the FLOTTER CNF translation.
% 0.19/0.54 0:00:00.00 for inferences.
% 0.19/0.54 0:00:00.00 for the backtracking.
% 0.19/0.54 0:00:00.01 for the reduction.
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Here is a proof with depth 2, length 14 :
% 0.19/0.54 % SZS output start Refutation
% See solution above
% 0.19/0.54 Formulae used in the proof : m__2291 m__2313 m__ mEOfElem mDefEmp
% 0.19/0.54
%------------------------------------------------------------------------------