TSTP Solution File: SEU083+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU083+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:33:53 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
finite(skc24),
file('SEU083+1.p',unknown),
[] ).
cnf(2,axiom,
finite(skc23),
file('SEU083+1.p',unknown),
[] ).
cnf(99,axiom,
~ finite(set_union2(skc24,skc23)),
file('SEU083+1.p',unknown),
[] ).
cnf(122,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU083+1.p',unknown),
[] ).
cnf(141,axiom,
( ~ finite(u)
| ~ finite(v)
| finite(set_union2(v,u)) ),
file('SEU083+1.p',unknown),
[] ).
cnf(145,plain,
~ finite(set_union2(skc23,skc24)),
inference(rew,[status(thm),theory(equality)],[122,99]),
[iquote('0:Rew:122.0,99.0')] ).
cnf(155,plain,
( ~ finite(skc23)
| ~ finite(skc24) ),
inference(res,[status(thm),theory(equality)],[141,145]),
[iquote('0:Res:141.2,145.0')] ).
cnf(157,plain,
$false,
inference(mrr,[status(thm)],[155,2,1]),
[iquote('0:MRR:155.0,155.1,2.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU083+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 08:30:08 EDT 2022
% 0.12/0.33 % 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 10 clauses, backtracked 0 clauses, performed 0 splits and kept 136 clauses.
% 0.19/0.44 SPASS allocated 97806 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 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 1, length 8 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t14_finset_1 commutativity_k2_xboole_0 l3_finset_1
% 0.19/0.44
%------------------------------------------------------------------------------