TSTP Solution File: SEU155+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:26 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 4 unt; 2 nHn; 11 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 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(1,axiom,
in(skc2,skc3),
file('SEU155+1.p',unknown),
[] ).
cnf(3,axiom,
~ subset(skc2,union(skc3)),
file('SEU155+1.p',unknown),
[] ).
cnf(5,axiom,
( subset(u,v)
| in(skf4(v,u),u) ),
file('SEU155+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ in(skf4(u,v),u)
| subset(w,u) ),
file('SEU155+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(u,v)
| ~ in(w,u)
| ~ equal(x,union(v))
| in(w,x) ),
file('SEU155+1.p',unknown),
[] ).
cnf(21,plain,
( ~ in(u,skc2)
| ~ equal(v,union(skc3))
| in(u,v) ),
inference(res,[status(thm),theory(equality)],[1,11]),
[iquote('0:Res:1.0,11.1')] ).
cnf(44,plain,
( ~ in(u,skc2)
| in(u,union(skc3)) ),
inference(eqr,[status(thm),theory(equality)],[21]),
[iquote('0:EqR:21.1')] ).
cnf(48,plain,
( ~ in(skf4(union(skc3),u),skc2)
| subset(v,union(skc3)) ),
inference(res,[status(thm),theory(equality)],[44,6]),
[iquote('0:Res:44.1,6.0')] ).
cnf(71,plain,
( subset(skc2,union(skc3))
| subset(u,union(skc3)) ),
inference(res,[status(thm),theory(equality)],[5,48]),
[iquote('0:Res:5.1,48.0')] ).
cnf(72,plain,
subset(skc2,union(skc3)),
inference(con,[status(thm)],[71]),
[iquote('0:Con:71.1')] ).
cnf(73,plain,
$false,
inference(mrr,[status(thm)],[72,3]),
[iquote('0:MRR:72.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n005.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 : Mon Jun 20 11:56:08 EDT 2022
% 0.12/0.33 % 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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 53 clauses.
% 0.19/0.45 SPASS allocated 85533 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.03 for the input.
% 0.19/0.45 0:00:00.04 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 4, length 11 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : l50_zfmisc_1 d3_tarski d4_tarski
% 0.19/0.45
%------------------------------------------------------------------------------