TSTP Solution File: NUM393+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 8 unt; 3 nHn; 18 RR)
% Number of literals : 35 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 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('NUM393+1.p',unknown),
[] ).
cnf(2,axiom,
ordinal(skc13),
file('NUM393+1.p',unknown),
[] ).
cnf(36,axiom,
~ inclusion_comparable(skc13,skc14),
file('NUM393+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ subset(u,v)
| inclusion_comparable(u,v) ),
file('NUM393+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ subset(u,v)
| inclusion_comparable(v,u) ),
file('NUM393+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| ordinal_subset(u,v)
| ordinal_subset(v,u) ),
file('NUM393+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| ~ ordinal_subset(v,u)
| subset(v,u) ),
file('NUM393+1.p',unknown),
[] ).
cnf(63,plain,
( ~ ordinal(u)
| ~ ordinal_subset(skc13,u)
| subset(skc13,u) ),
inference(res,[status(thm),theory(equality)],[2,60]),
[iquote('0:Res:2.0,60.0')] ).
cnf(65,plain,
( ~ ordinal(u)
| ordinal_subset(u,skc13)
| ordinal_subset(skc13,u) ),
inference(res,[status(thm),theory(equality)],[2,57]),
[iquote('0:Res:2.0,57.0')] ).
cnf(69,plain,
( ~ ordinal(u)
| ~ ordinal_subset(u,skc13)
| subset(u,skc13) ),
inference(res,[status(thm),theory(equality)],[2,60]),
[iquote('0:Res:2.0,60.1')] ).
cnf(81,plain,
~ subset(skc13,skc14),
inference(res,[status(thm),theory(equality)],[44,36]),
[iquote('0:Res:44.1,36.0')] ).
cnf(82,plain,
~ subset(skc14,skc13),
inference(res,[status(thm),theory(equality)],[45,36]),
[iquote('0:Res:45.1,36.0')] ).
cnf(89,plain,
( ~ ordinal_subset(skc14,skc13)
| subset(skc14,skc13) ),
inference(res,[status(thm),theory(equality)],[1,69]),
[iquote('0:Res:1.0,69.0')] ).
cnf(91,plain,
( ~ ordinal_subset(skc13,skc14)
| subset(skc13,skc14) ),
inference(res,[status(thm),theory(equality)],[1,63]),
[iquote('0:Res:1.0,63.0')] ).
cnf(93,plain,
( ordinal_subset(skc13,skc14)
| ordinal_subset(skc14,skc13) ),
inference(res,[status(thm),theory(equality)],[1,65]),
[iquote('0:Res:1.0,65.0')] ).
cnf(106,plain,
~ ordinal_subset(skc14,skc13),
inference(mrr,[status(thm)],[89,82]),
[iquote('0:MRR:89.1,82.0')] ).
cnf(107,plain,
ordinal_subset(skc13,skc14),
inference(mrr,[status(thm)],[93,106]),
[iquote('0:MRR:93.1,106.0')] ).
cnf(108,plain,
$false,
inference(mrr,[status(thm)],[91,107,81]),
[iquote('0:MRR:91.0,91.1,107.0,81.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.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 : Wed Jul 6 00:23:00 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/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 42 clauses, backtracked 0 clauses, performed 0 splits and kept 81 clauses.
% 0.19/0.44 SPASS allocated 97706 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 2, length 18 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t25_ordinal1 d9_xboole_0 connectedness_r1_ordinal1 redefinition_r1_ordinal1
% 0.19/0.44
%------------------------------------------------------------------------------