TSTP Solution File: SET631+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:27:41 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ intersect(skc3,skc4),
file('SET631+3.p',unknown),
[] ).
cnf(2,axiom,
intersect(skc3,difference(skc4,skc5)),
file('SET631+3.p',unknown),
[] ).
cnf(4,axiom,
( ~ member(u,difference(v,w))
| member(u,v) ),
file('SET631+3.p',unknown),
[] ).
cnf(5,axiom,
( ~ intersect(u,v)
| member(skf1(v,u),u) ),
file('SET631+3.p',unknown),
[] ).
cnf(6,axiom,
( ~ intersect(u,v)
| member(skf1(v,w),v) ),
file('SET631+3.p',unknown),
[] ).
cnf(8,axiom,
( ~ member(u,v)
| ~ member(u,w)
| intersect(w,v) ),
file('SET631+3.p',unknown),
[] ).
cnf(11,plain,
( ~ member(u,skc4)
| ~ member(u,skc3) ),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.2,1.0')] ).
cnf(17,plain,
( ~ intersect(skc3,u)
| ~ member(skf1(u,skc3),skc4) ),
inference(res,[status(thm),theory(equality)],[5,11]),
[iquote('0:Res:5.1,11.1')] ).
cnf(18,plain,
member(skf1(difference(skc4,skc5),u),difference(skc4,skc5)),
inference(res,[status(thm),theory(equality)],[2,6]),
[iquote('0:Res:2.0,6.0')] ).
cnf(23,plain,
member(skf1(difference(skc4,skc5),u),skc4),
inference(res,[status(thm),theory(equality)],[18,4]),
[iquote('0:Res:18.0,4.0')] ).
cnf(24,plain,
~ intersect(skc3,difference(skc4,skc5)),
inference(res,[status(thm),theory(equality)],[23,17]),
[iquote('0:Res:23.0,17.1')] ).
cnf(25,plain,
$false,
inference(mrr,[status(thm)],[24,2]),
[iquote('0:MRR:24.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 9 23:54:06 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 19 clauses.
% 0.21/0.44 SPASS allocated 85192 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.44 0:00:00.04 for the input.
% 0.21/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.00 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 3, length 12 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : prove_th113 difference_defn intersect_defn
% 0.21/0.44
%------------------------------------------------------------------------------