TSTP Solution File: NUM549+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM549+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:23 EDT 2022
% Result : Theorem 0.18s 0.54s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 8 unt; 3 nHn; 20 RR)
% Number of literals : 39 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
aSet0(xQ),
file('NUM549+1.p',unknown),
[] ).
cnf(7,axiom,
isFinite0(xQ),
file('NUM549+1.p',unknown),
[] ).
cnf(14,axiom,
~ equal(xk,sz00),
file('NUM549+1.p',unknown),
[] ).
cnf(15,axiom,
equal(sbrdtbr0(xQ),xk),
file('NUM549+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ equal(u,slcrc0)
| aSet0(u) ),
file('NUM549+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ aElement0(u)
| ~ aElementOf0(u,xQ) ),
file('NUM549+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('NUM549+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ aSet0(u)
| equal(u,slcrc0)
| aElementOf0(skf11(u),u) ),
file('NUM549+1.p',unknown),
[] ).
cnf(49,axiom,
( ~ aSet0(u)
| ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
file('NUM549+1.p',unknown),
[] ).
cnf(117,plain,
( ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
inference(mrr,[status(thm)],[49,17]),
[iquote('0:MRR:49.0,17.1')] ).
cnf(132,plain,
( ~ equal(xQ,slcrc0)
| equal(xk,sz00) ),
inference(spr,[status(thm),theory(equality)],[117,15]),
[iquote('0:SpR:117.1,15.0')] ).
cnf(135,plain,
~ equal(xQ,slcrc0),
inference(mrr,[status(thm)],[132,14]),
[iquote('0:MRR:132.1,14.0')] ).
cnf(207,plain,
( ~ aSet0(xQ)
| ~ aElement0(skf11(xQ))
| equal(xQ,slcrc0) ),
inference(res,[status(thm),theory(equality)],[42,22]),
[iquote('0:Res:42.2,22.1')] ).
cnf(209,plain,
( ~ aSet0(u)
| ~ aSet0(u)
| equal(u,slcrc0)
| aElement0(skf11(u)) ),
inference(res,[status(thm),theory(equality)],[42,34]),
[iquote('0:Res:42.2,34.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,135]),
[iquote('0:MRR:212.1,135.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,135]),
[iquote('0:MRR:224.0,135.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM549+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n003.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 20:51:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.54
% 0.18/0.54 SPASS V 3.9
% 0.18/0.54 SPASS beiseite: Proof found.
% 0.18/0.54 % SZS status Theorem
% 0.18/0.54 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54 SPASS derived 77 clauses, backtracked 0 clauses, performed 0 splits and kept 159 clauses.
% 0.18/0.54 SPASS allocated 99342 KBytes.
% 0.18/0.54 SPASS spent 0:00:00.19 on the problem.
% 0.18/0.54 0:00:00.04 for the input.
% 0.18/0.54 0:00:00.11 for the FLOTTER CNF translation.
% 0.18/0.54 0:00:00.00 for inferences.
% 0.18/0.54 0:00:00.00 for the backtracking.
% 0.18/0.54 0:00:00.01 for the reduction.
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 Here is a proof with depth 2, length 20 :
% 0.18/0.54 % SZS output start Refutation
% See solution above
% 0.18/0.54 Formulae used in the proof : m__2291 m__2202_02 mDefEmp m__ mEOfElem mCardEmpty
% 0.18/0.54
%------------------------------------------------------------------------------