%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM139-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:24:18 EDT 2022
% Result : Unsatisfiable 0.19s 0.55s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 1 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ member(not_subclass_element(intersection(power_class(x__dfg),z__dfg),x__dfg),z__dfg),
file('NUM139-1.p',unknown),
[] ).
cnf(2,axiom,
~ subclass(intersection(power_class(x__dfg),z__dfg),x__dfg),
file('NUM139-1.p',unknown),
[] ).
cnf(4,axiom,
( subclass(u,v)
| member(not_subclass_element(u,v),u) ),
file('NUM139-1.p',unknown),
[] ).
cnf(24,axiom,
( ~ member(u,intersection(v,w))
| member(u,w) ),
file('NUM139-1.p',unknown),
[] ).
cnf(171,plain,
~ member(not_subclass_element(intersection(power_class(x__dfg),z__dfg),x__dfg),intersection(u,z__dfg)),
inference(res,[status(thm),theory(equality)],[24,1]),
[iquote('0:Res:24.1,1.0')] ).
cnf(907,plain,
subclass(intersection(power_class(x__dfg),z__dfg),x__dfg),
inference(res,[status(thm),theory(equality)],[4,171]),
[iquote('0:Res:4.1,171.0')] ).
cnf(908,plain,
$false,
inference(mrr,[status(thm)],[907,2]),
[iquote('0:MRR:907.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM139-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 06:43:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.55
% 0.19/0.55 SPASS V 3.9
% 0.19/0.55 SPASS beiseite: Proof found.
% 0.19/0.55 % SZS status Theorem
% 0.19/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.55 SPASS derived 658 clauses, backtracked 97 clauses, performed 9 splits and kept 620 clauses.
% 0.19/0.55 SPASS allocated 76406 KBytes.
% 0.19/0.55 SPASS spent 0:00:00.19 on the problem.
% 0.19/0.55 0:00:00.04 for the input.
% 0.19/0.55 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.55 0:00:00.01 for inferences.
% 0.19/0.55 0:00:00.00 for the backtracking.
% 0.19/0.55 0:00:00.10 for the reduction.
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Here is a proof with depth 2, length 7 :
% 0.19/0.55 % SZS output start Refutation
% See solution above
% 0.19/0.55 Formulae used in the proof : prove_complete_induction3_1 prove_complete_induction3_2 not_subclass_members1 intersection2
% 0.19/0.55
%------------------------------------------------------------------------------