TSTP Solution File: SEU294+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:35:56 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
finite(skc16),
file('SEU294+1.p',unknown),
[] ).
cnf(51,axiom,
subset(skc17,skc16),
file('SEU294+1.p',unknown),
[] ).
cnf(52,axiom,
~ finite(skc17),
file('SEU294+1.p',unknown),
[] ).
cnf(95,axiom,
( ~ subset(u,v)
| element(u,powerset(v)) ),
file('SEU294+1.p',unknown),
[] ).
cnf(101,axiom,
( ~ finite(u)
| ~ element(v,powerset(u))
| finite(v) ),
file('SEU294+1.p',unknown),
[] ).
cnf(109,plain,
( ~ finite(u)
| ~ element(skc17,powerset(u)) ),
inference(res,[status(thm),theory(equality)],[101,52]),
[iquote('0:Res:101.2,52.0')] ).
cnf(110,plain,
element(skc17,powerset(skc16)),
inference(res,[status(thm),theory(equality)],[51,95]),
[iquote('0:Res:51.0,95.0')] ).
cnf(111,plain,
~ element(skc17,powerset(skc16)),
inference(res,[status(thm),theory(equality)],[1,109]),
[iquote('0:Res:1.0,109.0')] ).
cnf(113,plain,
$false,
inference(mrr,[status(thm)],[111,110]),
[iquote('0:MRR:111.0,110.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 04:55:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 101 clauses.
% 0.20/0.44 SPASS allocated 97746 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 2, length 9 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : t13_finset_1 t3_subset cc2_finset_1
% 0.20/0.44
%------------------------------------------------------------------------------