TSTP Solution File: SET926+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET926+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:29:52 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 1 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 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(4,axiom,
~ equal(set_difference(singleton(skc4),skc5),empty_set),
file('SET926+1.p',unknown),
[] ).
cnf(5,axiom,
~ equal(set_difference(singleton(skc4),skc5),singleton(skc4)),
file('SET926+1.p',unknown),
[] ).
cnf(7,axiom,
( in(u,v)
| equal(set_difference(singleton(u),v),singleton(u)) ),
file('SET926+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ in(u,v)
| equal(set_difference(singleton(u),v),empty_set) ),
file('SET926+1.p',unknown),
[] ).
cnf(14,plain,
~ in(skc4,skc5),
inference(res,[status(thm),theory(equality)],[9,4]),
[iquote('0:Res:9.1,4.0')] ).
cnf(15,plain,
in(skc4,skc5),
inference(res,[status(thm),theory(equality)],[7,5]),
[iquote('0:Res:7.1,5.0')] ).
cnf(16,plain,
$false,
inference(mrr,[status(thm)],[14,15]),
[iquote('0:MRR:14.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET926+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 09:51:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.19/0.43 SPASS allocated 85069 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.43 0:00:00.04 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 1, length 7 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : t69_zfmisc_1 l34_zfmisc_1 l36_zfmisc_1
% 0.19/0.43
%------------------------------------------------------------------------------