TSTP Solution File: SEU103+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 33 ( 15 unt; 13 nHn; 33 RR)
% Number of literals : 80 ( 0 equ; 39 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 : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
preboolean(skc7),
file('SEU103+1.p',unknown),
[] ).
cnf(9,axiom,
element(skc9,skc7),
file('SEU103+1.p',unknown),
[] ).
cnf(10,axiom,
element(skc8,skc7),
file('SEU103+1.p',unknown),
[] ).
cnf(11,axiom,
~ empty(skc7),
file('SEU103+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ preboolean(u)
| cup_closed(u) ),
file('SEU103+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ preboolean(u)
| diff_closed(u) ),
file('SEU103+1.p',unknown),
[] ).
cnf(43,axiom,
~ element(symmetric_difference(skc9,skc8),skc7),
file('SEU103+1.p',unknown),
[] ).
cnf(49,axiom,
equal(symmetric_difference(u,v),symmetric_difference(v,u)),
file('SEU103+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('SEU103+1.p',unknown),
[] ).
cnf(59,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU103+1.p',unknown),
[] ).
cnf(64,axiom,
equal(set_union2(set_difference(u,v),set_difference(v,u)),symmetric_difference(u,v)),
file('SEU103+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| element(prebool_union2(u,w,v),u)
| empty(u) ),
file('SEU103+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| element(prebool_difference(u,w,v),u)
| empty(u) ),
file('SEU103+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| equal(prebool_difference(u,v,w),set_difference(v,w)) ),
file('SEU103+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| equal(prebool_union2(u,v,w),set_union2(v,w)) ),
file('SEU103+1.p',unknown),
[] ).
cnf(73,plain,
~ element(symmetric_difference(skc8,skc9),skc7),
inference(rew,[status(thm),theory(equality)],[49,43]),
[iquote('0:Rew:49.0,43.0')] ).
cnf(74,plain,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| element(set_difference(v,w),u) ),
inference(rew,[status(thm),theory(equality)],[70,69]),
[iquote('0:Rew:70.3,69.3')] ).
cnf(75,plain,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| element(set_union2(v,w),u) ),
inference(rew,[status(thm),theory(equality)],[71,68]),
[iquote('0:Rew:71.3,68.3')] ).
cnf(82,plain,
cup_closed(skc7),
inference(res,[status(thm),theory(equality)],[1,29]),
[iquote('0:Res:1.0,29.0')] ).
cnf(83,plain,
diff_closed(skc7),
inference(res,[status(thm),theory(equality)],[1,30]),
[iquote('0:Res:1.0,30.0')] ).
cnf(99,plain,
( ~ preboolean(skc7)
| ~ element(u,skc7)
| element(set_difference(u,skc8),skc7)
| empty(skc7) ),
inference(res,[status(thm),theory(equality)],[10,74]),
[iquote('0:Res:10.0,74.1')] ).
cnf(104,plain,
( ~ preboolean(skc7)
| ~ element(u,skc7)
| element(set_difference(skc8,u),skc7)
| empty(skc7) ),
inference(res,[status(thm),theory(equality)],[10,74]),
[iquote('0:Res:10.0,74.2')] ).
cnf(116,plain,
( in(skc9,skc7)
| empty(skc7) ),
inference(res,[status(thm),theory(equality)],[9,59]),
[iquote('0:Res:9.0,59.0')] ).
cnf(120,plain,
in(skc9,skc7),
inference(mrr,[status(thm)],[116,11]),
[iquote('0:MRR:116.1,11.0')] ).
cnf(125,plain,
( ~ element(u,skc7)
| element(set_difference(u,skc8),skc7) ),
inference(mrr,[status(thm)],[99,1,11]),
[iquote('0:MRR:99.0,99.3,1.0,11.0')] ).
cnf(127,plain,
( ~ element(u,skc7)
| element(set_difference(skc8,u),skc7) ),
inference(mrr,[status(thm)],[104,1,11]),
[iquote('0:MRR:104.0,104.3,1.0,11.0')] ).
cnf(164,plain,
element(set_difference(skc8,skc9),skc7),
inference(res,[status(thm),theory(equality)],[9,127]),
[iquote('0:Res:9.0,127.0')] ).
cnf(166,plain,
element(set_difference(skc9,skc8),skc7),
inference(res,[status(thm),theory(equality)],[9,125]),
[iquote('0:Res:9.0,125.0')] ).
cnf(250,plain,
~ empty(skc7),
inference(res,[status(thm),theory(equality)],[120,54]),
[iquote('0:Res:120.0,54.1')] ).
cnf(488,plain,
( ~ preboolean(u)
| ~ element(set_difference(v,w),u)
| ~ element(set_difference(w,v),u)
| empty(u)
| element(symmetric_difference(v,w),u) ),
inference(spr,[status(thm),theory(equality)],[64,75]),
[iquote('0:SpR:64.0,75.4')] ).
cnf(1541,plain,
( ~ preboolean(skc7)
| ~ element(set_difference(skc9,skc8),skc7)
| empty(skc7)
| element(symmetric_difference(skc8,skc9),skc7) ),
inference(res,[status(thm),theory(equality)],[164,488]),
[iquote('0:Res:164.0,488.1')] ).
cnf(1551,plain,
( ~ element(set_difference(skc9,skc8),skc7)
| empty(skc7)
| element(symmetric_difference(skc8,skc9),skc7) ),
inference(ssi,[status(thm)],[1541,1,83,82]),
[iquote('0:SSi:1541.0,1.0,83.0,82.0')] ).
cnf(1552,plain,
$false,
inference(mrr,[status(thm)],[1551,166,250,73]),
[iquote('0:MRR:1551.0,1551.1,1551.2,166.0,250.0,73.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Sun Jun 19 08:30:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54
% 0.19/0.54 SPASS V 3.9
% 0.19/0.54 SPASS beiseite: Proof found.
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 SPASS derived 1281 clauses, backtracked 0 clauses, performed 0 splits and kept 589 clauses.
% 0.19/0.54 SPASS allocated 98761 KBytes.
% 0.19/0.54 SPASS spent 0:00:00.18 on the problem.
% 0.19/0.54 0:00:00.04 for the input.
% 0.19/0.54 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.54 0:00:00.02 for inferences.
% 0.19/0.54 0:00:00.00 for the backtracking.
% 0.19/0.54 0:00:00.06 for the reduction.
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Here is a proof with depth 3, length 33 :
% 0.19/0.54 % SZS output start Refutation
% See solution above
% 0.19/0.54 Formulae used in the proof : t14_finsub_1 cc1_finsub_1 commutativity_k5_xboole_0 t7_boole t2_subset d6_xboole_0 dt_k1_finsub_1 dt_k2_finsub_1 redefinition_k2_finsub_1 redefinition_k1_finsub_1
% 0.19/0.54
%------------------------------------------------------------------------------