%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM539+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:16 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 31 ( 0 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 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,
aElementOf0(szmzizndt0(xS),xT),
file('NUM539+2.p',unknown),
[] ).
cnf(18,axiom,
aElementOf0(szmzizndt0(xT),xT),
file('NUM539+2.p',unknown),
[] ).
cnf(19,axiom,
aElementOf0(szmzizndt0(xT),xS),
file('NUM539+2.p',unknown),
[] ).
cnf(21,axiom,
~ equal(szmzizndt0(xT),szmzizndt0(xS)),
file('NUM539+2.p',unknown),
[] ).
cnf(31,axiom,
( ~ aElementOf0(u,xT)
| aElementOf0(u,szNzAzT0) ),
file('NUM539+2.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElementOf0(u,xS)
| sdtlseqdt0(szmzizndt0(xS),u) ),
file('NUM539+2.p',unknown),
[] ).
cnf(39,axiom,
( ~ aElementOf0(u,xT)
| sdtlseqdt0(szmzizndt0(xT),u) ),
file('NUM539+2.p',unknown),
[] ).
cnf(78,axiom,
( ~ sdtlseqdt0(u,v)
| ~ sdtlseqdt0(v,u)
| ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| equal(v,u) ),
file('NUM539+2.p',unknown),
[] ).
cnf(137,plain,
( ~ aElementOf0(szmzizndt0(xT),szNzAzT0)
| ~ aElementOf0(szmzizndt0(xS),szNzAzT0)
| ~ sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS))
| ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)) ),
inference(res,[status(thm),theory(equality)],[78,21]),
[iquote('0:Res:78.4,21.0')] ).
cnf(186,plain,
aElementOf0(szmzizndt0(xS),szNzAzT0),
inference(res,[status(thm),theory(equality)],[17,31]),
[iquote('0:Res:17.0,31.0')] ).
cnf(187,plain,
aElementOf0(szmzizndt0(xT),szNzAzT0),
inference(res,[status(thm),theory(equality)],[18,31]),
[iquote('0:Res:18.0,31.0')] ).
cnf(190,plain,
( ~ aElementOf0(szmzizndt0(xT),szNzAzT0)
| ~ sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS))
| ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)) ),
inference(mrr,[status(thm)],[137,186]),
[iquote('0:MRR:137.1,186.0')] ).
cnf(191,plain,
( ~ sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS))
| ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)) ),
inference(mrr,[status(thm)],[190,187]),
[iquote('0:MRR:190.0,187.0')] ).
cnf(395,plain,
( ~ aElementOf0(szmzizndt0(xS),xT)
| ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)) ),
inference(res,[status(thm),theory(equality)],[39,191]),
[iquote('0:Res:39.1,191.0')] ).
cnf(396,plain,
~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)),
inference(mrr,[status(thm)],[395,17]),
[iquote('0:MRR:395.0,17.0')] ).
cnf(397,plain,
~ aElementOf0(szmzizndt0(xT),xS),
inference(res,[status(thm),theory(equality)],[38,396]),
[iquote('0:Res:38.1,396.0')] ).
cnf(398,plain,
$false,
inference(mrr,[status(thm)],[397,19]),
[iquote('0:MRR:397.0,19.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM539+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 15:31:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.52
% 0.19/0.52 SPASS V 3.9
% 0.19/0.52 SPASS beiseite: Proof found.
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 SPASS derived 222 clauses, backtracked 16 clauses, performed 1 splits and kept 229 clauses.
% 0.19/0.52 SPASS allocated 98787 KBytes.
% 0.19/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.19/0.52 0:00:00.04 for the input.
% 0.19/0.52 0:00:00.09 for the FLOTTER CNF translation.
% 0.19/0.52 0:00:00.00 for inferences.
% 0.19/0.52 0:00:00.00 for the backtracking.
% 0.19/0.52 0:00:00.01 for the reduction.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Here is a proof with depth 3, length 17 :
% 0.19/0.52 % SZS output start Refutation
% See solution above
% 0.19/0.52 Formulae used in the proof : m__1802 m__ m__1779 mLessASymm
% 0.19/0.52
%------------------------------------------------------------------------------