TSTP Solution File: NUM533+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:12 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 11 unt; 1 nHn; 20 RR)
% Number of literals : 39 ( 0 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
aSet0(xA),
file('NUM533+1.p',unknown),
[] ).
cnf(3,axiom,
aSet0(xB),
file('NUM533+1.p',unknown),
[] ).
cnf(4,axiom,
aSet0(xC),
file('NUM533+1.p',unknown),
[] ).
cnf(5,axiom,
aSubsetOf0(xA,xB),
file('NUM533+1.p',unknown),
[] ).
cnf(6,axiom,
aSubsetOf0(xB,xC),
file('NUM533+1.p',unknown),
[] ).
cnf(7,axiom,
~ aSubsetOf0(xA,xC),
file('NUM533+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM533+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| aSubsetOf0(v,u)
| aElementOf0(skf3(v,w),v) ),
file('NUM533+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ aElementOf0(skf3(v,u),u)
| aSubsetOf0(v,u) ),
file('NUM533+1.p',unknown),
[] ).
cnf(23,plain,
( ~ aSet0(xC)
| ~ aElementOf0(u,xB)
| aElementOf0(u,xC) ),
inference(res,[status(thm),theory(equality)],[6,17]),
[iquote('0:Res:6.0,17.1')] ).
cnf(28,plain,
( ~ aSet0(xB)
| ~ aElementOf0(u,xA)
| aElementOf0(u,xB) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.1')] ).
cnf(32,plain,
( ~ aSet0(xA)
| ~ aSet0(xC)
| ~ aElementOf0(skf3(xA,xC),xC) ),
inference(res,[status(thm),theory(equality)],[19,7]),
[iquote('0:Res:19.3,7.0')] ).
cnf(33,plain,
( ~ aSet0(xA)
| ~ aSet0(xC)
| aElementOf0(skf3(xA,u),xA) ),
inference(res,[status(thm),theory(equality)],[18,7]),
[iquote('0:Res:18.3,7.0')] ).
cnf(37,plain,
( ~ aElementOf0(u,xB)
| aElementOf0(u,xC) ),
inference(mrr,[status(thm)],[23,4]),
[iquote('0:MRR:23.0,4.0')] ).
cnf(39,plain,
( ~ aElementOf0(u,xA)
| aElementOf0(u,xB) ),
inference(mrr,[status(thm)],[28,3]),
[iquote('0:MRR:28.0,3.0')] ).
cnf(40,plain,
aElementOf0(skf3(xA,u),xA),
inference(mrr,[status(thm)],[33,2,4]),
[iquote('0:MRR:33.0,33.1,2.0,4.0')] ).
cnf(41,plain,
~ aElementOf0(skf3(xA,xC),xC),
inference(mrr,[status(thm)],[32,2,4]),
[iquote('0:MRR:32.0,32.1,2.0,4.0')] ).
cnf(44,plain,
~ aElementOf0(skf3(xA,xC),xB),
inference(res,[status(thm),theory(equality)],[37,41]),
[iquote('0:Res:37.1,41.0')] ).
cnf(48,plain,
~ aElementOf0(skf3(xA,xC),xA),
inference(res,[status(thm),theory(equality)],[39,44]),
[iquote('0:Res:39.1,44.0')] ).
cnf(49,plain,
$false,
inference(mrr,[status(thm)],[48,40]),
[iquote('0:MRR:48.0,40.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n029.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 15:36:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.19/0.44 SPASS allocated 97685 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 3, length 20 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : m__522 m__ mDefSub
% 0.19/0.44
%------------------------------------------------------------------------------