TSTP Solution File: SET063+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:23:23 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 6 unt; 2 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ member(u,empty_set),
file('SET063+4.p',unknown),
[] ).
cnf(3,axiom,
~ equal_set(intersection(skc1,empty_set),empty_set),
file('SET063+4.p',unknown),
[] ).
cnf(7,axiom,
( subset(u,v)
| member(skf3(v,u),u) ),
file('SET063+4.p',unknown),
[] ).
cnf(14,axiom,
( ~ member(u,intersection(v,w))
| member(u,w) ),
file('SET063+4.p',unknown),
[] ).
cnf(24,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal_set(v,u) ),
file('SET063+4.p',unknown),
[] ).
cnf(31,plain,
( ~ subset(empty_set,intersection(skc1,empty_set))
| ~ subset(intersection(skc1,empty_set),empty_set) ),
inference(res,[status(thm),theory(equality)],[24,3]),
[iquote('0:Res:24.2,3.0')] ).
cnf(34,plain,
subset(empty_set,u),
inference(res,[status(thm),theory(equality)],[7,1]),
[iquote('0:Res:7.1,1.0')] ).
cnf(37,plain,
~ subset(intersection(skc1,empty_set),empty_set),
inference(mrr,[status(thm)],[31,34]),
[iquote('0:MRR:31.0,34.0')] ).
cnf(54,plain,
( subset(intersection(u,v),w)
| member(skf3(w,intersection(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[7,14]),
[iquote('0:Res:7.1,14.0')] ).
cnf(495,plain,
subset(intersection(u,empty_set),v),
inference(res,[status(thm),theory(equality)],[54,1]),
[iquote('0:Res:54.1,1.0')] ).
cnf(514,plain,
$false,
inference(unc,[status(thm)],[495,37]),
[iquote('0:UnC:495.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n010.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 : Sun Jul 10 09:56:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.50
% 0.21/0.50 SPASS V 3.9
% 0.21/0.50 SPASS beiseite: Proof found.
% 0.21/0.50 % SZS status Theorem
% 0.21/0.50 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 SPASS derived 460 clauses, backtracked 0 clauses, performed 0 splits and kept 345 clauses.
% 0.21/0.50 SPASS allocated 85536 KBytes.
% 0.21/0.50 SPASS spent 0:00:00.14 on the problem.
% 0.21/0.50 0:00:00.03 for the input.
% 0.21/0.50 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.50 0:00:00.01 for inferences.
% 0.21/0.50 0:00:00.00 for the backtracking.
% 0.21/0.50 0:00:00.04 for the reduction.
% 0.21/0.50
% 0.21/0.50
% 0.21/0.50 Here is a proof with depth 2, length 11 :
% 0.21/0.50 % SZS output start Refutation
% See solution above
% 0.21/0.50 Formulae used in the proof : empty_set thI17 subset intersection equal_set
% 0.21/0.50
%------------------------------------------------------------------------------