TSTP Solution File: NUM394+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:51 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 15 unt; 3 nHn; 25 RR)
% Number of literals : 44 ( 0 equ; 23 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ordinal(skc14),
file('NUM394+1.p',unknown),
[] ).
cnf(2,axiom,
ordinal(skc13),
file('NUM394+1.p',unknown),
[] ).
cnf(35,axiom,
~ ordinal_subset(skc13,skc14),
file('NUM394+1.p',unknown),
[] ).
cnf(36,axiom,
~ in(skc14,skc13),
file('NUM394+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ ordinal(u)
| epsilon_transitive(u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ ordinal(u)
| epsilon_connected(u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ ordinal(u)
| ordinal_subset(u,u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ epsilon_transitive(u)
| ~ in(v,u)
| subset(v,u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| ~ subset(v,u)
| ordinal_subset(v,u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| in(u,v)
| equal(v,u)
| in(v,u) ),
file('NUM394+1.p',unknown),
[] ).
cnf(67,plain,
ordinal_subset(skc13,skc13),
inference(res,[status(thm),theory(equality)],[2,43]),
[iquote('0:Res:2.0,43.0')] ).
cnf(79,plain,
epsilon_transitive(skc14),
inference(res,[status(thm),theory(equality)],[1,39]),
[iquote('0:Res:1.0,39.0')] ).
cnf(80,plain,
epsilon_connected(skc14),
inference(res,[status(thm),theory(equality)],[1,40]),
[iquote('0:Res:1.0,40.0')] ).
cnf(85,plain,
( ~ ordinal(skc13)
| ~ ordinal(skc14)
| in(skc13,skc14)
| equal(skc14,skc13) ),
inference(res,[status(thm),theory(equality)],[61,36]),
[iquote('0:Res:61.4,36.0')] ).
cnf(88,plain,
( ~ ordinal(skc13)
| ~ ordinal(skc14)
| ~ subset(skc13,skc14) ),
inference(res,[status(thm),theory(equality)],[60,35]),
[iquote('0:Res:60.3,35.0')] ).
cnf(92,plain,
~ subset(skc13,skc14),
inference(mrr,[status(thm)],[88,2,1]),
[iquote('0:MRR:88.0,88.1,2.0,1.0')] ).
cnf(93,plain,
( equal(skc14,skc13)
| in(skc13,skc14) ),
inference(mrr,[status(thm)],[85,2,1]),
[iquote('0:MRR:85.0,85.1,2.0,1.0')] ).
cnf(127,plain,
equal(skc14,skc13),
inference(spt,[spt(split,[position(s1)])],[93]),
[iquote('1:Spt:93.0')] ).
cnf(141,plain,
~ ordinal_subset(skc13,skc13),
inference(rew,[status(thm),theory(equality)],[127,35]),
[iquote('1:Rew:127.0,35.0')] ).
cnf(145,plain,
$false,
inference(mrr,[status(thm)],[141,67]),
[iquote('1:MRR:141.0,67.0')] ).
cnf(152,plain,
~ equal(skc14,skc13),
inference(spt,[spt(split,[position(sa)])],[145,127]),
[iquote('1:Spt:145.0,93.0,127.0')] ).
cnf(153,plain,
in(skc13,skc14),
inference(spt,[spt(split,[position(s2)])],[93]),
[iquote('1:Spt:145.0,93.1')] ).
cnf(183,plain,
( ~ epsilon_transitive(skc14)
| ~ in(skc13,skc14) ),
inference(res,[status(thm),theory(equality)],[54,92]),
[iquote('0:Res:54.2,92.0')] ).
cnf(184,plain,
~ in(skc13,skc14),
inference(ssi,[status(thm)],[183,1,79,80]),
[iquote('0:SSi:183.0,1.0,79.0,80.0')] ).
cnf(185,plain,
$false,
inference(mrr,[status(thm)],[184,153]),
[iquote('1:MRR:184.0,153.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 17:01:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 105 clauses, backtracked 18 clauses, performed 1 splits and kept 117 clauses.
% 0.20/0.42 SPASS allocated 97798 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.42 0:00:00.02 for the input.
% 0.20/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 2, length 25 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : t26_ordinal1 cc1_ordinal1 reflexivity_r1_ordinal1 d2_ordinal1 redefinition_r1_ordinal1 t24_ordinal1
% 0.20/0.42
%------------------------------------------------------------------------------