TSTP Solution File: NUM550+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 18 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
equal(slcrc0,xQ),
file('NUM550+3.p',unknown),
[] ).
cnf(18,axiom,
~ equal(xk,sz00),
file('NUM550+3.p',unknown),
[] ).
cnf(22,axiom,
equal(sbrdtbr0(xQ),xk),
file('NUM550+3.p',unknown),
[] ).
cnf(25,axiom,
( ~ equal(u,slcrc0)
| aSet0(u) ),
file('NUM550+3.p',unknown),
[] ).
cnf(63,axiom,
( ~ aSet0(u)
| ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
file('NUM550+3.p',unknown),
[] ).
cnf(147,plain,
( ~ equal(u,xQ)
| aSet0(u) ),
inference(rew,[status(thm),theory(equality)],[9,25]),
[iquote('0:Rew:9.0,25.0')] ).
cnf(150,plain,
( ~ aSet0(u)
| ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(rew,[status(thm),theory(equality)],[9,63]),
[iquote('0:Rew:9.0,63.1')] ).
cnf(151,plain,
( ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(mrr,[status(thm)],[150,147]),
[iquote('0:MRR:150.0,147.1')] ).
cnf(172,plain,
equal(sbrdtbr0(slcrc0),sz00),
inference(res,[status(thm),theory(equality)],[9,151]),
[iquote('0:Res:9.0,151.0')] ).
cnf(331,plain,
equal(xk,sz00),
inference(rew,[status(thm),theory(equality)],[22,172,9]),
[iquote('0:Rew:22.0,172.0,9.0,172.0')] ).
cnf(332,plain,
$false,
inference(mrr,[status(thm)],[331,18]),
[iquote('0:MRR:331.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.13/0.36 % Computer : n007.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Wed Jul 6 16:50:43 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.60
% 0.21/0.60 SPASS V 3.9
% 0.21/0.60 SPASS beiseite: Proof found.
% 0.21/0.60 % SZS status Theorem
% 0.21/0.60 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.60 SPASS derived 114 clauses, backtracked 0 clauses, performed 0 splits and kept 139 clauses.
% 0.21/0.60 SPASS allocated 99860 KBytes.
% 0.21/0.60 SPASS spent 0:00:00.22 on the problem.
% 0.21/0.60 0:00:00.04 for the input.
% 0.21/0.60 0:00:00.15 for the FLOTTER CNF translation.
% 0.21/0.60 0:00:00.00 for inferences.
% 0.21/0.60 0:00:00.00 for the backtracking.
% 0.21/0.60 0:00:00.01 for the reduction.
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60 Here is a proof with depth 1, length 11 :
% 0.21/0.60 % SZS output start Refutation
% See solution above
% 0.21/0.60 Formulae used in the proof : m__ m__2202_02 m__2291 mDefEmp mCardEmpty
% 0.21/0.60
%------------------------------------------------------------------------------