%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:27:37 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
intersect(skc5,skc3),
file('SET625+3.p',unknown),
[] ).
cnf(2,axiom,
subset(skc3,skc4),
file('SET625+3.p',unknown),
[] ).
cnf(4,axiom,
~ intersect(skc5,skc4),
file('SET625+3.p',unknown),
[] ).
cnf(7,axiom,
( ~ intersect(u,v)
| member(skf2(v,u),u) ),
file('SET625+3.p',unknown),
[] ).
cnf(8,axiom,
( ~ intersect(u,v)
| member(skf2(v,w),v) ),
file('SET625+3.p',unknown),
[] ).
cnf(10,axiom,
( ~ member(u,v)
| ~ member(u,w)
| intersect(w,v) ),
file('SET625+3.p',unknown),
[] ).
cnf(11,axiom,
( ~ member(u,v)
| ~ subset(v,w)
| member(u,w) ),
file('SET625+3.p',unknown),
[] ).
cnf(12,plain,
( ~ member(u,skc3)
| member(u,skc4) ),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.0')] ).
cnf(13,plain,
member(skf2(skc3,skc5),skc5),
inference(res,[status(thm),theory(equality)],[1,7]),
[iquote('0:Res:1.0,7.0')] ).
cnf(14,plain,
member(skf2(skc3,u),skc3),
inference(res,[status(thm),theory(equality)],[1,8]),
[iquote('0:Res:1.0,8.0')] ).
cnf(17,plain,
( ~ member(u,skc4)
| ~ member(u,skc5) ),
inference(res,[status(thm),theory(equality)],[10,4]),
[iquote('0:Res:10.2,4.0')] ).
cnf(18,plain,
member(skf2(skc3,u),skc4),
inference(res,[status(thm),theory(equality)],[14,12]),
[iquote('0:Res:14.0,12.0')] ).
cnf(21,plain,
~ member(skf2(skc3,u),skc5),
inference(res,[status(thm),theory(equality)],[18,17]),
[iquote('0:Res:18.0,17.0')] ).
cnf(22,plain,
$false,
inference(unc,[status(thm)],[21,13]),
[iquote('0:UnC:21.0,13.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.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 11:11:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 19 clauses.
% 0.19/0.44 SPASS allocated 85276 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.03 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 3, length 14 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : prove_th101 intersect_defn subset_defn
% 0.19/0.44
%------------------------------------------------------------------------------