TSTP Solution File: SET027+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:48 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% 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(3,axiom,
subclass(skc7,skc5),
file('SET027+1.p',unknown),
[] ).
cnf(4,axiom,
subclass(skc5,skc6),
file('SET027+1.p',unknown),
[] ).
cnf(7,axiom,
~ subclass(skc7,skc6),
file('SET027+1.p',unknown),
[] ).
cnf(24,axiom,
( subclass(u,v)
| member(skf5(v,u),u) ),
file('SET027+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ member(skf5(u,v),u)
| subclass(w,u) ),
file('SET027+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ member(u,v)
| ~ subclass(v,w)
| member(u,w) ),
file('SET027+1.p',unknown),
[] ).
cnf(94,plain,
( ~ member(u,skc5)
| member(u,skc6) ),
inference(res,[status(thm),theory(equality)],[4,56]),
[iquote('0:Res:4.0,56.0')] ).
cnf(98,plain,
( ~ member(u,skc7)
| member(u,skc5) ),
inference(res,[status(thm),theory(equality)],[3,56]),
[iquote('0:Res:3.0,56.0')] ).
cnf(102,plain,
member(skf5(skc6,skc7),skc7),
inference(res,[status(thm),theory(equality)],[24,7]),
[iquote('0:Res:24.1,7.0')] ).
cnf(104,plain,
~ member(skf5(skc6,u),skc6),
inference(res,[status(thm),theory(equality)],[38,7]),
[iquote('0:Res:38.1,7.0')] ).
cnf(109,plain,
member(skf5(skc6,skc7),skc5),
inference(res,[status(thm),theory(equality)],[102,98]),
[iquote('0:Res:102.0,98.0')] ).
cnf(112,plain,
~ member(skf5(skc6,u),skc5),
inference(res,[status(thm),theory(equality)],[94,104]),
[iquote('0:Res:94.1,104.0')] ).
cnf(113,plain,
$false,
inference(unc,[status(thm)],[112,109]),
[iquote('0:UnC:112.0,109.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n025.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 : Sun Jul 10 20:16:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 106 clauses.
% 0.19/0.48 SPASS allocated 98321 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.48 0:00:00.04 for the input.
% 0.19/0.48 0:00:00.06 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.00 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 2, length 13 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : transitivity subclass_defn
% 0.19/0.48
%------------------------------------------------------------------------------