TSTP Solution File: SET152-6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET152-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:24:33 EDT 2022
% Result : Unsatisfiable 0.70s 0.88s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 4 unt; 3 nHn; 11 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(complement(universal_class),null_class),
file('SET152-6.p',unknown),
[] ).
cnf(2,axiom,
( ~ member(u,v)
| ~ subclass(v,w)
| member(u,w) ),
file('SET152-6.p',unknown),
[] ).
cnf(5,axiom,
subclass(u,universal_class),
file('SET152-6.p',unknown),
[] ).
cnf(25,axiom,
( ~ member(u,v)
| ~ member(u,complement(v)) ),
file('SET152-6.p',unknown),
[] ).
cnf(67,axiom,
( equal(u,null_class)
| member(regular(u),u) ),
file('SET152-6.p',unknown),
[] ).
cnf(161,plain,
( ~ member(regular(complement(u)),u)
| equal(complement(u),null_class) ),
inference(res,[status(thm),theory(equality)],[67,25]),
[iquote('0:Res:67.1,25.1')] ).
cnf(351,plain,
( ~ subclass(u,v)
| equal(u,null_class)
| member(regular(u),v) ),
inference(res,[status(thm),theory(equality)],[67,2]),
[iquote('0:Res:67.1,2.0')] ).
cnf(2354,plain,
( ~ subclass(complement(u),u)
| equal(complement(u),null_class)
| equal(complement(u),null_class) ),
inference(res,[status(thm),theory(equality)],[351,161]),
[iquote('0:Res:351.2,161.0')] ).
cnf(2369,plain,
( ~ subclass(complement(u),u)
| equal(complement(u),null_class) ),
inference(obv,[status(thm),theory(equality)],[2354]),
[iquote('0:Obv:2354.1')] ).
cnf(2526,plain,
equal(complement(universal_class),null_class),
inference(res,[status(thm),theory(equality)],[5,2369]),
[iquote('0:Res:5.0,2369.0')] ).
cnf(2529,plain,
$false,
inference(mrr,[status(thm)],[2526,1]),
[iquote('0:MRR:2526.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET152-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 05:28:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/0.88
% 0.70/0.88 SPASS V 3.9
% 0.70/0.88 SPASS beiseite: Proof found.
% 0.70/0.88 % SZS status Theorem
% 0.70/0.88 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.70/0.88 SPASS derived 2171 clauses, backtracked 293 clauses, performed 4 splits and kept 1559 clauses.
% 0.70/0.88 SPASS allocated 78037 KBytes.
% 0.70/0.88 SPASS spent 0:00:00.51 on the problem.
% 0.70/0.88 0:00:00.04 for the input.
% 0.70/0.88 0:00:00.00 for the FLOTTER CNF translation.
% 0.70/0.88 0:00:00.03 for inferences.
% 0.70/0.88 0:00:00.01 for the backtracking.
% 0.70/0.88 0:00:00.39 for the reduction.
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 Here is a proof with depth 3, length 11 :
% 0.70/0.88 % SZS output start Refutation
% See solution above
% 0.70/0.88 Formulae used in the proof : prove_complement_of_universal_class_1 subclass_members class_elements_are_sets complement1 regularity1
% 0.70/0.88
%------------------------------------------------------------------------------