TSTP Solution File: SET252-6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET252-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:25:17 EDT 2022
% Result : Unsatisfiable 0.84s 1.06s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 5 unt; 3 nHn; 10 RR)
% Number of literals : 15 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ subclass(restrict(x__dfg,y__dfg,z__dfg),x__dfg),
file('SET252-6.p',unknown),
[] ).
cnf(3,axiom,
( subclass(u,v)
| member(not_subclass_element(u,v),u) ),
file('SET252-6.p',unknown),
[] ).
cnf(4,axiom,
( ~ member(not_subclass_element(u,v),v)
| subclass(u,v) ),
file('SET252-6.p',unknown),
[] ).
cnf(23,axiom,
( ~ member(u,intersection(v,w))
| member(u,w) ),
file('SET252-6.p',unknown),
[] ).
cnf(30,axiom,
equal(intersection(cross_product(u,v),w),restrict(w,u,v)),
file('SET252-6.p',unknown),
[] ).
cnf(161,plain,
( subclass(intersection(u,v),w)
| member(not_subclass_element(intersection(u,v),w),v) ),
inference(res,[status(thm),theory(equality)],[3,23]),
[iquote('0:Res:3.1,23.0')] ).
cnf(4072,plain,
( subclass(intersection(u,v),v)
| subclass(intersection(u,v),v) ),
inference(res,[status(thm),theory(equality)],[161,4]),
[iquote('0:Res:161.1,4.0')] ).
cnf(4074,plain,
subclass(intersection(u,v),v),
inference(obv,[status(thm),theory(equality)],[4072]),
[iquote('0:Obv:4072.0')] ).
cnf(4093,plain,
subclass(restrict(u,v,w),u),
inference(spr,[status(thm),theory(equality)],[30,4074]),
[iquote('0:SpR:30.0,4074.0')] ).
cnf(4216,plain,
$false,
inference(unc,[status(thm)],[4093,1]),
[iquote('0:UnC:4093.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET252-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 : Sat Jul 9 19:46:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.84/1.06
% 0.84/1.06 SPASS V 3.9
% 0.84/1.06 SPASS beiseite: Proof found.
% 0.84/1.06 % SZS status Theorem
% 0.84/1.06 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.06 SPASS derived 3805 clauses, backtracked 204 clauses, performed 4 splits and kept 2033 clauses.
% 0.84/1.06 SPASS allocated 79705 KBytes.
% 0.84/1.06 SPASS spent 0:00:00.69 on the problem.
% 0.84/1.06 0:00:00.04 for the input.
% 0.84/1.06 0:00:00.00 for the FLOTTER CNF translation.
% 0.84/1.06 0:00:00.05 for inferences.
% 0.84/1.06 0:00:00.02 for the backtracking.
% 0.84/1.06 0:00:00.54 for the reduction.
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 Here is a proof with depth 3, length 10 :
% 0.84/1.06 % SZS output start Refutation
% See solution above
% 0.84/1.06 Formulae used in the proof : prove_restriction_property3_1 not_subclass_members1 not_subclass_members2 intersection2 restriction2
% 0.84/1.06
%------------------------------------------------------------------------------