%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:28:01 EDT 2022
% Result : Theorem 1.01s 1.22s
% Output : Refutation 1.01s
% 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(17,axiom,
equal(slcrc0,xQ),
file('NUM605+3.p',unknown),
[] ).
cnf(30,axiom,
~ equal(xK,sz00),
file('NUM605+3.p',unknown),
[] ).
cnf(40,axiom,
equal(sbrdtbr0(xQ),xK),
file('NUM605+3.p',unknown),
[] ).
cnf(50,axiom,
( ~ equal(u,slcrc0)
| aSet0(u) ),
file('NUM605+3.p',unknown),
[] ).
cnf(105,axiom,
( ~ aSet0(u)
| ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
file('NUM605+3.p',unknown),
[] ).
cnf(382,plain,
( ~ equal(u,xQ)
| aSet0(u) ),
inference(rew,[status(thm),theory(equality)],[17,50]),
[iquote('0:Rew:17.0,50.0')] ).
cnf(388,plain,
( ~ aSet0(u)
| ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(rew,[status(thm),theory(equality)],[17,105]),
[iquote('0:Rew:17.0,105.1')] ).
cnf(389,plain,
( ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(mrr,[status(thm)],[388,382]),
[iquote('0:MRR:388.0,382.1')] ).
cnf(497,plain,
equal(sbrdtbr0(slcrc0),sz00),
inference(res,[status(thm),theory(equality)],[17,389]),
[iquote('0:Res:17.0,389.0')] ).
cnf(747,plain,
equal(xK,sz00),
inference(rew,[status(thm),theory(equality)],[40,497,17]),
[iquote('0:Rew:40.0,497.0,17.0,497.0')] ).
cnf(748,plain,
$false,
inference(mrr,[status(thm)],[747,30]),
[iquote('0:MRR:747.0,30.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 5 02:33:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.01/1.22
% 1.01/1.22 SPASS V 3.9
% 1.01/1.22 SPASS beiseite: Proof found.
% 1.01/1.22 % SZS status Theorem
% 1.01/1.22 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.01/1.22 SPASS derived 188 clauses, backtracked 0 clauses, performed 0 splits and kept 343 clauses.
% 1.01/1.22 SPASS allocated 105207 KBytes.
% 1.01/1.22 SPASS spent 0:00:00.88 on the problem.
% 1.01/1.22 0:00:00.04 for the input.
% 1.01/1.22 0:00:00.76 for the FLOTTER CNF translation.
% 1.01/1.22 0:00:00.00 for inferences.
% 1.01/1.22 0:00:00.00 for the backtracking.
% 1.01/1.22 0:00:00.04 for the reduction.
% 1.01/1.22
% 1.01/1.22
% 1.01/1.22 Here is a proof with depth 1, length 11 :
% 1.01/1.22 % SZS output start Refutation
% See solution above
% 1.01/1.22 Formulae used in the proof : m__ m__3520 m__5078 mDefEmp mCardEmpty
% 1.01/1.22
%------------------------------------------------------------------------------