TSTP Solution File: SEU090+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:55 EDT 2022
% Result : Theorem 0.46s 0.65s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 19 RR)
% Number of literals : 38 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
finite(skc28),
file('SEU090+1.p',unknown),
[] ).
cnf(2,axiom,
finite(skc27),
file('SEU090+1.p',unknown),
[] ).
cnf(3,axiom,
finite(skc26),
file('SEU090+1.p',unknown),
[] ).
cnf(4,axiom,
finite(skc25),
file('SEU090+1.p',unknown),
[] ).
cnf(98,axiom,
subset(u,u),
file('SEU090+1.p',unknown),
[] ).
cnf(117,axiom,
~ finite(cartesian_product4(skc28,skc27,skc26,skc25)),
file('SEU090+1.p',unknown),
[] ).
cnf(126,axiom,
( ~ subset(u,v)
| element(u,powerset(v)) ),
file('SEU090+1.p',unknown),
[] ).
cnf(137,axiom,
( ~ finite(u)
| ~ element(v,powerset(u))
| finite(v) ),
file('SEU090+1.p',unknown),
[] ).
cnf(139,axiom,
( ~ finite(u)
| ~ finite(v)
| finite(cartesian_product2(v,u)) ),
file('SEU090+1.p',unknown),
[] ).
cnf(141,axiom,
equal(cartesian_product2(cartesian_product3(u,v,w),x),cartesian_product4(u,v,w,x)),
file('SEU090+1.p',unknown),
[] ).
cnf(146,axiom,
( ~ finite(u)
| ~ finite(v)
| ~ finite(w)
| finite(cartesian_product3(w,v,u)) ),
file('SEU090+1.p',unknown),
[] ).
cnf(161,plain,
( ~ finite(u)
| ~ finite(v)
| finite(cartesian_product3(v,u,skc26)) ),
inference(res,[status(thm),theory(equality)],[3,146]),
[iquote('0:Res:3.0,146.2')] ).
cnf(175,plain,
( ~ finite(u)
| ~ element(cartesian_product4(skc28,skc27,skc26,skc25),powerset(u)) ),
inference(res,[status(thm),theory(equality)],[137,117]),
[iquote('0:Res:137.2,117.0')] ).
cnf(524,plain,
( ~ finite(u)
| ~ finite(cartesian_product3(v,w,x))
| finite(cartesian_product4(v,w,x,u)) ),
inference(spr,[status(thm),theory(equality)],[141,139]),
[iquote('0:SpR:141.0,139.2')] ).
cnf(1134,plain,
( ~ finite(u)
| ~ subset(cartesian_product4(skc28,skc27,skc26,skc25),u) ),
inference(res,[status(thm),theory(equality)],[126,175]),
[iquote('0:Res:126.1,175.1')] ).
cnf(1211,plain,
( ~ finite(u)
| ~ finite(v)
| ~ finite(w)
| finite(cartesian_product4(v,w,skc26,u)) ),
inference(sor,[status(thm)],[524,161]),
[iquote('0:SoR:524.1,161.2')] ).
cnf(1379,plain,
~ finite(cartesian_product4(skc28,skc27,skc26,skc25)),
inference(res,[status(thm),theory(equality)],[98,1134]),
[iquote('0:Res:98.0,1134.1')] ).
cnf(1793,plain,
( ~ finite(skc27)
| ~ finite(skc28)
| ~ finite(skc25) ),
inference(sor,[status(thm)],[1379,1211]),
[iquote('0:SoR:1379.0,1211.3')] ).
cnf(1795,plain,
$false,
inference(ssi,[status(thm)],[1793,4,1,2]),
[iquote('0:SSi:1793.2,1793.1,1793.0,4.0,1.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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:11:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.46/0.65
% 0.46/0.65 SPASS V 3.9
% 0.46/0.65 SPASS beiseite: Proof found.
% 0.46/0.65 % SZS status Theorem
% 0.46/0.65 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.65 SPASS derived 1503 clauses, backtracked 0 clauses, performed 0 splits and kept 1031 clauses.
% 0.46/0.65 SPASS allocated 99130 KBytes.
% 0.46/0.65 SPASS spent 0:00:00.30 on the problem.
% 0.46/0.65 0:00:00.03 for the input.
% 0.46/0.65 0:00:00.02 for the FLOTTER CNF translation.
% 0.46/0.65 0:00:00.03 for inferences.
% 0.46/0.65 0:00:00.00 for the backtracking.
% 0.46/0.65 0:00:00.17 for the reduction.
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 Here is a proof with depth 4, length 19 :
% 0.46/0.65 % SZS output start Refutation
% See solution above
% 0.46/0.65 Formulae used in the proof : t21_finset_1 reflexivity_r1_tarski t3_subset cc2_finset_1 t19_finset_1 d4_zfmisc_1 t20_finset_1
% 0.46/0.65
%------------------------------------------------------------------------------