%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET876+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:31 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 1 nHn; 8 RR)
% Number of literals : 12 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ equal(skc5,skc4),
file('SET876+1.p',unknown),
[] ).
cnf(4,axiom,
~ disjoint(singleton(skc4),singleton(skc5)),
file('SET876+1.p',unknown),
[] ).
cnf(5,axiom,
( in(u,v)
| disjoint(singleton(u),v) ),
file('SET876+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ in(u,v)
| ~ equal(v,singleton(w))
| equal(u,w) ),
file('SET876+1.p',unknown),
[] ).
cnf(13,plain,
( ~ equal(u,singleton(skc5))
| ~ in(skc4,u) ),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.2,3.0')] ).
cnf(14,plain,
in(skc4,singleton(skc5)),
inference(res,[status(thm),theory(equality)],[5,4]),
[iquote('0:Res:5.1,4.0')] ).
cnf(24,plain,
~ equal(singleton(skc5),singleton(skc5)),
inference(res,[status(thm),theory(equality)],[14,13]),
[iquote('0:Res:14.0,13.1')] ).
cnf(25,plain,
$false,
inference(obv,[status(thm),theory(equality)],[24]),
[iquote('0:Obv:24.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET876+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n029.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 : Mon Jul 11 09:07:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% 0.19/0.45 SPASS allocated 85165 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 2, length 8 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : t17_zfmisc_1 l28_zfmisc_1 d1_tarski antisymmetry_r2_hidden
% 0.19/0.45
%------------------------------------------------------------------------------