TSTP Solution File: SEU125+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU125+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:34:07 EDT 2022
% Result : Theorem 7.91s 8.14s
% Output : Refutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 8 unt; 14 nHn; 33 RR)
% Number of literals : 73 ( 0 equ; 23 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(skc7,skc5),
file('SEU125+1.p',unknown),
[] ).
cnf(4,axiom,
subset(skc6,skc5),
file('SEU125+1.p',unknown),
[] ).
cnf(9,axiom,
~ subset(set_union2(skc7,skc6),skc5),
file('SEU125+1.p',unknown),
[] ).
cnf(11,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU125+1.p',unknown),
[] ).
cnf(16,axiom,
( subset(u,v)
| in(skf3(v,u),u) ),
file('SEU125+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ in(skf3(u,v),u)
| subset(w,u) ),
file('SEU125+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU125+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ in(u,v)
| ~ equal(w,set_union2(x,v))
| in(u,w) ),
file('SEU125+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ in(u,v)
| ~ equal(v,set_union2(w,x))
| in(u,x)
| in(u,w) ),
file('SEU125+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ in(skf2(u,v,w),w)
| ~ in(skf2(u,v,w),v)
| equal(w,set_union2(v,u)) ),
file('SEU125+1.p',unknown),
[] ).
cnf(25,axiom,
( equal(u,set_union2(v,w))
| in(skf2(w,v,u),w)
| in(skf2(w,v,u),v)
| in(skf2(w,v,u),u) ),
file('SEU125+1.p',unknown),
[] ).
cnf(26,plain,
~ subset(set_union2(skc6,skc7),skc5),
inference(rew,[status(thm),theory(equality)],[11,9]),
[iquote('0:Rew:11.0,9.0')] ).
cnf(27,plain,
( ~ in(u,skc6)
| in(u,skc5) ),
inference(res,[status(thm),theory(equality)],[4,19]),
[iquote('0:Res:4.0,19.0')] ).
cnf(28,plain,
( ~ in(u,skc7)
| in(u,skc5) ),
inference(res,[status(thm),theory(equality)],[3,19]),
[iquote('0:Res:3.0,19.0')] ).
cnf(30,plain,
~ in(skf3(skc5,u),skc5),
inference(res,[status(thm),theory(equality)],[17,26]),
[iquote('0:Res:17.1,26.0')] ).
cnf(92,plain,
( ~ in(u,v)
| in(u,set_union2(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[21]),
[iquote('0:EqR:21.1')] ).
cnf(126,plain,
( ~ in(skf3(set_union2(u,v),w),v)
| subset(x,set_union2(u,v)) ),
inference(res,[status(thm),theory(equality)],[92,17]),
[iquote('0:Res:92.1,17.0')] ).
cnf(136,plain,
( ~ in(u,set_union2(v,w))
| in(u,w)
| in(u,v) ),
inference(eqr,[status(thm),theory(equality)],[22]),
[iquote('0:EqR:22.1')] ).
cnf(215,plain,
( equal(set_union2(u,v),u)
| in(skf2(v,u,u),v)
| in(skf2(v,u,u),u) ),
inference(fac,[status(thm)],[25]),
[iquote('0:Fac:25.2,25.3')] ).
cnf(321,plain,
( subset(set_union2(u,v),w)
| in(skf3(w,set_union2(u,v)),v)
| in(skf3(w,set_union2(u,v)),u) ),
inference(res,[status(thm),theory(equality)],[16,136]),
[iquote('0:Res:16.1,136.0')] ).
cnf(603,plain,
( ~ in(skf2(u,v,v),v)
| equal(set_union2(v,u),v)
| in(skf2(u,v,v),u)
| equal(set_union2(v,u),v) ),
inference(res,[status(thm),theory(equality)],[215,23]),
[iquote('0:Res:215.2,23.0')] ).
cnf(609,plain,
( ~ in(skf2(u,v,v),v)
| in(skf2(u,v,v),u)
| equal(set_union2(v,u),v) ),
inference(obv,[status(thm),theory(equality)],[603]),
[iquote('0:Obv:603.1')] ).
cnf(610,plain,
( in(skf2(u,v,v),u)
| equal(set_union2(v,u),v) ),
inference(mrr,[status(thm)],[609,215]),
[iquote('0:MRR:609.0,215.2')] ).
cnf(1413,plain,
( equal(set_union2(u,skc7),u)
| in(skf2(skc7,u,u),skc5) ),
inference(res,[status(thm),theory(equality)],[610,28]),
[iquote('0:Res:610.0,28.0')] ).
cnf(2265,plain,
( ~ in(skf2(skc7,skc5,skc5),skc5)
| equal(set_union2(skc5,skc7),skc5)
| equal(set_union2(skc5,skc7),skc5) ),
inference(res,[status(thm),theory(equality)],[1413,23]),
[iquote('0:Res:1413.1,23.0')] ).
cnf(2267,plain,
( ~ in(skf2(skc7,skc5,skc5),skc5)
| equal(set_union2(skc5,skc7),skc5) ),
inference(obv,[status(thm),theory(equality)],[2265]),
[iquote('0:Obv:2265.1')] ).
cnf(2268,plain,
equal(set_union2(skc5,skc7),skc5),
inference(mrr,[status(thm)],[2267,1413]),
[iquote('0:MRR:2267.0,1413.1')] ).
cnf(2756,plain,
( ~ in(skf3(skc5,u),skc7)
| subset(v,set_union2(skc5,skc7)) ),
inference(spl,[status(thm),theory(equality)],[2268,126]),
[iquote('0:SpL:2268.0,126.0')] ).
cnf(2775,plain,
( ~ in(skf3(skc5,u),skc7)
| subset(v,skc5) ),
inference(rew,[status(thm),theory(equality)],[2268,2756]),
[iquote('0:Rew:2268.0,2756.1')] ).
cnf(7615,plain,
( subset(set_union2(u,skc7),skc5)
| in(skf3(skc5,set_union2(u,skc7)),u)
| subset(v,skc5) ),
inference(res,[status(thm),theory(equality)],[321,2775]),
[iquote('0:Res:321.1,2775.0')] ).
cnf(7653,plain,
( subset(set_union2(u,skc7),skc5)
| in(skf3(skc5,set_union2(u,skc7)),u) ),
inference(con,[status(thm)],[7615]),
[iquote('0:Con:7615.2')] ).
cnf(12808,plain,
( subset(set_union2(skc6,skc7),skc5)
| in(skf3(skc5,set_union2(skc6,skc7)),skc5) ),
inference(res,[status(thm),theory(equality)],[7653,27]),
[iquote('0:Res:7653.1,27.0')] ).
cnf(12827,plain,
$false,
inference(mrr,[status(thm)],[12808,26,30]),
[iquote('0:MRR:12808.0,12808.1,26.0,30.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU125+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.11 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 19:30:44 EDT 2022
% 0.11/0.33 % CPUTime :
% 7.91/8.14
% 7.91/8.14 SPASS V 3.9
% 7.91/8.14 SPASS beiseite: Proof found.
% 7.91/8.14 % SZS status Theorem
% 7.91/8.14 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.91/8.14 SPASS derived 10816 clauses, backtracked 1556 clauses, performed 5 splits and kept 5846 clauses.
% 7.91/8.14 SPASS allocated 106954 KBytes.
% 7.91/8.14 SPASS spent 0:00:07.69 on the problem.
% 7.91/8.14 0:00:00.04 for the input.
% 7.91/8.14 0:00:00.04 for the FLOTTER CNF translation.
% 7.91/8.14 0:00:00.12 for inferences.
% 7.91/8.14 0:00:00.40 for the backtracking.
% 7.91/8.14 0:00:07.02 for the reduction.
% 7.91/8.14
% 7.91/8.14
% 7.91/8.14 Here is a proof with depth 7, length 33 :
% 7.91/8.14 % SZS output start Refutation
% See solution above
% 7.91/8.14 Formulae used in the proof : t8_xboole_1 commutativity_k2_xboole_0 d3_tarski d2_xboole_0
% 7.91/8.14
%------------------------------------------------------------------------------