TSTP Solution File: NUM410+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM410+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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 : Mon Jul 18 14:25:56 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 23 ( 0 equ; 14 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc15),
file('NUM410+1.p',unknown),
[] ).
cnf(2,axiom,
function(skc15),
file('NUM410+1.p',unknown),
[] ).
cnf(53,axiom,
ordinal(relation_dom(skc15)),
file('NUM410+1.p',unknown),
[] ).
cnf(57,axiom,
subset(u,u),
file('NUM410+1.p',unknown),
[] ).
cnf(60,axiom,
~ transfinite_sequence_of(skc15,relation_rng(skc15)),
file('NUM410+1.p',unknown),
[] ).
cnf(88,axiom,
( ~ function(u)
| ~ relation(u)
| ~ ordinal(relation_dom(u))
| transfinite_sequence(u) ),
file('NUM410+1.p',unknown),
[] ).
cnf(93,axiom,
( ~ relation(u)
| ~ function(u)
| ~ transfinite_sequence(u)
| ~ subset(relation_rng(u),v)
| transfinite_sequence_of(u,v) ),
file('NUM410+1.p',unknown),
[] ).
cnf(106,plain,
( ~ relation(skc15)
| ~ function(skc15)
| transfinite_sequence(skc15) ),
inference(res,[status(thm),theory(equality)],[53,88]),
[iquote('0:Res:53.0,88.2')] ).
cnf(109,plain,
( ~ transfinite_sequence(skc15)
| ~ function(skc15)
| ~ relation(skc15)
| ~ subset(relation_rng(skc15),relation_rng(skc15)) ),
inference(res,[status(thm),theory(equality)],[93,60]),
[iquote('0:Res:93.4,60.0')] ).
cnf(110,plain,
transfinite_sequence(skc15),
inference(mrr,[status(thm)],[106,1,2]),
[iquote('0:MRR:106.0,106.1,1.0,2.0')] ).
cnf(113,plain,
$false,
inference(mrr,[status(thm)],[109,110,2,1,57]),
[iquote('0:MRR:109.0,109.1,109.2,109.3,110.0,2.0,1.0,57.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM410+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 5 15:08:55 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 95 clauses.
% 0.20/0.45 SPASS allocated 97730 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 1, length 11 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : t46_ordinal1 reflexivity_r1_tarski d7_ordinal1 d8_ordinal1
% 0.20/0.45
%------------------------------------------------------------------------------