TSTP Solution File: SET024-7 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET024-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:46 EDT 2022
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(31,axiom,
member(x__dfg,universal_class),
file('SET024-7.p',unknown),
[] ).
cnf(32,axiom,
~ member(x__dfg,singleton(x__dfg)),
file('SET024-7.p',unknown),
[] ).
cnf(41,axiom,
( ~ member(u,universal_class)
| member(u,unordered_pair(u,v)) ),
file('SET024-7.p',unknown),
[] ).
cnf(44,axiom,
equal(unordered_pair(u,u),singleton(u)),
file('SET024-7.p',unknown),
[] ).
cnf(134,plain,
member(x__dfg,unordered_pair(x__dfg,u)),
inference(res,[status(thm),theory(equality)],[31,41]),
[iquote('0:Res:31.0,41.0')] ).
cnf(206,plain,
member(x__dfg,singleton(x__dfg)),
inference(spr,[status(thm),theory(equality)],[44,134]),
[iquote('0:SpR:44.0,134.0')] ).
cnf(207,plain,
$false,
inference(mrr,[status(thm)],[206,32]),
[iquote('0:MRR:206.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET024-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 08:07:58 EDT 2022
% 0.13/0.34 % 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 62 clauses, backtracked 24 clauses, performed 1 splits and kept 194 clauses.
% 0.20/0.45 SPASS allocated 75825 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.00 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.01 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 7 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : prove_set_in_its_singleton_1 prove_set_in_its_singleton_2 unordered_pair2 singleton_set
% 0.20/0.45
%------------------------------------------------------------------------------