TSTP Solution File: SEU129+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:09 EDT 2022
% Result : Theorem 18.62s 18.79s
% Output : Refutation 18.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 7 unt; 11 nHn; 35 RR)
% Number of literals : 79 ( 0 equ; 33 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(skc5,skc6),
file('SEU129+1.p',unknown),
[] ).
cnf(9,axiom,
equal(set_intersection2(u,v),set_intersection2(v,u)),
file('SEU129+1.p',unknown),
[] ).
cnf(11,axiom,
~ subset(set_intersection2(skc5,skc7),set_intersection2(skc6,skc7)),
file('SEU129+1.p',unknown),
[] ).
cnf(13,axiom,
( subset(u,v)
| in(skf2(v,u),u) ),
file('SEU129+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ in(skf2(u,v),u)
| subset(w,u) ),
file('SEU129+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU129+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ in(u,v)
| ~ equal(v,set_intersection2(w,x))
| in(u,x) ),
file('SEU129+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ in(u,v)
| ~ in(u,w)
| ~ equal(x,set_intersection2(w,v))
| in(u,x) ),
file('SEU129+1.p',unknown),
[] ).
cnf(21,axiom,
( equal(u,set_intersection2(v,w))
| in(skf3(w,v,u),u)
| in(skf3(w,v,u),w) ),
file('SEU129+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ in(skf3(u,v,w),u)
| ~ in(skf3(u,v,w),v)
| ~ in(skf3(u,v,w),w)
| equal(w,set_intersection2(v,u)) ),
file('SEU129+1.p',unknown),
[] ).
cnf(23,plain,
( ~ in(u,skc5)
| in(u,skc6) ),
inference(res,[status(thm),theory(equality)],[3,16]),
[iquote('0:Res:3.0,16.0')] ).
cnf(73,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[18]),
[iquote('0:EqR:18.1')] ).
cnf(81,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,v) ),
inference(spl,[status(thm),theory(equality)],[9,73]),
[iquote('0:SpL:9.0,73.0')] ).
cnf(84,plain,
( subset(set_intersection2(u,v),w)
| in(skf2(w,set_intersection2(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[13,73]),
[iquote('0:Res:13.1,73.0')] ).
cnf(119,plain,
( ~ in(u,v)
| ~ in(u,w)
| in(u,set_intersection2(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[19]),
[iquote('0:EqR:19.2')] ).
cnf(154,plain,
( equal(set_intersection2(u,v),v)
| in(skf3(v,u,v),v) ),
inference(fac,[status(thm)],[21]),
[iquote('0:Fac:21.1,21.2')] ).
cnf(310,plain,
( ~ subset(u,v)
| equal(set_intersection2(w,u),u)
| in(skf3(u,w,u),v) ),
inference(res,[status(thm),theory(equality)],[154,16]),
[iquote('0:Res:154.1,16.0')] ).
cnf(315,plain,
( ~ in(skf3(u,v,u),v)
| ~ in(skf3(u,v,u),u)
| equal(set_intersection2(v,u),u)
| equal(set_intersection2(v,u),u) ),
inference(res,[status(thm),theory(equality)],[154,22]),
[iquote('0:Res:154.1,22.0')] ).
cnf(317,plain,
( ~ in(skf3(u,v,u),v)
| ~ in(skf3(u,v,u),u)
| equal(set_intersection2(v,u),u) ),
inference(obv,[status(thm),theory(equality)],[315]),
[iquote('0:Obv:315.2')] ).
cnf(318,plain,
( ~ in(skf3(u,v,u),v)
| equal(set_intersection2(v,u),u) ),
inference(mrr,[status(thm)],[317,154]),
[iquote('0:MRR:317.1,154.1')] ).
cnf(463,plain,
( ~ in(skf2(set_intersection2(u,v),w),v)
| ~ in(skf2(set_intersection2(u,v),w),u)
| subset(x,set_intersection2(u,v)) ),
inference(res,[status(thm),theory(equality)],[119,14]),
[iquote('0:Res:119.2,14.0')] ).
cnf(604,plain,
( subset(set_intersection2(u,v),v)
| subset(w,v) ),
inference(res,[status(thm),theory(equality)],[84,14]),
[iquote('0:Res:84.1,14.0')] ).
cnf(618,plain,
subset(set_intersection2(u,v),v),
inference(con,[status(thm)],[604]),
[iquote('0:Con:604.1')] ).
cnf(647,plain,
subset(set_intersection2(u,v),u),
inference(spr,[status(thm),theory(equality)],[9,618]),
[iquote('0:SpR:9.0,618.0')] ).
cnf(744,plain,
( ~ in(skf3(u,skc6,u),skc5)
| equal(set_intersection2(skc6,u),u) ),
inference(res,[status(thm),theory(equality)],[23,318]),
[iquote('0:Res:23.1,318.0')] ).
cnf(2168,plain,
( ~ subset(u,skc5)
| equal(set_intersection2(skc6,u),u)
| equal(set_intersection2(skc6,u),u) ),
inference(res,[status(thm),theory(equality)],[310,744]),
[iquote('0:Res:310.2,744.0')] ).
cnf(2180,plain,
( ~ subset(u,skc5)
| equal(set_intersection2(skc6,u),u) ),
inference(obv,[status(thm),theory(equality)],[2168]),
[iquote('0:Obv:2168.1')] ).
cnf(2219,plain,
( ~ subset(u,skc5)
| ~ in(v,u)
| in(v,skc6) ),
inference(spl,[status(thm),theory(equality)],[2180,81]),
[iquote('0:SpL:2180.1,81.0')] ).
cnf(2727,plain,
( ~ in(u,set_intersection2(skc5,v))
| in(u,skc6) ),
inference(res,[status(thm),theory(equality)],[647,2219]),
[iquote('0:Res:647.0,2219.0')] ).
cnf(2790,plain,
( subset(set_intersection2(skc5,u),v)
| in(skf2(v,set_intersection2(skc5,u)),skc6) ),
inference(res,[status(thm),theory(equality)],[13,2727]),
[iquote('0:Res:13.1,2727.0')] ).
cnf(5269,plain,
( ~ in(skf2(set_intersection2(u,v),set_intersection2(w,v)),u)
| subset(set_intersection2(w,v),set_intersection2(u,v))
| subset(x,set_intersection2(u,v)) ),
inference(res,[status(thm),theory(equality)],[84,463]),
[iquote('0:Res:84.1,463.0')] ).
cnf(5298,plain,
( ~ in(skf2(set_intersection2(u,v),set_intersection2(w,v)),u)
| subset(set_intersection2(w,v),set_intersection2(u,v)) ),
inference(con,[status(thm)],[5269]),
[iquote('0:Con:5269.2')] ).
cnf(33042,plain,
( subset(set_intersection2(skc5,u),set_intersection2(skc6,u))
| subset(set_intersection2(skc5,u),set_intersection2(skc6,u)) ),
inference(res,[status(thm),theory(equality)],[2790,5298]),
[iquote('0:Res:2790.1,5298.0')] ).
cnf(33054,plain,
subset(set_intersection2(skc5,u),set_intersection2(skc6,u)),
inference(obv,[status(thm),theory(equality)],[33042]),
[iquote('0:Obv:33042.0')] ).
cnf(33055,plain,
$false,
inference(unc,[status(thm)],[33054,11]),
[iquote('0:UnC:33054.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.31 % Computer : n003.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sun Jun 19 12:30:29 EDT 2022
% 0.12/0.31 % CPUTime :
% 18.62/18.79
% 18.62/18.79 SPASS V 3.9
% 18.62/18.79 SPASS beiseite: Proof found.
% 18.62/18.79 % SZS status Theorem
% 18.62/18.79 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.62/18.79 SPASS derived 25815 clauses, backtracked 169 clauses, performed 1 splits and kept 6280 clauses.
% 18.62/18.79 SPASS allocated 119627 KBytes.
% 18.62/18.79 SPASS spent 0:0:17.83 on the problem.
% 18.62/18.79 0:00:00.04 for the input.
% 18.62/18.79 0:00:00.04 for the FLOTTER CNF translation.
% 18.62/18.79 0:00:00.25 for inferences.
% 18.62/18.79 0:00:00.37 for the backtracking.
% 18.62/18.79 0:0:17.05 for the reduction.
% 18.62/18.79
% 18.62/18.79
% 18.62/18.79 Here is a proof with depth 8, length 35 :
% 18.62/18.79 % SZS output start Refutation
% See solution above
% 18.62/18.79 Formulae used in the proof : t26_xboole_1 commutativity_k3_xboole_0 d3_tarski d3_xboole_0
% 18.62/18.79
%------------------------------------------------------------------------------