%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU172+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:41 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 0 equ; 9 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
in(skc5,skc6),
file('SEU172+1.p',unknown),
[] ).
cnf(6,axiom,
element(skc6,powerset(skc7)),
file('SEU172+1.p',unknown),
[] ).
cnf(9,axiom,
in(skc5,subset_complement(skc7,skc6)),
file('SEU172+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ element(u,powerset(v))
| equal(subset_complement(v,u),set_difference(v,u)) ),
file('SEU172+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ in(u,v)
| ~ in(u,w)
| ~ equal(v,set_difference(x,w)) ),
file('SEU172+1.p',unknown),
[] ).
cnf(39,plain,
equal(subset_complement(skc7,skc6),set_difference(skc7,skc6)),
inference(res,[status(thm),theory(equality)],[6,21]),
[iquote('0:Res:6.0,21.0')] ).
cnf(46,plain,
( ~ in(skc5,u)
| ~ equal(subset_complement(skc7,skc6),set_difference(v,u)) ),
inference(res,[status(thm),theory(equality)],[9,23]),
[iquote('0:Res:9.0,23.1')] ).
cnf(50,plain,
( ~ in(skc5,u)
| ~ equal(set_difference(skc7,skc6),set_difference(v,u)) ),
inference(rew,[status(thm),theory(equality)],[39,46]),
[iquote('0:Rew:39.0,46.1')] ).
cnf(51,plain,
~ equal(set_difference(skc7,skc6),set_difference(u,skc6)),
inference(res,[status(thm),theory(equality)],[3,50]),
[iquote('0:Res:3.0,50.0')] ).
cnf(54,plain,
$false,
inference(obv,[status(thm),theory(equality)],[51]),
[iquote('0:Obv:51.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU172+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n007.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 : Mon Jun 20 01:11:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.20/0.45 SPASS allocated 97853 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.03 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 10 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : t54_subset_1 d5_subset_1 d4_xboole_0
% 0.20/0.45
%------------------------------------------------------------------------------