TSTP Solution File: SEU152+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU152+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:25 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 3 nHn; 16 RR)
% Number of literals : 28 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
in(skc4,skc5),
file('SEU152+2.p',unknown),
[] ).
cnf(21,axiom,
~ equal(set_union2(singleton(skc4),skc5),skc5),
file('SEU152+2.p',unknown),
[] ).
cnf(23,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU152+2.p',unknown),
[] ).
cnf(74,axiom,
( ~ in(u,v)
| ~ equal(v,singleton(w))
| equal(u,w) ),
file('SEU152+2.p',unknown),
[] ).
cnf(108,axiom,
( ~ in(skf15(u,v,w),w)
| ~ in(skf15(u,v,w),v)
| equal(w,set_union2(v,u)) ),
file('SEU152+2.p',unknown),
[] ).
cnf(110,axiom,
( equal(u,set_union2(v,w))
| in(skf15(w,v,u),w)
| in(skf15(w,v,u),v)
| in(skf15(w,v,u),u) ),
file('SEU152+2.p',unknown),
[] ).
cnf(114,plain,
~ equal(set_union2(skc5,singleton(skc4)),skc5),
inference(rew,[status(thm),theory(equality)],[23,21]),
[iquote('0:Rew:23.0,21.0')] ).
cnf(165,plain,
( in(skf15(singleton(skc4),skc5,skc5),skc5)
| in(skf15(singleton(skc4),skc5,skc5),skc5)
| in(skf15(singleton(skc4),skc5,skc5),singleton(skc4)) ),
inference(res,[status(thm),theory(equality)],[110,114]),
[iquote('0:Res:110.3,114.0')] ).
cnf(166,plain,
( ~ in(skf15(singleton(skc4),skc5,skc5),skc5)
| ~ in(skf15(singleton(skc4),skc5,skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[108,114]),
[iquote('0:Res:108.2,114.0')] ).
cnf(168,plain,
~ in(skf15(singleton(skc4),skc5,skc5),skc5),
inference(obv,[status(thm),theory(equality)],[166]),
[iquote('0:Obv:166.0')] ).
cnf(170,plain,
( in(skf15(singleton(skc4),skc5,skc5),skc5)
| in(skf15(singleton(skc4),skc5,skc5),singleton(skc4)) ),
inference(obv,[status(thm),theory(equality)],[165]),
[iquote('0:Obv:165.0')] ).
cnf(171,plain,
in(skf15(singleton(skc4),skc5,skc5),singleton(skc4)),
inference(mrr,[status(thm)],[170,168]),
[iquote('0:MRR:170.0,168.0')] ).
cnf(1111,plain,
( ~ in(u,singleton(v))
| equal(u,v) ),
inference(eqr,[status(thm),theory(equality)],[74]),
[iquote('0:EqR:74.1')] ).
cnf(1120,plain,
equal(skf15(singleton(skc4),skc5,skc5),skc4),
inference(res,[status(thm),theory(equality)],[171,1111]),
[iquote('0:Res:171.0,1111.0')] ).
cnf(1124,plain,
~ in(skc4,skc5),
inference(rew,[status(thm),theory(equality)],[1120,168]),
[iquote('0:Rew:1120.0,168.0')] ).
cnf(1126,plain,
$false,
inference(mrr,[status(thm)],[1124,3]),
[iquote('0:MRR:1124.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU152+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 14:16:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.57
% 0.19/0.57 SPASS V 3.9
% 0.19/0.57 SPASS beiseite: Proof found.
% 0.19/0.57 % SZS status Theorem
% 0.19/0.57 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 SPASS derived 875 clauses, backtracked 0 clauses, performed 0 splits and kept 318 clauses.
% 0.19/0.57 SPASS allocated 99255 KBytes.
% 0.19/0.57 SPASS spent 0:00:00.22 on the problem.
% 0.19/0.57 0:00:00.03 for the input.
% 0.19/0.57 0:00:00.12 for the FLOTTER CNF translation.
% 0.19/0.57 0:00:00.01 for inferences.
% 0.19/0.57 0:00:00.00 for the backtracking.
% 0.19/0.57 0:00:00.03 for the reduction.
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 Here is a proof with depth 2, length 16 :
% 0.19/0.57 % SZS output start Refutation
% See solution above
% 0.19/0.57 Formulae used in the proof : l23_zfmisc_1 commutativity_k2_xboole_0 d1_tarski d2_xboole_0
% 0.19/0.57
%------------------------------------------------------------------------------