TSTP Solution File: SET078-6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET078-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:23:40 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ member(singleton(y__dfg),unordered_pair(x__dfg,singleton(y__dfg))),
file('SET078-6.p',unknown),
[] ).
cnf(11,axiom,
( ~ member(u,universal_class)
| member(u,unordered_pair(v,u)) ),
file('SET078-6.p',unknown),
[] ).
cnf(12,axiom,
member(unordered_pair(u,v),universal_class),
file('SET078-6.p',unknown),
[] ).
cnf(13,axiom,
equal(unordered_pair(u,u),singleton(u)),
file('SET078-6.p',unknown),
[] ).
cnf(100,plain,
~ member(singleton(y__dfg),universal_class),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.1,1.0')] ).
cnf(105,plain,
member(singleton(u),universal_class),
inference(spr,[status(thm),theory(equality)],[13,12]),
[iquote('0:SpR:13.0,12.0')] ).
cnf(107,plain,
$false,
inference(unc,[status(thm)],[105,100]),
[iquote('0:UnC:105.0,100.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET078-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n013.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 22:28:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 94 clauses.
% 0.19/0.42 SPASS allocated 75741 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.04 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 1, length 7 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : prove_corollary_1_to_singletons_are_sets_1 unordered_pair3 unordered_pairs_in_universal singleton_set
% 0.19/0.42
%------------------------------------------------------------------------------