TSTP Solution File: SEU102+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:33:58 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 27 ( 14 unt; 9 nHn; 27 RR)
% Number of literals : 58 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
preboolean(skc7),
file('SEU102+1.p',unknown),
[] ).
cnf(9,axiom,
element(skc9,skc7),
file('SEU102+1.p',unknown),
[] ).
cnf(10,axiom,
element(skc8,skc7),
file('SEU102+1.p',unknown),
[] ).
cnf(11,axiom,
~ empty(skc7),
file('SEU102+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ preboolean(u)
| cup_closed(u) ),
file('SEU102+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ preboolean(u)
| diff_closed(u) ),
file('SEU102+1.p',unknown),
[] ).
cnf(42,axiom,
~ element(set_intersection2(skc9,skc8),skc7),
file('SEU102+1.p',unknown),
[] ).
cnf(47,axiom,
equal(set_intersection2(u,v),set_intersection2(v,u)),
file('SEU102+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('SEU102+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU102+1.p',unknown),
[] ).
cnf(58,axiom,
equal(set_difference(u,set_difference(u,v)),set_intersection2(u,v)),
file('SEU102+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| element(prebool_difference(u,w,v),u)
| empty(u) ),
file('SEU102+1.p',unknown),
[] ).
cnf(64,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| equal(prebool_difference(u,v,w),set_difference(v,w)) ),
file('SEU102+1.p',unknown),
[] ).
cnf(65,plain,
~ element(set_intersection2(skc8,skc9),skc7),
inference(rew,[status(thm),theory(equality)],[47,42]),
[iquote('0:Rew:47.0,42.0')] ).
cnf(66,plain,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| element(set_difference(v,w),u) ),
inference(rew,[status(thm),theory(equality)],[64,63]),
[iquote('0:Rew:64.3,63.3')] ).
cnf(69,plain,
cup_closed(skc7),
inference(res,[status(thm),theory(equality)],[1,29]),
[iquote('0:Res:1.0,29.0')] ).
cnf(70,plain,
diff_closed(skc7),
inference(res,[status(thm),theory(equality)],[1,30]),
[iquote('0:Res:1.0,30.0')] ).
cnf(81,plain,
( ~ preboolean(skc7)
| ~ element(u,skc7)
| element(set_difference(skc8,u),skc7)
| empty(skc7) ),
inference(res,[status(thm),theory(equality)],[10,66]),
[iquote('0:Res:10.0,66.2')] ).
cnf(88,plain,
( in(skc9,skc7)
| empty(skc7) ),
inference(res,[status(thm),theory(equality)],[9,57]),
[iquote('0:Res:9.0,57.0')] ).
cnf(92,plain,
in(skc9,skc7),
inference(mrr,[status(thm)],[88,11]),
[iquote('0:MRR:88.1,11.0')] ).
cnf(94,plain,
( ~ element(u,skc7)
| element(set_difference(skc8,u),skc7) ),
inference(mrr,[status(thm)],[81,1,11]),
[iquote('0:MRR:81.0,81.3,1.0,11.0')] ).
cnf(113,plain,
element(set_difference(skc8,skc9),skc7),
inference(res,[status(thm),theory(equality)],[9,94]),
[iquote('0:Res:9.0,94.0')] ).
cnf(168,plain,
~ empty(skc7),
inference(res,[status(thm),theory(equality)],[92,52]),
[iquote('0:Res:92.0,52.1')] ).
cnf(292,plain,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(set_difference(v,w),u)
| empty(u)
| element(set_intersection2(v,w),u) ),
inference(spr,[status(thm),theory(equality)],[58,66]),
[iquote('0:SpR:58.0,66.4')] ).
cnf(1049,plain,
( ~ preboolean(skc7)
| ~ element(skc8,skc7)
| empty(skc7)
| element(set_intersection2(skc8,skc9),skc7) ),
inference(res,[status(thm),theory(equality)],[113,292]),
[iquote('0:Res:113.0,292.2')] ).
cnf(1059,plain,
( ~ element(skc8,skc7)
| empty(skc7)
| element(set_intersection2(skc8,skc9),skc7) ),
inference(ssi,[status(thm)],[1049,1,70,69]),
[iquote('0:SSi:1049.0,1.0,70.0,69.0')] ).
cnf(1060,plain,
$false,
inference(mrr,[status(thm)],[1059,10,168,65]),
[iquote('0:MRR:1059.0,1059.1,1059.2,10.0,168.0,65.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 19:42:39 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.21/0.52
% 0.21/0.52 SPASS V 3.9
% 0.21/0.52 SPASS beiseite: Proof found.
% 0.21/0.52 % SZS status Theorem
% 0.21/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 SPASS derived 867 clauses, backtracked 0 clauses, performed 0 splits and kept 447 clauses.
% 0.21/0.52 SPASS allocated 98384 KBytes.
% 0.21/0.52 SPASS spent 0:00:00.16 on the problem.
% 0.21/0.52 0:00:00.03 for the input.
% 0.21/0.52 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.52 0:00:00.01 for inferences.
% 0.21/0.52 0:00:00.00 for the backtracking.
% 0.21/0.52 0:00:00.05 for the reduction.
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 Here is a proof with depth 3, length 27 :
% 0.21/0.52 % SZS output start Refutation
% See solution above
% 0.21/0.52 Formulae used in the proof : t13_finsub_1 cc1_finsub_1 commutativity_k3_xboole_0 t7_boole t2_subset t48_xboole_1 dt_k2_finsub_1 redefinition_k2_finsub_1
% 0.21/0.52
%------------------------------------------------------------------------------