TSTP Solution File: SET653+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET653+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:52 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 16 RR)
% Number of literals : 36 ( 0 equ; 24 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
subset(skc4,skc5),
file('SET653+3.p',unknown),
[] ).
cnf(5,axiom,
ilf_type(u,set_type),
file('SET653+3.p',unknown),
[] ).
cnf(10,axiom,
ilf_type(skc7,relation_type(skc4,skc6)),
file('SET653+3.p',unknown),
[] ).
cnf(13,axiom,
~ ilf_type(skc7,relation_type(skc5,skc6)),
file('SET653+3.p',unknown),
[] ).
cnf(32,axiom,
( ~ ilf_type(u,set_type)
| ~ ilf_type(v,set_type)
| ~ ilf_type(w,relation_type(u,v))
| subset(domain_of(w),u) ),
file('SET653+3.p',unknown),
[] ).
cnf(44,axiom,
( ~ ilf_type(u,set_type)
| ~ ilf_type(v,set_type)
| ~ ilf_type(w,set_type)
| ~ subset(v,w)
| ~ subset(u,v)
| subset(u,w) ),
file('SET653+3.p',unknown),
[] ).
cnf(46,axiom,
( ~ ilf_type(u,set_type)
| ~ ilf_type(v,set_type)
| ~ ilf_type(w,set_type)
| ~ ilf_type(x,relation_type(u,w))
| ~ subset(domain_of(x),v)
| ilf_type(x,relation_type(v,w)) ),
file('SET653+3.p',unknown),
[] ).
cnf(66,plain,
( ~ ilf_type(u,relation_type(v,w))
| subset(domain_of(u),v) ),
inference(mrr,[status(thm)],[32,5]),
[iquote('0:MRR:32.0,32.1,5.0,5.0')] ).
cnf(72,plain,
( ~ subset(u,v)
| ~ subset(v,w)
| subset(u,w) ),
inference(mrr,[status(thm)],[44,5]),
[iquote('0:MRR:44.0,44.1,44.2,5.0,5.0,5.0')] ).
cnf(74,plain,
( ~ ilf_type(u,relation_type(v,w))
| ~ subset(domain_of(u),x)
| ilf_type(u,relation_type(x,w)) ),
inference(mrr,[status(thm)],[46,5]),
[iquote('0:MRR:46.0,46.1,46.2,5.0,5.0,5.0')] ).
cnf(76,plain,
( ~ subset(u,skc4)
| subset(u,skc5) ),
inference(res,[status(thm),theory(equality)],[4,72]),
[iquote('0:Res:4.0,72.0')] ).
cnf(80,plain,
subset(domain_of(skc7),skc4),
inference(res,[status(thm),theory(equality)],[10,66]),
[iquote('0:Res:10.0,66.0')] ).
cnf(83,plain,
( ~ ilf_type(skc7,relation_type(u,skc6))
| ~ subset(domain_of(skc7),skc5) ),
inference(res,[status(thm),theory(equality)],[74,13]),
[iquote('0:Res:74.2,13.0')] ).
cnf(84,plain,
~ subset(domain_of(skc7),skc5),
inference(res,[status(thm),theory(equality)],[10,83]),
[iquote('0:Res:10.0,83.0')] ).
cnf(88,plain,
~ subset(domain_of(skc7),skc4),
inference(res,[status(thm),theory(equality)],[76,84]),
[iquote('0:Res:76.1,84.0')] ).
cnf(89,plain,
$false,
inference(mrr,[status(thm)],[88,80]),
[iquote('0:MRR:88.0,80.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET653+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.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 : Sun Jul 10 23:26:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 43 clauses.
% 0.20/0.45 SPASS allocated 97805 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 3, length 16 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : prove_relset_1_15 p22 p2 p1 p3
% 0.20/0.45
%------------------------------------------------------------------------------