TSTP Solution File: SEU118+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:03 EDT 2022
% Result : Theorem 0.23s 0.51s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 11 unt; 0 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
finite(skc6),
file('SEU118+1.p',unknown),
[] ).
cnf(13,axiom,
cup_closed(finite_subsets(u)),
file('SEU118+1.p',unknown),
[] ).
cnf(14,axiom,
diff_closed(finite_subsets(u)),
file('SEU118+1.p',unknown),
[] ).
cnf(15,axiom,
preboolean(finite_subsets(u)),
file('SEU118+1.p',unknown),
[] ).
cnf(30,axiom,
element(skc7,powerset(skc6)),
file('SEU118+1.p',unknown),
[] ).
cnf(35,axiom,
~ element(skc7,finite_subsets(skc6)),
file('SEU118+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ in(u,v)
| element(u,v) ),
file('SEU118+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ element(u,powerset(v))
| subset(u,v) ),
file('SEU118+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ finite(u)
| ~ element(v,powerset(u))
| finite(v) ),
file('SEU118+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ preboolean(u)
| ~ finite(v)
| ~ subset(v,w)
| ~ equal(u,finite_subsets(w))
| in(v,u) ),
file('SEU118+1.p',unknown),
[] ).
cnf(73,plain,
( ~ finite(skc6)
| finite(skc7) ),
inference(res,[status(thm),theory(equality)],[30,60]),
[iquote('0:Res:30.0,60.1')] ).
cnf(76,plain,
subset(skc7,skc6),
inference(res,[status(thm),theory(equality)],[30,55]),
[iquote('0:Res:30.0,55.0')] ).
cnf(77,plain,
~ in(skc7,finite_subsets(skc6)),
inference(res,[status(thm),theory(equality)],[51,35]),
[iquote('0:Res:51.1,35.0')] ).
cnf(79,plain,
finite(skc7),
inference(mrr,[status(thm)],[73,1]),
[iquote('0:MRR:73.0,1.0')] ).
cnf(321,plain,
( ~ preboolean(finite_subsets(u))
| ~ finite(v)
| ~ subset(v,u)
| in(v,finite_subsets(u)) ),
inference(eqr,[status(thm),theory(equality)],[67]),
[iquote('0:EqR:67.3')] ).
cnf(322,plain,
( ~ finite(u)
| ~ subset(u,v)
| in(u,finite_subsets(v)) ),
inference(ssi,[status(thm)],[321,14,13,15]),
[iquote('0:SSi:321.0,14.0,13.0,15.0')] ).
cnf(588,plain,
( ~ finite(skc7)
| ~ subset(skc7,skc6) ),
inference(res,[status(thm),theory(equality)],[322,77]),
[iquote('0:Res:322.2,77.0')] ).
cnf(589,plain,
~ subset(skc7,skc6),
inference(ssi,[status(thm)],[588,79]),
[iquote('0:SSi:588.0,79.0')] ).
cnf(590,plain,
$false,
inference(mrr,[status(thm)],[589,76]),
[iquote('0:MRR:589.0,76.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 22:35:14 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.51
% 0.23/0.51 SPASS V 3.9
% 0.23/0.51 SPASS beiseite: Proof found.
% 0.23/0.51 % SZS status Theorem
% 0.23/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.51 SPASS derived 437 clauses, backtracked 16 clauses, performed 1 splits and kept 296 clauses.
% 0.23/0.51 SPASS allocated 98019 KBytes.
% 0.23/0.51 SPASS spent 0:00:00.13 on the problem.
% 0.23/0.51 0:00:00.03 for the input.
% 0.23/0.51 0:00:00.03 for the FLOTTER CNF translation.
% 0.23/0.51 0:00:00.01 for inferences.
% 0.23/0.51 0:00:00.00 for the backtracking.
% 0.23/0.51 0:00:00.03 for the reduction.
% 0.23/0.51
% 0.23/0.51
% 0.23/0.51 Here is a proof with depth 2, length 19 :
% 0.23/0.51 % SZS output start Refutation
% See solution above
% 0.23/0.51 Formulae used in the proof : t34_finsub_1 fc2_finsub_1 t1_subset t3_subset cc2_finset_1 d5_finsub_1
% 0.23/0.51
%------------------------------------------------------------------------------