%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:23 EDT 2022
% Result : Theorem 0.22s 0.46s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ equal(skc6,skc5),
file('SEU150+3.p',unknown),
[] ).
cnf(4,axiom,
equal(unordered_pair(skc5,skc6),singleton(skc7)),
file('SEU150+3.p',unknown),
[] ).
cnf(5,axiom,
equal(unordered_pair(u,v),unordered_pair(v,u)),
file('SEU150+3.p',unknown),
[] ).
cnf(6,axiom,
( ~ equal(singleton(u),unordered_pair(v,w))
| equal(u,v) ),
file('SEU150+3.p',unknown),
[] ).
cnf(8,plain,
~ equal(unordered_pair(skc6,u),singleton(skc5)),
inference(res,[status(thm),theory(equality)],[6,3]),
[iquote('0:Res:6.1,3.0')] ).
cnf(9,plain,
equal(skc7,skc5),
inference(res,[status(thm),theory(equality)],[4,6]),
[iquote('0:Res:4.0,6.0')] ).
cnf(10,plain,
equal(unordered_pair(skc5,skc6),singleton(skc5)),
inference(rew,[status(thm),theory(equality)],[9,4]),
[iquote('0:Rew:9.0,4.0')] ).
cnf(18,plain,
~ equal(unordered_pair(u,skc6),singleton(skc5)),
inference(spl,[status(thm),theory(equality)],[5,8]),
[iquote('0:SpL:5.0,8.0')] ).
cnf(22,plain,
$false,
inference(unc,[status(thm)],[18,10]),
[iquote('0:UnC:18.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.15 % Command : run_spass %d %s
% 0.16/0.36 % Computer : n012.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Sun Jun 19 15:26:53 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.22/0.46
% 0.22/0.46 SPASS V 3.9
% 0.22/0.46 SPASS beiseite: Proof found.
% 0.22/0.46 % SZS status Theorem
% 0.22/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.46 SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.22/0.46 SPASS allocated 85065 KBytes.
% 0.22/0.46 SPASS spent 0:00:00.08 on the problem.
% 0.22/0.46 0:00:00.03 for the input.
% 0.22/0.46 0:00:00.02 for the FLOTTER CNF translation.
% 0.22/0.46 0:00:00.00 for inferences.
% 0.22/0.46 0:00:00.00 for the backtracking.
% 0.22/0.46 0:00:00.00 for the reduction.
% 0.22/0.46
% 0.22/0.46
% 0.22/0.46 Here is a proof with depth 2, length 9 :
% 0.22/0.46 % SZS output start Refutation
% See solution above
% 0.22/0.46 Formulae used in the proof : t9_zfmisc_1 commutativity_k2_tarski t8_zfmisc_1
% 0.22/0.46
%------------------------------------------------------------------------------