TSTP Solution File: NUM549+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM549+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:24 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 27 ( 13 unt; 3 nHn; 27 RR)
% Number of literals : 46 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
aSet0(xS),
file('NUM549+3.p',unknown),
[] ).
cnf(7,axiom,
aSet0(xQ),
file('NUM549+3.p',unknown),
[] ).
cnf(8,axiom,
isFinite0(xQ),
file('NUM549+3.p',unknown),
[] ).
cnf(16,axiom,
~ equal(xk,sz00),
file('NUM549+3.p',unknown),
[] ).
cnf(17,axiom,
aSet0(slbdtsldtrb0(xS,xk)),
file('NUM549+3.p',unknown),
[] ).
cnf(20,axiom,
equal(sbrdtbr0(xQ),xk),
file('NUM549+3.p',unknown),
[] ).
cnf(22,axiom,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('NUM549+3.p',unknown),
[] ).
cnf(23,axiom,
( ~ equal(u,slcrc0)
| aSet0(u) ),
file('NUM549+3.p',unknown),
[] ).
cnf(28,axiom,
( ~ aElement0(u)
| ~ aElementOf0(u,xQ) ),
file('NUM549+3.p',unknown),
[] ).
cnf(35,axiom,
( ~ aElementOf0(u,xQ)
| aElementOf0(u,xS) ),
file('NUM549+3.p',unknown),
[] ).
cnf(43,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('NUM549+3.p',unknown),
[] ).
cnf(53,axiom,
( ~ aSet0(u)
| equal(u,slcrc0)
| aElementOf0(skf14(u),u) ),
file('NUM549+3.p',unknown),
[] ).
cnf(62,axiom,
( ~ aSet0(u)
| ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
file('NUM549+3.p',unknown),
[] ).
cnf(141,plain,
( ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
inference(mrr,[status(thm)],[62,23]),
[iquote('0:MRR:62.0,23.1')] ).
cnf(156,plain,
( ~ equal(xQ,slcrc0)
| equal(xk,sz00) ),
inference(spr,[status(thm),theory(equality)],[141,20]),
[iquote('0:SpR:141.1,20.0')] ).
cnf(159,plain,
~ equal(xQ,slcrc0),
inference(mrr,[status(thm)],[156,16]),
[iquote('0:MRR:156.1,16.0')] ).
cnf(198,plain,
( ~ aSet0(slbdtsldtrb0(xS,xk))
| aElement0(xQ) ),
inference(res,[status(thm),theory(equality)],[22,43]),
[iquote('0:Res:22.0,43.1')] ).
cnf(203,plain,
aElement0(xQ),
inference(ssi,[status(thm)],[198,17]),
[iquote('0:SSi:198.0,17.0')] ).
cnf(253,plain,
( ~ aSet0(xQ)
| equal(xQ,slcrc0)
| aElementOf0(skf14(xQ),xS) ),
inference(res,[status(thm),theory(equality)],[53,35]),
[iquote('0:Res:53.2,35.0')] ).
cnf(254,plain,
( ~ aSet0(xQ)
| ~ aElement0(skf14(xQ))
| equal(xQ,slcrc0) ),
inference(res,[status(thm),theory(equality)],[53,28]),
[iquote('0:Res:53.2,28.1')] ).
cnf(265,plain,
( equal(xQ,slcrc0)
| aElementOf0(skf14(xQ),xS) ),
inference(ssi,[status(thm)],[253,8,7,203]),
[iquote('0:SSi:253.0,8.0,7.0,203.0')] ).
cnf(266,plain,
aElementOf0(skf14(xQ),xS),
inference(mrr,[status(thm)],[265,159]),
[iquote('0:MRR:265.0,159.0')] ).
cnf(267,plain,
( ~ aElement0(skf14(xQ))
| equal(xQ,slcrc0) ),
inference(ssi,[status(thm)],[254,8,7,203]),
[iquote('0:SSi:254.0,8.0,7.0,203.0')] ).
cnf(268,plain,
~ aElement0(skf14(xQ)),
inference(mrr,[status(thm)],[267,159]),
[iquote('0:MRR:267.1,159.0')] ).
cnf(284,plain,
( ~ aSet0(xS)
| aElement0(skf14(xQ)) ),
inference(res,[status(thm),theory(equality)],[266,43]),
[iquote('0:Res:266.0,43.1')] ).
cnf(285,plain,
aElement0(skf14(xQ)),
inference(ssi,[status(thm)],[284,4]),
[iquote('0:SSi:284.0,4.0')] ).
cnf(286,plain,
$false,
inference(mrr,[status(thm)],[285,268]),
[iquote('0:MRR:285.0,268.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUM549+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jul 6 00:10:03 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.58
% 0.20/0.58 SPASS V 3.9
% 0.20/0.58 SPASS beiseite: Proof found.
% 0.20/0.58 % SZS status Theorem
% 0.20/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.58 SPASS derived 98 clauses, backtracked 0 clauses, performed 0 splits and kept 190 clauses.
% 0.20/0.58 SPASS allocated 99835 KBytes.
% 0.20/0.58 SPASS spent 0:00:00.21 on the problem.
% 0.20/0.58 0:00:00.04 for the input.
% 0.20/0.58 0:00:00.13 for the FLOTTER CNF translation.
% 0.20/0.58 0:00:00.00 for inferences.
% 0.20/0.58 0:00:00.00 for the backtracking.
% 0.20/0.58 0:00:00.01 for the reduction.
% 0.20/0.58
% 0.20/0.58
% 0.20/0.58 Here is a proof with depth 2, length 27 :
% 0.20/0.58 % SZS output start Refutation
% See solution above
% 0.20/0.58 Formulae used in the proof : m__2202_02 m__2291 m__2227 m__2270 mDefEmp m__ mEOfElem mCardEmpty
% 0.20/0.58
%------------------------------------------------------------------------------