TSTP Solution File: SEU171+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU171+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 16.91s 17.10s
% Output : Refutation 16.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 16 unt; 3 nHn; 26 RR)
% Number of literals : 41 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
element(skc7,skc5),
file('SEU171+2.p',unknown),
[] ).
cnf(8,axiom,
element(skc6,powerset(skc5)),
file('SEU171+2.p',unknown),
[] ).
cnf(9,axiom,
~ equal(empty_set,skc5),
file('SEU171+2.p',unknown),
[] ).
cnf(10,axiom,
~ in(skc7,skc6),
file('SEU171+2.p',unknown),
[] ).
cnf(32,axiom,
~ in(skc7,subset_complement(skc5,skc6)),
file('SEU171+2.p',unknown),
[] ).
cnf(35,axiom,
( ~ empty(u)
| equal(u,empty_set) ),
file('SEU171+2.p',unknown),
[] ).
cnf(66,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU171+2.p',unknown),
[] ).
cnf(86,axiom,
equal(set_difference(u,set_difference(u,v)),set_intersection2(u,v)),
file('SEU171+2.p',unknown),
[] ).
cnf(105,axiom,
( ~ element(u,powerset(v))
| element(subset_complement(v,u),powerset(v)) ),
file('SEU171+2.p',unknown),
[] ).
cnf(125,axiom,
( ~ element(u,powerset(v))
| equal(set_difference(v,u),subset_complement(v,u)) ),
file('SEU171+2.p',unknown),
[] ).
cnf(126,axiom,
( ~ element(u,powerset(v))
| equal(subset_complement(v,subset_complement(v,u)),u) ),
file('SEU171+2.p',unknown),
[] ).
cnf(166,axiom,
( ~ in(u,v)
| ~ equal(w,set_difference(v,x))
| in(u,w)
| in(u,x) ),
file('SEU171+2.p',unknown),
[] ).
cnf(191,plain,
( in(skc7,skc5)
| empty(skc5) ),
inference(res,[status(thm),theory(equality)],[3,66]),
[iquote('0:Res:3.0,66.0')] ).
cnf(198,plain,
( ~ in(skc7,u)
| ~ equal(set_difference(u,v),skc6)
| in(skc7,v) ),
inference(res,[status(thm),theory(equality)],[166,10]),
[iquote('0:Res:166.3,10.0')] ).
cnf(237,plain,
~ empty(skc5),
inference(res,[status(thm),theory(equality)],[35,9]),
[iquote('0:Res:35.1,9.0')] ).
cnf(255,plain,
equal(set_difference(skc5,skc6),subset_complement(skc5,skc6)),
inference(res,[status(thm),theory(equality)],[8,125]),
[iquote('0:Res:8.0,125.0')] ).
cnf(256,plain,
equal(subset_complement(skc5,subset_complement(skc5,skc6)),skc6),
inference(res,[status(thm),theory(equality)],[8,126]),
[iquote('0:Res:8.0,126.0')] ).
cnf(258,plain,
element(subset_complement(skc5,skc6),powerset(skc5)),
inference(res,[status(thm),theory(equality)],[8,105]),
[iquote('0:Res:8.0,105.0')] ).
cnf(290,plain,
in(skc7,skc5),
inference(mrr,[status(thm)],[191,237]),
[iquote('0:MRR:191.1,237.0')] ).
cnf(789,plain,
equal(set_difference(skc5,subset_complement(skc5,skc6)),set_intersection2(skc5,skc6)),
inference(spr,[status(thm),theory(equality)],[255,86]),
[iquote('0:SpR:255.0,86.0')] ).
cnf(1567,plain,
equal(set_difference(skc5,subset_complement(skc5,skc6)),subset_complement(skc5,subset_complement(skc5,skc6))),
inference(res,[status(thm),theory(equality)],[258,125]),
[iquote('0:Res:258.0,125.0')] ).
cnf(1574,plain,
equal(set_intersection2(skc5,skc6),skc6),
inference(rew,[status(thm),theory(equality)],[789,1567,256]),
[iquote('0:Rew:789.0,1567.0,256.0,1567.0')] ).
cnf(1575,plain,
equal(set_difference(skc5,subset_complement(skc5,skc6)),skc6),
inference(rew,[status(thm),theory(equality)],[1574,789]),
[iquote('0:Rew:1574.0,789.0')] ).
cnf(16567,plain,
( ~ in(skc7,skc5)
| ~ equal(skc6,skc6)
| in(skc7,subset_complement(skc5,skc6)) ),
inference(spl,[status(thm),theory(equality)],[1575,198]),
[iquote('0:SpL:1575.0,198.1')] ).
cnf(16575,plain,
( ~ in(skc7,skc5)
| in(skc7,subset_complement(skc5,skc6)) ),
inference(obv,[status(thm),theory(equality)],[16567]),
[iquote('0:Obv:16567.1')] ).
cnf(16576,plain,
$false,
inference(mrr,[status(thm)],[16575,290,32]),
[iquote('0:MRR:16575.0,16575.1,290.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU171+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.35 % Computer : n016.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Sun Jun 19 02:22:53 EDT 2022
% 0.12/0.35 % CPUTime :
% 16.91/17.10
% 16.91/17.10 SPASS V 3.9
% 16.91/17.10 SPASS beiseite: Proof found.
% 16.91/17.10 % SZS status Theorem
% 16.91/17.10 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.91/17.10 SPASS derived 14732 clauses, backtracked 108 clauses, performed 5 splits and kept 6834 clauses.
% 16.91/17.10 SPASS allocated 109535 KBytes.
% 16.91/17.10 SPASS spent 0:0:16.52 on the problem.
% 16.91/17.10 0:00:00.05 for the input.
% 16.91/17.10 0:00:00.29 for the FLOTTER CNF translation.
% 16.91/17.10 0:00:00.41 for inferences.
% 16.91/17.10 0:00:00.06 for the backtracking.
% 16.91/17.10 0:0:15.41 for the reduction.
% 16.91/17.10
% 16.91/17.10
% 16.91/17.10 Here is a proof with depth 3, length 26 :
% 16.91/17.10 % SZS output start Refutation
% See solution above
% 16.91/17.10 Formulae used in the proof : t50_subset_1 t6_boole d2_subset_1 t48_xboole_1 dt_k3_subset_1 d5_subset_1 involutiveness_k3_subset_1 d4_xboole_0
% 16.91/17.10
%------------------------------------------------------------------------------