TSTP Solution File: SEU303+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.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:36:03 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc2),
file('SEU303+1.p',unknown),
[] ).
cnf(2,axiom,
function(skc2),
file('SEU303+1.p',unknown),
[] ).
cnf(5,axiom,
finite(relation_dom(skc2)),
file('SEU303+1.p',unknown),
[] ).
cnf(6,axiom,
~ finite(relation_rng(skc2)),
file('SEU303+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ relation(u)
| equal(relation_image(u,relation_dom(u)),relation_rng(u)) ),
file('SEU303+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ relation(u)
| ~ function(u)
| ~ finite(v)
| finite(relation_image(u,v)) ),
file('SEU303+1.p',unknown),
[] ).
cnf(10,plain,
( ~ finite(u)
| ~ relation(skc2)
| finite(relation_image(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,9]),
[iquote('0:Res:2.0,9.1')] ).
cnf(11,plain,
equal(relation_image(skc2,relation_dom(skc2)),relation_rng(skc2)),
inference(res,[status(thm),theory(equality)],[1,7]),
[iquote('0:Res:1.0,7.0')] ).
cnf(14,plain,
( ~ finite(u)
| finite(relation_image(skc2,u)) ),
inference(mrr,[status(thm)],[10,1]),
[iquote('0:MRR:10.1,1.0')] ).
cnf(17,plain,
( ~ finite(relation_dom(skc2))
| finite(relation_rng(skc2)) ),
inference(spr,[status(thm),theory(equality)],[11,14]),
[iquote('0:SpR:11.0,14.1')] ).
cnf(18,plain,
finite(relation_rng(skc2)),
inference(ssi,[status(thm)],[17,5]),
[iquote('0:SSi:17.0,5.0')] ).
cnf(19,plain,
$false,
inference(mrr,[status(thm)],[18,6]),
[iquote('0:MRR:18.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n017.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 : Sat Jun 18 18:46:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.43
% 0.20/0.43 SPASS V 3.9
% 0.20/0.43 SPASS beiseite: Proof found.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.20/0.43 SPASS allocated 97575 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.43 0:00:00.03 for the input.
% 0.20/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.43 0:00:00.00 for inferences.
% 0.20/0.43 0:00:00.00 for the backtracking.
% 0.20/0.43 0:00:00.00 for the reduction.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Here is a proof with depth 2, length 12 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : t26_finset_1 t146_relat_1 t17_finset_1
% 0.20/0.43
%------------------------------------------------------------------------------