TSTP Solution File: SEU137+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:14 EDT 2022
% Result : Theorem 0.37s 0.54s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 6 unt; 5 nHn; 20 RR)
% Number of literals : 44 ( 0 equ; 21 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 : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(skc4,skc5),
file('SEU137+1.p',unknown),
[] ).
cnf(15,axiom,
~ equal(set_union2(skc4,set_difference(skc5,skc4)),skc5),
file('SEU137+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU137+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ in(u,v)
| ~ equal(v,set_difference(w,x))
| in(u,w) ),
file('SEU137+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ in(u,v)
| ~ equal(w,set_difference(v,x))
| in(u,w)
| in(u,x) ),
file('SEU137+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ in(skf4(u,v,w),w)
| ~ in(skf4(u,v,w),v)
| equal(w,set_union2(v,u)) ),
file('SEU137+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ in(skf4(u,v,w),w)
| ~ in(skf4(u,v,w),u)
| equal(w,set_union2(v,u)) ),
file('SEU137+1.p',unknown),
[] ).
cnf(33,axiom,
( equal(u,set_union2(v,w))
| in(skf4(w,v,u),w)
| in(skf4(w,v,u),v)
| in(skf4(w,v,u),u) ),
file('SEU137+1.p',unknown),
[] ).
cnf(35,plain,
( ~ in(u,skc4)
| in(u,skc5) ),
inference(res,[status(thm),theory(equality)],[3,20]),
[iquote('0:Res:3.0,20.0')] ).
cnf(42,plain,
( in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5)
| in(skf4(set_difference(skc5,skc4),skc4,skc5),skc4)
| in(skf4(set_difference(skc5,skc4),skc4,skc5),set_difference(skc5,skc4)) ),
inference(res,[status(thm),theory(equality)],[33,15]),
[iquote('0:Res:33.3,15.0')] ).
cnf(43,plain,
( ~ in(skf4(set_difference(skc5,skc4),skc4,skc5),skc4)
| ~ in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[31,15]),
[iquote('0:Res:31.2,15.0')] ).
cnf(44,plain,
( ~ in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5)
| ~ in(skf4(set_difference(skc5,skc4),skc4,skc5),set_difference(skc5,skc4)) ),
inference(res,[status(thm),theory(equality)],[32,15]),
[iquote('0:Res:32.2,15.0')] ).
cnf(45,plain,
~ in(skf4(set_difference(skc5,skc4),skc4,skc5),skc4),
inference(mrr,[status(thm)],[43,35]),
[iquote('0:MRR:43.1,35.1')] ).
cnf(46,plain,
( in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5)
| in(skf4(set_difference(skc5,skc4),skc4,skc5),set_difference(skc5,skc4)) ),
inference(mrr,[status(thm)],[42,45]),
[iquote('0:MRR:42.1,45.0')] ).
cnf(106,plain,
( ~ in(u,set_difference(v,w))
| in(u,v) ),
inference(eqr,[status(thm),theory(equality)],[23]),
[iquote('0:EqR:23.1')] ).
cnf(109,plain,
in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5),
inference(mrr,[status(thm)],[46,106]),
[iquote('0:MRR:46.1,106.0')] ).
cnf(110,plain,
~ in(skf4(set_difference(skc5,skc4),skc4,skc5),set_difference(skc5,skc4)),
inference(mrr,[status(thm)],[44,106]),
[iquote('0:MRR:44.0,106.1')] ).
cnf(229,plain,
( ~ in(u,v)
| in(u,set_difference(v,w))
| in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[28]),
[iquote('0:EqR:28.1')] ).
cnf(701,plain,
( ~ in(skf4(set_difference(skc5,skc4),skc4,skc5),skc5)
| in(skf4(set_difference(skc5,skc4),skc4,skc5),skc4) ),
inference(res,[status(thm),theory(equality)],[229,110]),
[iquote('0:Res:229.1,110.0')] ).
cnf(707,plain,
$false,
inference(mrr,[status(thm)],[701,109,45]),
[iquote('0:MRR:701.0,701.1,109.0,45.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n004.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 : Sun Jun 19 22:32:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.37/0.54
% 0.37/0.54 SPASS V 3.9
% 0.37/0.54 SPASS beiseite: Proof found.
% 0.37/0.54 % SZS status Theorem
% 0.37/0.54 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.54 SPASS derived 602 clauses, backtracked 0 clauses, performed 0 splits and kept 359 clauses.
% 0.37/0.54 SPASS allocated 98403 KBytes.
% 0.37/0.54 SPASS spent 0:00:00.18 on the problem.
% 0.37/0.54 0:00:00.03 for the input.
% 0.37/0.54 0:00:00.06 for the FLOTTER CNF translation.
% 0.37/0.54 0:00:00.01 for inferences.
% 0.37/0.54 0:00:00.00 for the backtracking.
% 0.37/0.54 0:00:00.05 for the reduction.
% 0.37/0.54
% 0.37/0.54
% 0.37/0.54 Here is a proof with depth 2, length 20 :
% 0.37/0.54 % SZS output start Refutation
% See solution above
% 0.37/0.54 Formulae used in the proof : t45_xboole_1 d3_tarski d4_xboole_0 d2_xboole_0
% 0.37/0.54
%------------------------------------------------------------------------------