TSTP Solution File: SEU132+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU132+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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 : Tue Jul 19 14:34:11 EDT 2022
% Result : Theorem 138.71s 138.91s
% Output : Refutation 138.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 5 unt; 10 nHn; 25 RR)
% Number of literals : 57 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(skc5,skc6),
file('SEU132+1.p',unknown),
[] ).
cnf(10,axiom,
~ subset(set_difference(skc5,skc7),set_difference(skc6,skc7)),
file('SEU132+1.p',unknown),
[] ).
cnf(12,axiom,
( subset(u,v)
| in(skf2(v,u),u) ),
file('SEU132+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ in(skf2(u,v),u)
| subset(w,u) ),
file('SEU132+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU132+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ in(u,v)
| ~ equal(v,set_difference(w,x))
| in(u,w) ),
file('SEU132+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ in(u,v)
| ~ in(u,w)
| ~ equal(v,set_difference(x,w)) ),
file('SEU132+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ in(u,v)
| ~ equal(w,set_difference(v,x))
| in(u,w)
| in(u,x) ),
file('SEU132+1.p',unknown),
[] ).
cnf(22,plain,
( ~ in(u,skc5)
| in(u,skc6) ),
inference(res,[status(thm),theory(equality)],[3,15]),
[iquote('0:Res:3.0,15.0')] ).
cnf(40,plain,
( ~ in(skf2(skc6,u),skc5)
| subset(v,skc6) ),
inference(res,[status(thm),theory(equality)],[22,13]),
[iquote('0:Res:22.1,13.0')] ).
cnf(44,plain,
( ~ subset(u,v)
| subset(u,w)
| in(skf2(w,u),v) ),
inference(res,[status(thm),theory(equality)],[12,15]),
[iquote('0:Res:12.1,15.0')] ).
cnf(46,plain,
( ~ in(u,set_difference(v,w))
| in(u,v) ),
inference(eqr,[status(thm),theory(equality)],[16]),
[iquote('0:EqR:16.1')] ).
cnf(51,plain,
( subset(set_difference(u,v),w)
| in(skf2(w,set_difference(u,v)),u) ),
inference(res,[status(thm),theory(equality)],[12,46]),
[iquote('0:Res:12.1,46.0')] ).
cnf(56,plain,
( ~ in(u,set_difference(v,w))
| ~ in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[17]),
[iquote('0:EqR:17.2')] ).
cnf(65,plain,
( ~ in(u,v)
| in(u,set_difference(v,w))
| in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[18]),
[iquote('0:EqR:18.1')] ).
cnf(99,plain,
( ~ in(skf2(u,set_difference(v,w)),w)
| subset(set_difference(v,w),u) ),
inference(res,[status(thm),theory(equality)],[12,56]),
[iquote('0:Res:12.1,56.0')] ).
cnf(328,plain,
( ~ in(skf2(set_difference(u,v),w),u)
| in(skf2(set_difference(u,v),w),v)
| subset(x,set_difference(u,v)) ),
inference(res,[status(thm),theory(equality)],[65,13]),
[iquote('0:Res:65.1,13.0')] ).
cnf(727,plain,
( subset(set_difference(skc5,u),skc6)
| subset(v,skc6) ),
inference(res,[status(thm),theory(equality)],[51,40]),
[iquote('0:Res:51.1,40.0')] ).
cnf(731,plain,
subset(set_difference(skc5,u),skc6),
inference(con,[status(thm)],[727]),
[iquote('0:Con:727.1')] ).
cnf(4460,plain,
( ~ subset(u,v)
| subset(u,set_difference(v,w))
| in(skf2(set_difference(v,w),u),w)
| subset(x,set_difference(v,w)) ),
inference(res,[status(thm),theory(equality)],[44,328]),
[iquote('0:Res:44.2,328.0')] ).
cnf(4465,plain,
( ~ subset(u,v)
| subset(u,set_difference(v,w))
| in(skf2(set_difference(v,w),u),w) ),
inference(con,[status(thm)],[4460]),
[iquote('0:Con:4460.3')] ).
cnf(22521,plain,
( ~ subset(set_difference(u,v),w)
| subset(set_difference(u,v),set_difference(w,v))
| subset(set_difference(u,v),set_difference(w,v)) ),
inference(res,[status(thm),theory(equality)],[4465,99]),
[iquote('0:Res:4465.2,99.0')] ).
cnf(22556,plain,
( ~ subset(set_difference(u,v),w)
| subset(set_difference(u,v),set_difference(w,v)) ),
inference(obv,[status(thm),theory(equality)],[22521]),
[iquote('0:Obv:22521.1')] ).
cnf(143392,plain,
~ subset(set_difference(skc5,skc7),skc6),
inference(res,[status(thm),theory(equality)],[22556,10]),
[iquote('0:Res:22556.1,10.0')] ).
cnf(143447,plain,
$false,
inference(mrr,[status(thm)],[143392,731]),
[iquote('0:MRR:143392.0,731.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU132+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 23:02:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 138.71/138.91
% 138.71/138.91 SPASS V 3.9
% 138.71/138.91 SPASS beiseite: Proof found.
% 138.71/138.91 % SZS status Theorem
% 138.71/138.91 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 138.71/138.91 SPASS derived 100490 clauses, backtracked 0 clauses, performed 0 splits and kept 13197 clauses.
% 138.71/138.91 SPASS allocated 177014 KBytes.
% 138.71/138.91 SPASS spent 0:02:08.13 on the problem.
% 138.71/138.91 0:00:00.04 for the input.
% 138.71/138.91 0:00:00.04 for the FLOTTER CNF translation.
% 138.71/138.91 0:00:01.10 for inferences.
% 138.71/138.91 0:00:00.00 for the backtracking.
% 138.71/138.91 0:02:06.44 for the reduction.
% 138.71/138.91
% 138.71/138.91
% 138.71/138.91 Here is a proof with depth 5, length 25 :
% 138.71/138.91 % SZS output start Refutation
% See solution above
% 138.71/138.91 Formulae used in the proof : t33_xboole_1 d3_tarski d4_xboole_0
% 138.71/138.91
%------------------------------------------------------------------------------