TSTP Solution File: SET696+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET696+4 : TPTP v8.1.0. Released v2.2.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 : Tue Jul 19 05:28:09 EDT 2022
% Result : Theorem 65.53s 65.72s
% Output : Refutation 65.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 6 unt; 4 nHn; 16 RR)
% Number of literals : 27 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
~ member(u,empty_set),
file('SET696+4.p',unknown),
[] ).
cnf(7,axiom,
~ equal_set(intersection(difference(skc3,skc2),skc2),empty_set),
file('SET696+4.p',unknown),
[] ).
cnf(8,axiom,
( subset(u,v)
| member(skf3(v,u),u) ),
file('SET696+4.p',unknown),
[] ).
cnf(14,axiom,
( ~ member(u,intersection(v,w))
| member(u,v) ),
file('SET696+4.p',unknown),
[] ).
cnf(15,axiom,
( ~ member(u,intersection(v,w))
| member(u,w) ),
file('SET696+4.p',unknown),
[] ).
cnf(22,axiom,
( ~ member(u,v)
| ~ member(u,difference(w,v)) ),
file('SET696+4.p',unknown),
[] ).
cnf(25,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal_set(v,u) ),
file('SET696+4.p',unknown),
[] ).
cnf(36,plain,
( ~ subset(empty_set,intersection(difference(skc3,skc2),skc2))
| ~ subset(intersection(difference(skc3,skc2),skc2),empty_set) ),
inference(res,[status(thm),theory(equality)],[25,7]),
[iquote('0:Res:25.2,7.0')] ).
cnf(44,plain,
subset(empty_set,u),
inference(res,[status(thm),theory(equality)],[8,2]),
[iquote('0:Res:8.1,2.0')] ).
cnf(47,plain,
~ subset(intersection(difference(skc3,skc2),skc2),empty_set),
inference(mrr,[status(thm)],[36,44]),
[iquote('0:MRR:36.0,44.0')] ).
cnf(65,plain,
( subset(intersection(u,v),w)
| member(skf3(w,intersection(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[8,15]),
[iquote('0:Res:8.1,15.0')] ).
cnf(67,plain,
( subset(intersection(u,v),w)
| member(skf3(w,intersection(u,v)),u) ),
inference(res,[status(thm),theory(equality)],[8,14]),
[iquote('0:Res:8.1,14.0')] ).
cnf(716,plain,
( ~ member(skf3(u,intersection(difference(v,w),x)),w)
| subset(intersection(difference(v,w),x),u) ),
inference(res,[status(thm),theory(equality)],[67,22]),
[iquote('0:Res:67.1,22.1')] ).
cnf(50307,plain,
( subset(intersection(difference(u,v),v),w)
| subset(intersection(difference(u,v),v),w) ),
inference(res,[status(thm),theory(equality)],[65,716]),
[iquote('0:Res:65.1,716.0')] ).
cnf(50395,plain,
subset(intersection(difference(u,v),v),w),
inference(obv,[status(thm),theory(equality)],[50307]),
[iquote('0:Obv:50307.0')] ).
cnf(50396,plain,
$false,
inference(unc,[status(thm)],[50395,47]),
[iquote('0:UnC:50395.0,47.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET696+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 21:03:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 65.53/65.72
% 65.53/65.72 SPASS V 3.9
% 65.53/65.72 SPASS beiseite: Proof found.
% 65.53/65.72 % SZS status Theorem
% 65.53/65.72 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 65.53/65.72 SPASS derived 43721 clauses, backtracked 0 clauses, performed 0 splits and kept 19977 clauses.
% 65.53/65.72 SPASS allocated 125552 KBytes.
% 65.53/65.72 SPASS spent 0:01:03.31 on the problem.
% 65.53/65.72 0:00:00.04 for the input.
% 65.53/65.72 0:00:00.04 for the FLOTTER CNF translation.
% 65.53/65.72 0:00:00.54 for inferences.
% 65.53/65.72 0:00:00.00 for the backtracking.
% 65.53/65.72 0:01:02.08 for the reduction.
% 65.53/65.72
% 65.53/65.72
% 65.53/65.72 Here is a proof with depth 3, length 16 :
% 65.53/65.72 % SZS output start Refutation
% See solution above
% 65.53/65.72 Formulae used in the proof : empty_set thI28 subset intersection difference equal_set
% 65.53/65.72
%------------------------------------------------------------------------------