TSTP Solution File: SET027+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET027+4 : TPTP v8.1.0. Released v2.2.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:22:50 EDT 2022
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 8 unt; 1 nHn; 13 RR)
% Number of literals : 19 ( 0 equ; 8 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
subset(skc5,skc3),
file('SET027+4.p',unknown),
[] ).
cnf(2,axiom,
subset(skc3,skc4),
file('SET027+4.p',unknown),
[] ).
cnf(3,axiom,
~ subset(skc5,skc4),
file('SET027+4.p',unknown),
[] ).
cnf(9,axiom,
( subset(u,v)
| member(skf3(v,u),u) ),
file('SET027+4.p',unknown),
[] ).
cnf(14,axiom,
( ~ member(skf3(u,v),u)
| subset(w,u) ),
file('SET027+4.p',unknown),
[] ).
cnf(25,axiom,
( ~ member(u,v)
| ~ subset(v,w)
| member(u,w) ),
file('SET027+4.p',unknown),
[] ).
cnf(34,plain,
( ~ member(u,skc3)
| member(u,skc4) ),
inference(res,[status(thm),theory(equality)],[2,25]),
[iquote('0:Res:2.0,25.0')] ).
cnf(38,plain,
( ~ member(u,skc5)
| member(u,skc3) ),
inference(res,[status(thm),theory(equality)],[1,25]),
[iquote('0:Res:1.0,25.0')] ).
cnf(41,plain,
member(skf3(skc4,skc5),skc5),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.1,3.0')] ).
cnf(43,plain,
~ member(skf3(skc4,u),skc4),
inference(res,[status(thm),theory(equality)],[14,3]),
[iquote('0:Res:14.1,3.0')] ).
cnf(50,plain,
member(skf3(skc4,skc5),skc3),
inference(res,[status(thm),theory(equality)],[41,38]),
[iquote('0:Res:41.0,38.0')] ).
cnf(55,plain,
~ member(skf3(skc4,u),skc3),
inference(res,[status(thm),theory(equality)],[34,43]),
[iquote('0:Res:34.1,43.0')] ).
cnf(56,plain,
$false,
inference(unc,[status(thm)],[55,50]),
[iquote('0:UnC:55.0,50.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 08:54:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 23 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.21/0.46 SPASS allocated 85419 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.21/0.46 0:00:00.03 for the input.
% 0.21/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.00 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 2, length 13 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : thI03 subset
% 0.21/0.46
%------------------------------------------------------------------------------