%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET117-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:15 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(ordered_pair(first(x__dfg),second(x__dfg)),x__dfg),
file('SET117-6.p',unknown),
[] ).
cnf(2,axiom,
~ member(x__dfg,universal_class),
file('SET117-6.p',unknown),
[] ).
cnf(3,axiom,
( ~ member(u,v)
| ~ subclass(v,w)
| member(u,w) ),
file('SET117-6.p',unknown),
[] ).
cnf(6,axiom,
subclass(u,universal_class),
file('SET117-6.p',unknown),
[] ).
cnf(13,axiom,
member(unordered_pair(u,v),universal_class),
file('SET117-6.p',unknown),
[] ).
cnf(15,axiom,
equal(unordered_pair(singleton(u),unordered_pair(u,singleton(v))),ordered_pair(u,v)),
file('SET117-6.p',unknown),
[] ).
cnf(101,plain,
( ~ subclass(u,universal_class)
| ~ member(x__dfg,u) ),
inference(res,[status(thm),theory(equality)],[3,2]),
[iquote('0:Res:3.2,2.0')] ).
cnf(107,plain,
~ member(x__dfg,u),
inference(mrr,[status(thm)],[101,6]),
[iquote('0:MRR:101.0,6.0')] ).
cnf(224,plain,
member(ordered_pair(u,v),universal_class),
inference(spr,[status(thm),theory(equality)],[15,13]),
[iquote('0:SpR:15.0,13.0')] ).
cnf(232,plain,
member(x__dfg,universal_class),
inference(spr,[status(thm),theory(equality)],[1,224]),
[iquote('0:SpR:1.0,224.0')] ).
cnf(233,plain,
$false,
inference(mrr,[status(thm)],[232,107]),
[iquote('0:MRR:232.0,107.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET117-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 10:36:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 119 clauses, backtracked 0 clauses, performed 0 splits and kept 174 clauses.
% 0.20/0.46 SPASS allocated 75942 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.02 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 2, length 11 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : prove_corollary_1_to_ordered_pairs_are_sets_1 prove_corollary_1_to_ordered_pairs_are_sets_2 subclass_members class_elements_are_sets unordered_pairs_in_universal ordered_pair
% 0.20/0.46
%------------------------------------------------------------------------------