TSTP Solution File: SET798+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET798+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:44 EDT 2022
% Result : Theorem 0.46s 0.64s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 1 nHn; 14 RR)
% Number of literals : 22 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
subset(skc8,skc7),
file('SET798+4.p',unknown),
[] ).
cnf(5,axiom,
lower_bound(skc9,skc5,skc7),
file('SET798+4.p',unknown),
[] ).
cnf(7,axiom,
~ lower_bound(skc9,skc5,skc8),
file('SET798+4.p',unknown),
[] ).
cnf(41,axiom,
( member(skf31(u,v,w),u)
| lower_bound(x,y,u) ),
file('SET798+4.p',unknown),
[] ).
cnf(44,axiom,
( ~ member(u,v)
| ~ subset(v,w)
| member(u,w) ),
file('SET798+4.p',unknown),
[] ).
cnf(59,axiom,
( ~ apply(u,v,skf31(w,v,u))
| lower_bound(v,u,w) ),
file('SET798+4.p',unknown),
[] ).
cnf(62,axiom,
( ~ member(u,v)
| ~ lower_bound(w,x,v)
| apply(x,w,u) ),
file('SET798+4.p',unknown),
[] ).
cnf(108,plain,
( ~ member(u,skc8)
| member(u,skc7) ),
inference(res,[status(thm),theory(equality)],[2,44]),
[iquote('0:Res:2.0,44.0')] ).
cnf(118,plain,
( ~ member(u,skc7)
| apply(skc5,skc9,u) ),
inference(res,[status(thm),theory(equality)],[5,62]),
[iquote('0:Res:5.0,62.0')] ).
cnf(121,plain,
member(skf31(skc8,u,v),skc8),
inference(res,[status(thm),theory(equality)],[41,7]),
[iquote('0:Res:41.1,7.0')] ).
cnf(122,plain,
~ apply(skc5,skc9,skf31(skc8,skc9,skc5)),
inference(res,[status(thm),theory(equality)],[59,7]),
[iquote('0:Res:59.1,7.0')] ).
cnf(125,plain,
member(skf31(skc8,u,v),skc7),
inference(res,[status(thm),theory(equality)],[121,108]),
[iquote('0:Res:121.0,108.0')] ).
cnf(140,plain,
~ member(skf31(skc8,skc9,skc5),skc7),
inference(res,[status(thm),theory(equality)],[118,122]),
[iquote('0:Res:118.1,122.0')] ).
cnf(141,plain,
$false,
inference(mrr,[status(thm)],[140,125]),
[iquote('0:MRR:140.0,125.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET798+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 02:12:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/0.64
% 0.46/0.64 SPASS V 3.9
% 0.46/0.64 SPASS beiseite: Proof found.
% 0.46/0.64 % SZS status Theorem
% 0.46/0.64 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.64 SPASS derived 45 clauses, backtracked 0 clauses, performed 1 splits and kept 126 clauses.
% 0.46/0.64 SPASS allocated 88343 KBytes.
% 0.46/0.64 SPASS spent 0:00:00.29 on the problem.
% 0.46/0.64 0:00:00.03 for the input.
% 0.46/0.64 0:00:00.22 for the FLOTTER CNF translation.
% 0.46/0.64 0:00:00.00 for inferences.
% 0.46/0.64 0:00:00.00 for the backtracking.
% 0.46/0.64 0:00:00.00 for the reduction.
% 0.46/0.64
% 0.46/0.64
% 0.46/0.64 Here is a proof with depth 2, length 14 :
% 0.46/0.64 % SZS output start Refutation
% See solution above
% 0.46/0.64 Formulae used in the proof : thIV10 lower_bound subset
% 0.46/0.64
%------------------------------------------------------------------------------