TSTP Solution File: SET947+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:30:00 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 3 unt; 2 nHn; 11 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
~ subset(skc3,powerset(union(skc3))),
file('SET947+1.p',unknown),
[] ).
cnf(6,axiom,
( subset(u,v)
| in(skf3(v,u),u) ),
file('SET947+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ in(u,v)
| subset(u,union(v)) ),
file('SET947+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ in(skf3(u,v),u)
| subset(w,u) ),
file('SET947+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ subset(u,v)
| ~ equal(w,powerset(v))
| in(u,w) ),
file('SET947+1.p',unknown),
[] ).
cnf(26,plain,
( ~ subset(u,v)
| in(u,powerset(v)) ),
inference(eqr,[status(thm),theory(equality)],[12]),
[iquote('0:EqR:12.1')] ).
cnf(30,plain,
( ~ subset(skf3(powerset(u),v),u)
| subset(w,powerset(u)) ),
inference(res,[status(thm),theory(equality)],[26,8]),
[iquote('0:Res:26.1,8.0')] ).
cnf(50,plain,
( ~ in(skf3(powerset(union(u)),v),u)
| subset(w,powerset(union(u))) ),
inference(res,[status(thm),theory(equality)],[7,30]),
[iquote('0:Res:7.1,30.0')] ).
cnf(71,plain,
( subset(u,powerset(union(u)))
| subset(v,powerset(union(u))) ),
inference(res,[status(thm),theory(equality)],[6,50]),
[iquote('0:Res:6.1,50.0')] ).
cnf(73,plain,
subset(u,powerset(union(u))),
inference(con,[status(thm)],[71]),
[iquote('0:Con:71.1')] ).
cnf(74,plain,
$false,
inference(unc,[status(thm)],[73,4]),
[iquote('0:UnC:73.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 01:22:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 54 clauses, backtracked 0 clauses, performed 0 splits and kept 57 clauses.
% 0.19/0.44 SPASS allocated 85193 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 4, length 11 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t100_zfmisc_1 d3_tarski l50_zfmisc_1 d1_zfmisc_1 reflexivity_r1_tarski
% 0.19/0.44
%------------------------------------------------------------------------------