%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:11 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 4 unt; 1 nHn; 10 RR)
% Number of literals : 22 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
aSet0(xA),
file('NUM532+1.p',unknown),
[] ).
cnf(3,axiom,
~ aSubsetOf0(xA,xA),
file('NUM532+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| aSubsetOf0(v,u)
| aElementOf0(skf3(v,w),v) ),
file('NUM532+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ aElementOf0(skf3(v,u),u)
| aSubsetOf0(v,u) ),
file('NUM532+1.p',unknown),
[] ).
cnf(15,plain,
( ~ aSet0(xA)
| ~ aSet0(xA)
| ~ aElementOf0(skf3(xA,xA),xA) ),
inference(res,[status(thm),theory(equality)],[14,3]),
[iquote('0:Res:14.3,3.0')] ).
cnf(16,plain,
( ~ aSet0(xA)
| ~ aSet0(xA)
| aElementOf0(skf3(xA,u),xA) ),
inference(res,[status(thm),theory(equality)],[13,3]),
[iquote('0:Res:13.3,3.0')] ).
cnf(17,plain,
( ~ aSet0(xA)
| aElementOf0(skf3(xA,u),xA) ),
inference(obv,[status(thm),theory(equality)],[16]),
[iquote('0:Obv:16.0')] ).
cnf(18,plain,
aElementOf0(skf3(xA,u),xA),
inference(mrr,[status(thm)],[17,2]),
[iquote('0:MRR:17.0,2.0')] ).
cnf(19,plain,
( ~ aSet0(xA)
| ~ aElementOf0(skf3(xA,xA),xA) ),
inference(obv,[status(thm),theory(equality)],[15]),
[iquote('0:Obv:15.0')] ).
cnf(20,plain,
$false,
inference(mrr,[status(thm)],[19,2,18]),
[iquote('0:MRR:19.0,19.1,2.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.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 : Tue Jul 5 08:28:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.20/0.44 SPASS allocated 97702 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 1, length 10 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : m__467 m__ mDefSub
% 0.20/0.44
%------------------------------------------------------------------------------