TSTP Solution File: SET788+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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 05:28:41 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 10 unt; 6 nHn; 27 RR)
% Number of literals : 51 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( equalish(skc7,skc6)
| equalish(skc6,skc7) ),
file('SET788+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ equalish(skc7,skc6)
| ~ equalish(skc6,skc7) ),
file('SET788+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ equalish(u,v)
| ~ a_member_of(w,u)
| a_member_of(w,v) ),
file('SET788+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ equalish(u,v)
| ~ a_member_of(w,v)
| a_member_of(w,u) ),
file('SET788+1.p',unknown),
[] ).
cnf(5,axiom,
( equalish(u,v)
| a_member_of(skf1(v,u),v)
| a_member_of(skf1(v,u),u) ),
file('SET788+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ a_member_of(skf1(u,v),u)
| ~ a_member_of(skf1(u,v),v)
| equalish(v,u) ),
file('SET788+1.p',unknown),
[] ).
cnf(7,plain,
equalish(skc7,skc6),
inference(spt,[spt(split,[position(s1)])],[1]),
[iquote('1:Spt:1.0')] ).
cnf(8,plain,
~ equalish(skc6,skc7),
inference(mrr,[status(thm)],[2,7]),
[iquote('1:MRR:2.0,7.0')] ).
cnf(9,plain,
( ~ a_member_of(u,skc6)
| a_member_of(u,skc7) ),
inference(res,[status(thm),theory(equality)],[7,4]),
[iquote('1:Res:7.0,4.0')] ).
cnf(10,plain,
( ~ a_member_of(u,skc7)
| a_member_of(u,skc6) ),
inference(res,[status(thm),theory(equality)],[7,3]),
[iquote('1:Res:7.0,3.0')] ).
cnf(14,plain,
( equalish(skc6,u)
| a_member_of(skf1(u,skc6),u)
| a_member_of(skf1(u,skc6),skc7) ),
inference(res,[status(thm),theory(equality)],[5,9]),
[iquote('1:Res:5.2,9.0')] ).
cnf(28,plain,
( equalish(skc6,skc7)
| a_member_of(skf1(skc7,skc6),skc7) ),
inference(fac,[status(thm)],[14]),
[iquote('1:Fac:14.1,14.2')] ).
cnf(31,plain,
a_member_of(skf1(skc7,skc6),skc7),
inference(mrr,[status(thm)],[28,8]),
[iquote('1:MRR:28.0,8.0')] ).
cnf(34,plain,
( ~ a_member_of(skf1(skc7,skc6),skc6)
| equalish(skc6,skc7) ),
inference(res,[status(thm),theory(equality)],[31,6]),
[iquote('1:Res:31.0,6.0')] ).
cnf(35,plain,
~ a_member_of(skf1(skc7,skc6),skc6),
inference(mrr,[status(thm)],[34,8]),
[iquote('1:MRR:34.1,8.0')] ).
cnf(37,plain,
~ a_member_of(skf1(skc7,skc6),skc7),
inference(res,[status(thm),theory(equality)],[10,35]),
[iquote('1:Res:10.1,35.0')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[37,31]),
[iquote('1:MRR:37.0,31.0')] ).
cnf(40,plain,
~ equalish(skc7,skc6),
inference(spt,[spt(split,[position(sa)])],[39,7]),
[iquote('1:Spt:39.0,1.0,7.0')] ).
cnf(41,plain,
equalish(skc6,skc7),
inference(spt,[spt(split,[position(s2)])],[1]),
[iquote('1:Spt:39.0,1.1')] ).
cnf(42,plain,
( ~ a_member_of(u,skc6)
| a_member_of(u,skc7) ),
inference(res,[status(thm),theory(equality)],[41,3]),
[iquote('1:Res:41.0,3.0')] ).
cnf(43,plain,
( ~ a_member_of(u,skc7)
| a_member_of(u,skc6) ),
inference(res,[status(thm),theory(equality)],[41,4]),
[iquote('1:Res:41.0,4.0')] ).
cnf(44,plain,
( equalish(u,skc6)
| a_member_of(skf1(skc6,u),u)
| a_member_of(skf1(skc6,u),skc7) ),
inference(res,[status(thm),theory(equality)],[5,42]),
[iquote('1:Res:5.1,42.0')] ).
cnf(46,plain,
( ~ a_member_of(skf1(skc6,u),skc7)
| ~ a_member_of(skf1(skc6,u),u)
| equalish(u,skc6) ),
inference(res,[status(thm),theory(equality)],[43,6]),
[iquote('1:Res:43.1,6.0')] ).
cnf(48,plain,
( equalish(skc7,skc6)
| a_member_of(skf1(skc6,skc7),skc7) ),
inference(fac,[status(thm)],[44]),
[iquote('1:Fac:44.1,44.2')] ).
cnf(51,plain,
a_member_of(skf1(skc6,skc7),skc7),
inference(mrr,[status(thm)],[48,40]),
[iquote('1:MRR:48.0,40.0')] ).
cnf(60,plain,
( ~ a_member_of(skf1(skc6,skc7),skc7)
| equalish(skc7,skc6) ),
inference(res,[status(thm),theory(equality)],[51,46]),
[iquote('1:Res:51.0,46.0')] ).
cnf(61,plain,
$false,
inference(mrr,[status(thm)],[60,51,40]),
[iquote('1:MRR:60.0,60.1,51.0,40.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n008.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 : Mon Jul 11 06:42:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 38 clauses, backtracked 3 clauses, performed 1 splits and kept 28 clauses.
% 0.19/0.43 SPASS allocated 85164 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.03 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 6, length 27 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : prove_this
% 0.19/0.43
%------------------------------------------------------------------------------