%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU354+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:36:33 EDT 2022
% Result : Theorem 0.13s 0.41s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 12 unt; 1 nHn; 21 RR)
% Number of literals : 31 ( 0 equ; 13 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; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(15,axiom,
element(skc4,powerset(skc3)),
file('SEU354+1.p',unknown),
[] ).
cnf(29,axiom,
element(skf7(u),powerset(u)),
file('SEU354+1.p',unknown),
[] ).
cnf(31,axiom,
equal(union(powerset(u)),u),
file('SEU354+1.p',unknown),
[] ).
cnf(34,axiom,
~ proper_element(skf7(u),powerset(u)),
file('SEU354+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ equal(skc4,skc3)
| proper_element(skc4,powerset(skc3)) ),
file('SEU354+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ proper_element(skc4,powerset(skc3))
| equal(skc4,skc3) ),
file('SEU354+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ element(u,v)
| proper_element(u,v)
| equal(u,union(v)) ),
file('SEU354+1.p',unknown),
[] ).
cnf(120,plain,
equal(skc4,skc3),
inference(spt,[spt(split,[position(s1)])],[39]),
[iquote('1:Spt:39.1')] ).
cnf(121,plain,
( ~ equal(skc4,skc3)
| proper_element(skc3,powerset(skc3)) ),
inference(rew,[status(thm),theory(equality)],[120,38]),
[iquote('1:Rew:120.0,38.1')] ).
cnf(157,plain,
( ~ equal(skc3,skc3)
| proper_element(skc3,powerset(skc3)) ),
inference(rew,[status(thm),theory(equality)],[120,121]),
[iquote('1:Rew:120.0,121.0')] ).
cnf(158,plain,
proper_element(skc3,powerset(skc3)),
inference(obv,[status(thm),theory(equality)],[157]),
[iquote('1:Obv:157.0')] ).
cnf(598,plain,
( ~ element(skf7(u),powerset(u))
| equal(union(powerset(u)),skf7(u)) ),
inference(res,[status(thm),theory(equality)],[75,34]),
[iquote('0:Res:75.1,34.0')] ).
cnf(599,plain,
( ~ element(skf7(u),powerset(u))
| equal(skf7(u),u) ),
inference(rew,[status(thm),theory(equality)],[31,598]),
[iquote('0:Rew:31.0,598.1')] ).
cnf(600,plain,
equal(skf7(u),u),
inference(mrr,[status(thm)],[599,29]),
[iquote('0:MRR:599.0,29.0')] ).
cnf(602,plain,
~ proper_element(u,powerset(u)),
inference(rew,[status(thm),theory(equality)],[600,34]),
[iquote('0:Rew:600.0,34.0')] ).
cnf(636,plain,
$false,
inference(unc,[status(thm)],[602,158]),
[iquote('1:UnC:602.0,158.0')] ).
cnf(637,plain,
~ equal(skc4,skc3),
inference(spt,[spt(split,[position(sa)])],[636,120]),
[iquote('1:Spt:636.0,39.1,120.0')] ).
cnf(638,plain,
~ proper_element(skc4,powerset(skc3)),
inference(spt,[spt(split,[position(s2)])],[39]),
[iquote('1:Spt:636.0,39.0')] ).
cnf(639,plain,
( ~ element(skc4,powerset(skc3))
| equal(union(powerset(skc3)),skc4) ),
inference(res,[status(thm),theory(equality)],[75,638]),
[iquote('1:Res:75.1,638.0')] ).
cnf(640,plain,
( ~ element(skc4,powerset(skc3))
| equal(skc4,skc3) ),
inference(rew,[status(thm),theory(equality)],[31,639]),
[iquote('1:Rew:31.0,639.1')] ).
cnf(641,plain,
$false,
inference(mrr,[status(thm)],[640,15,637]),
[iquote('1:MRR:640.0,640.1,15.0,637.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU354+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.09 % Command : run_spass %d %s
% 0.09/0.28 % Computer : n025.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat Jun 18 21:32:43 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.41
% 0.13/0.41 SPASS V 3.9
% 0.13/0.41 SPASS beiseite: Proof found.
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 SPASS derived 541 clauses, backtracked 39 clauses, performed 1 splits and kept 461 clauses.
% 0.13/0.41 SPASS allocated 97958 KBytes.
% 0.13/0.41 SPASS spent 0:00:00.11 on the problem.
% 0.13/0.41 0:00:00.03 for the input.
% 0.13/0.41 0:00:00.02 for the FLOTTER CNF translation.
% 0.13/0.41 0:00:00.01 for inferences.
% 0.13/0.41 0:00:00.00 for the backtracking.
% 0.13/0.41 0:00:00.03 for the reduction.
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Here is a proof with depth 2, length 21 :
% 0.13/0.41 % SZS output start Refutation
% See solution above
% 0.13/0.41 Formulae used in the proof : t5_tex_2 rc2_tex_2 t99_zfmisc_1 d2_tex_2
% 0.13/0.41
%------------------------------------------------------------------------------