TSTP Solution File: SEU128+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU128+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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 3.08s 3.25s
% Output : Refutation 3.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of clauses : 41 ( 11 unt; 17 nHn; 41 RR)
% Number of literals : 88 ( 0 equ; 28 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,skc7),
file('SEU128+1.p',unknown),
[] ).
cnf(4,axiom,
subset(skc5,skc6),
file('SEU128+1.p',unknown),
[] ).
cnf(9,axiom,
~ subset(skc5,set_intersection2(skc7,skc6)),
file('SEU128+1.p',unknown),
[] ).
cnf(11,axiom,
equal(set_intersection2(u,v),set_intersection2(v,u)),
file('SEU128+1.p',unknown),
[] ).
cnf(14,axiom,
( subset(u,v)
| in(skf2(v,u),u) ),
file('SEU128+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ in(skf2(u,v),u)
| subset(w,u) ),
file('SEU128+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU128+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ in(u,v)
| ~ equal(v,set_intersection2(w,x))
| in(u,x) ),
file('SEU128+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ in(u,v)
| ~ in(u,w)
| ~ equal(x,set_intersection2(w,v))
| in(u,x) ),
file('SEU128+1.p',unknown),
[] ).
cnf(21,axiom,
( equal(u,set_intersection2(v,w))
| in(skf3(w,v,u),u)
| in(skf3(w,v,u),v) ),
file('SEU128+1.p',unknown),
[] ).
cnf(22,axiom,
( equal(u,set_intersection2(v,w))
| in(skf3(w,v,u),u)
| in(skf3(w,v,u),w) ),
file('SEU128+1.p',unknown),
[] ).
cnf(23,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('SEU128+1.p',unknown),
[] ).
cnf(24,plain,
~ subset(skc5,set_intersection2(skc6,skc7)),
inference(rew,[status(thm),theory(equality)],[11,9]),
[iquote('0:Rew:11.0,9.0')] ).
cnf(26,plain,
( ~ in(u,skc5)
| in(u,skc7) ),
inference(res,[status(thm),theory(equality)],[3,17]),
[iquote('0:Res:3.0,17.0')] ).
cnf(72,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[19]),
[iquote('0:EqR:19.1')] ).
cnf(83,plain,
( subset(set_intersection2(u,v),w)
| in(skf2(w,set_intersection2(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[14,72]),
[iquote('0:Res:14.1,72.0')] ).
cnf(118,plain,
( ~ in(u,v)
| ~ in(u,w)
| in(u,set_intersection2(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[20]),
[iquote('0:EqR:20.2')] ).
cnf(158,plain,
( equal(set_intersection2(u,v),v)
| in(skf3(v,u,v),v) ),
inference(fac,[status(thm)],[22]),
[iquote('0:Fac:22.1,22.2')] ).
cnf(226,plain,
( ~ subset(u,v)
| equal(u,set_intersection2(w,x))
| in(skf3(x,w,u),w)
| in(skf3(x,w,u),v) ),
inference(res,[status(thm),theory(equality)],[21,17]),
[iquote('0:Res:21.1,17.0')] ).
cnf(317,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)],[158,23]),
[iquote('0:Res:158.1,23.0')] ).
cnf(320,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)],[317]),
[iquote('0:Obv:317.2')] ).
cnf(321,plain,
( ~ in(skf3(u,v,u),v)
| equal(set_intersection2(v,u),u) ),
inference(mrr,[status(thm)],[320,158]),
[iquote('0:MRR:320.1,158.1')] ).
cnf(497,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)],[118,15]),
[iquote('0:Res:118.2,15.0')] ).
cnf(1015,plain,
( equal(set_intersection2(u,v),skc5)
| in(skf3(v,u,skc5),u)
| in(skf3(v,u,skc5),skc6) ),
inference(res,[status(thm),theory(equality)],[4,226]),
[iquote('0:Res:4.0,226.0')] ).
cnf(1288,plain,
( ~ in(skf3(u,skc7,u),skc5)
| equal(set_intersection2(skc7,u),u) ),
inference(res,[status(thm),theory(equality)],[26,321]),
[iquote('0:Res:26.1,321.0')] ).
cnf(1898,plain,
( equal(set_intersection2(skc7,skc5),skc5)
| equal(set_intersection2(skc7,skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[158,1288]),
[iquote('0:Res:158.1,1288.0')] ).
cnf(1900,plain,
equal(set_intersection2(skc7,skc5),skc5),
inference(obv,[status(thm),theory(equality)],[1898]),
[iquote('0:Obv:1898.0')] ).
cnf(1901,plain,
equal(set_intersection2(skc5,skc7),skc5),
inference(rew,[status(thm),theory(equality)],[11,1900]),
[iquote('0:Rew:11.0,1900.0')] ).
cnf(1904,plain,
( subset(set_intersection2(skc5,skc7),u)
| in(skf2(u,skc5),skc7) ),
inference(spr,[status(thm),theory(equality)],[1901,83]),
[iquote('0:SpR:1901.0,83.1')] ).
cnf(1935,plain,
( subset(skc5,u)
| in(skf2(u,skc5),skc7) ),
inference(rew,[status(thm),theory(equality)],[1901,1904]),
[iquote('0:Rew:1901.0,1904.0')] ).
cnf(3878,plain,
( equal(set_intersection2(skc6,u),skc5)
| in(skf3(u,skc6,skc5),skc6) ),
inference(fac,[status(thm)],[1015]),
[iquote('0:Fac:1015.1,1015.2')] ).
cnf(4282,plain,
( equal(set_intersection2(skc6,skc5),skc5)
| equal(set_intersection2(skc6,skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[3878,321]),
[iquote('0:Res:3878.1,321.0')] ).
cnf(4283,plain,
equal(set_intersection2(skc6,skc5),skc5),
inference(obv,[status(thm),theory(equality)],[4282]),
[iquote('0:Obv:4282.0')] ).
cnf(4284,plain,
equal(set_intersection2(skc5,skc6),skc5),
inference(rew,[status(thm),theory(equality)],[11,4283]),
[iquote('0:Rew:11.0,4283.0')] ).
cnf(4288,plain,
( subset(set_intersection2(skc5,skc6),u)
| in(skf2(u,skc5),skc6) ),
inference(spr,[status(thm),theory(equality)],[4284,83]),
[iquote('0:SpR:4284.0,83.1')] ).
cnf(4329,plain,
( subset(skc5,u)
| in(skf2(u,skc5),skc6) ),
inference(rew,[status(thm),theory(equality)],[4284,4288]),
[iquote('0:Rew:4284.0,4288.0')] ).
cnf(6034,plain,
( ~ in(skf2(set_intersection2(u,skc7),skc5),u)
| subset(skc5,set_intersection2(u,skc7))
| subset(v,set_intersection2(u,skc7)) ),
inference(res,[status(thm),theory(equality)],[1935,497]),
[iquote('0:Res:1935.1,497.0')] ).
cnf(6037,plain,
( ~ in(skf2(set_intersection2(u,skc7),skc5),u)
| subset(skc5,set_intersection2(u,skc7)) ),
inference(con,[status(thm)],[6034]),
[iquote('0:Con:6034.2')] ).
cnf(10761,plain,
( subset(skc5,set_intersection2(skc6,skc7))
| subset(skc5,set_intersection2(skc6,skc7)) ),
inference(res,[status(thm),theory(equality)],[4329,6037]),
[iquote('0:Res:4329.1,6037.0')] ).
cnf(10769,plain,
subset(skc5,set_intersection2(skc6,skc7)),
inference(obv,[status(thm),theory(equality)],[10761]),
[iquote('0:Obv:10761.0')] ).
cnf(10770,plain,
$false,
inference(mrr,[status(thm)],[10769,24]),
[iquote('0:MRR:10769.0,24.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU128+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 22:20:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.08/3.25
% 3.08/3.25 SPASS V 3.9
% 3.08/3.25 SPASS beiseite: Proof found.
% 3.08/3.25 % SZS status Theorem
% 3.08/3.25 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/3.25 SPASS derived 8983 clauses, backtracked 0 clauses, performed 0 splits and kept 2975 clauses.
% 3.08/3.25 SPASS allocated 104875 KBytes.
% 3.08/3.25 SPASS spent 0:00:02.86 on the problem.
% 3.08/3.25 0:00:00.03 for the input.
% 3.08/3.25 0:00:00.04 for the FLOTTER CNF translation.
% 3.08/3.25 0:00:00.09 for inferences.
% 3.08/3.25 0:00:00.00 for the backtracking.
% 3.08/3.25 0:00:02.65 for the reduction.
% 3.08/3.25
% 3.08/3.25
% 3.08/3.25 Here is a proof with depth 7, length 41 :
% 3.08/3.25 % SZS output start Refutation
% See solution above
% 3.08/3.25 Formulae used in the proof : t19_xboole_1 commutativity_k3_xboole_0 d3_tarski d3_xboole_0
% 3.08/3.25
%------------------------------------------------------------------------------