%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 14:34:19 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 12 unt; 7 nHn; 28 RR)
% Number of literals : 51 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
subset(u,u),
file('SEU146+1.p',unknown),
[] ).
cnf(5,axiom,
subset(empty_set,u),
file('SEU146+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(u,v)
| subset(v,u) ),
file('SEU146+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ subset(u,empty_set)
| equal(u,empty_set) ),
file('SEU146+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(u,v)
| subset(singleton(u),v) ),
file('SEU146+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ equal(empty_set,skc4)
| ~ subset(skc4,singleton(skc5)) ),
file('SEU146+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ subset(u,v)
| equal(set_difference(u,v),empty_set) ),
file('SEU146+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ equal(singleton(skc5),skc4)
| ~ subset(skc4,singleton(skc5)) ),
file('SEU146+1.p',unknown),
[] ).
cnf(16,axiom,
( subset(skc4,singleton(skc5))
| equal(empty_set,skc4)
| equal(singleton(skc5),skc4) ),
file('SEU146+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal(v,u) ),
file('SEU146+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ subset(u,v)
| in(w,u)
| subset(u,set_difference(v,singleton(w))) ),
file('SEU146+1.p',unknown),
[] ).
cnf(19,plain,
~ equal(singleton(skc5),skc4),
inference(mrr,[status(thm)],[15,7]),
[iquote('0:MRR:15.1,7.1')] ).
cnf(20,plain,
( equal(empty_set,skc4)
| subset(skc4,singleton(skc5)) ),
inference(mrr,[status(thm)],[16,19]),
[iquote('0:MRR:16.2,19.0')] ).
cnf(21,plain,
( ~ subset(skc4,singleton(skc5))
| ~ subset(singleton(skc5),skc4) ),
inference(res,[status(thm),theory(equality)],[17,19]),
[iquote('0:Res:17.2,19.0')] ).
cnf(23,plain,
equal(empty_set,skc4),
inference(spt,[spt(split,[position(s1)])],[20]),
[iquote('1:Spt:20.0')] ).
cnf(26,plain,
( ~ equal(skc4,skc4)
| ~ subset(skc4,singleton(skc5)) ),
inference(rew,[status(thm),theory(equality)],[23,12]),
[iquote('1:Rew:23.0,12.0')] ).
cnf(28,plain,
subset(skc4,u),
inference(rew,[status(thm),theory(equality)],[23,5]),
[iquote('1:Rew:23.0,5.0')] ).
cnf(32,plain,
~ subset(skc4,singleton(skc5)),
inference(obv,[status(thm),theory(equality)],[26]),
[iquote('1:Obv:26.0')] ).
cnf(33,plain,
$false,
inference(mrr,[status(thm)],[32,28]),
[iquote('1:MRR:32.0,28.0')] ).
cnf(34,plain,
~ equal(empty_set,skc4),
inference(spt,[spt(split,[position(sa)])],[33,23]),
[iquote('1:Spt:33.0,20.0,23.0')] ).
cnf(35,plain,
subset(skc4,singleton(skc5)),
inference(spt,[spt(split,[position(s2)])],[20]),
[iquote('1:Spt:33.0,20.1')] ).
cnf(36,plain,
~ subset(singleton(skc5),skc4),
inference(mrr,[status(thm)],[21,35]),
[iquote('1:MRR:21.0,35.0')] ).
cnf(42,plain,
~ in(skc5,skc4),
inference(res,[status(thm),theory(equality)],[11,36]),
[iquote('1:Res:11.1,36.0')] ).
cnf(69,plain,
( ~ subset(u,singleton(v))
| ~ subset(w,u)
| in(v,w)
| subset(w,empty_set) ),
inference(spr,[status(thm),theory(equality)],[14,18]),
[iquote('0:SpR:14.1,18.2')] ).
cnf(74,plain,
( ~ subset(u,skc4)
| in(skc5,u)
| subset(u,empty_set) ),
inference(res,[status(thm),theory(equality)],[35,69]),
[iquote('1:Res:35.0,69.0')] ).
cnf(80,plain,
( ~ subset(u,skc4)
| in(skc5,u)
| equal(u,empty_set) ),
inference(res,[status(thm),theory(equality)],[74,8]),
[iquote('1:Res:74.2,8.0')] ).
cnf(83,plain,
( in(skc5,skc4)
| equal(empty_set,skc4) ),
inference(res,[status(thm),theory(equality)],[4,80]),
[iquote('1:Res:4.0,80.0')] ).
cnf(86,plain,
$false,
inference(mrr,[status(thm)],[83,42,34]),
[iquote('1:MRR:83.0,83.1,42.0,34.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n006.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 : Sat Jun 18 22:46:25 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/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 58 clauses, backtracked 9 clauses, performed 1 splits and kept 58 clauses.
% 0.19/0.44 SPASS allocated 85132 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 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 4, length 28 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : reflexivity_r1_tarski t2_xboole_1 d10_xboole_0 t3_xboole_1 l2_zfmisc_1 l4_zfmisc_1 t37_xboole_1 l3_zfmisc_1
% 0.19/0.44
%------------------------------------------------------------------------------