%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.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 14:34:18 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 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(6,axiom,
equal(singleton(skc3),empty_set),
file('SEU143+2.p',unknown),
[] ).
cnf(9,axiom,
equal(set_intersection2(u,u),u),
file('SEU143+2.p',unknown),
[] ).
cnf(34,axiom,
( ~ in(u,v)
| ~ equal(v,empty_set) ),
file('SEU143+2.p',unknown),
[] ).
cnf(65,axiom,
( ~ equal(u,v)
| ~ equal(w,singleton(v))
| in(u,w) ),
file('SEU143+2.p',unknown),
[] ).
cnf(99,plain,
~ in(u,singleton(skc3)),
inference(res,[status(thm),theory(equality)],[6,34]),
[iquote('0:Res:6.0,34.0')] ).
cnf(110,plain,
( ~ equal(u,skc3)
| in(u,empty_set) ),
inference(res,[status(thm),theory(equality)],[6,65]),
[iquote('0:Res:6.0,65.1')] ).
cnf(112,plain,
~ in(u,empty_set),
inference(rew,[status(thm),theory(equality)],[6,99]),
[iquote('0:Rew:6.0,99.0')] ).
cnf(115,plain,
~ equal(u,skc3),
inference(mrr,[status(thm)],[110,112]),
[iquote('0:MRR:110.1,112.0')] ).
cnf(116,plain,
$false,
inference(unc,[status(thm)],[115,9]),
[iquote('0:UnC:115.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n014.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 Jun 20 13:52:32 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51
% 0.21/0.51 SPASS V 3.9
% 0.21/0.51 SPASS beiseite: Proof found.
% 0.21/0.51 % SZS status Theorem
% 0.21/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.51 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 93 clauses.
% 0.21/0.51 SPASS allocated 98842 KBytes.
% 0.21/0.51 SPASS spent 0:00:00.15 on the problem.
% 0.21/0.51 0:00:00.04 for the input.
% 0.21/0.51 0:00:00.09 for the FLOTTER CNF translation.
% 0.21/0.51 0:00:00.00 for inferences.
% 0.21/0.51 0:00:00.00 for the backtracking.
% 0.21/0.51 0:00:00.00 for the reduction.
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 Here is a proof with depth 1, length 9 :
% 0.21/0.51 % SZS output start Refutation
% See solution above
% 0.21/0.51 Formulae used in the proof : l1_zfmisc_1 idempotence_k3_xboole_0 d1_xboole_0 d1_tarski
% 0.21/0.51
%------------------------------------------------------------------------------