TSTP Solution File: NUM414+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM414+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:57 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 10 unt; 4 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 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(skc17),
file('NUM414+1.p',unknown),
[] ).
cnf(2,axiom,
ordinal(skc16),
file('NUM414+1.p',unknown),
[] ).
cnf(57,axiom,
~ proper_subset(skc16,skc17),
file('NUM414+1.p',unknown),
[] ).
cnf(58,axiom,
~ equal(skc17,skc16),
file('NUM414+1.p',unknown),
[] ).
cnf(59,axiom,
~ proper_subset(skc17,skc16),
file('NUM414+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ subset(u,v)
| proper_subset(u,v)
| equal(u,v) ),
file('NUM414+1.p',unknown),
[] ).
cnf(84,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| ordinal_subset(u,v)
| ordinal_subset(v,u) ),
file('NUM414+1.p',unknown),
[] ).
cnf(87,axiom,
( ~ ordinal(u)
| ~ ordinal(v)
| ~ ordinal_subset(v,u)
| subset(v,u) ),
file('NUM414+1.p',unknown),
[] ).
cnf(90,plain,
( ~ ordinal(u)
| ~ ordinal_subset(skc16,u)
| subset(skc16,u) ),
inference(res,[status(thm),theory(equality)],[2,87]),
[iquote('0:Res:2.0,87.0')] ).
cnf(92,plain,
( ~ ordinal(u)
| ordinal_subset(u,skc16)
| ordinal_subset(skc16,u) ),
inference(res,[status(thm),theory(equality)],[2,84]),
[iquote('0:Res:2.0,84.0')] ).
cnf(96,plain,
( ~ ordinal(u)
| ~ ordinal_subset(u,skc16)
| subset(u,skc16) ),
inference(res,[status(thm),theory(equality)],[2,87]),
[iquote('0:Res:2.0,87.1')] ).
cnf(108,plain,
( ~ subset(skc17,skc16)
| equal(skc17,skc16) ),
inference(res,[status(thm),theory(equality)],[82,59]),
[iquote('0:Res:82.2,59.0')] ).
cnf(111,plain,
( ~ subset(skc16,skc17)
| proper_subset(skc16,skc17) ),
inference(res,[status(thm),theory(equality)],[82,58]),
[iquote('0:Res:82.1,58.0')] ).
cnf(114,plain,
~ subset(skc17,skc16),
inference(mrr,[status(thm)],[108,58]),
[iquote('0:MRR:108.1,58.0')] ).
cnf(115,plain,
~ subset(skc16,skc17),
inference(mrr,[status(thm)],[111,57]),
[iquote('0:MRR:111.1,57.0')] ).
cnf(121,plain,
( ~ ordinal_subset(skc17,skc16)
| subset(skc17,skc16) ),
inference(res,[status(thm),theory(equality)],[1,96]),
[iquote('0:Res:1.0,96.0')] ).
cnf(123,plain,
( ~ ordinal_subset(skc16,skc17)
| subset(skc16,skc17) ),
inference(res,[status(thm),theory(equality)],[1,90]),
[iquote('0:Res:1.0,90.0')] ).
cnf(125,plain,
( ordinal_subset(skc16,skc17)
| ordinal_subset(skc17,skc16) ),
inference(res,[status(thm),theory(equality)],[1,92]),
[iquote('0:Res:1.0,92.0')] ).
cnf(138,plain,
~ ordinal_subset(skc17,skc16),
inference(mrr,[status(thm)],[121,114]),
[iquote('0:MRR:121.1,114.0')] ).
cnf(139,plain,
ordinal_subset(skc16,skc17),
inference(mrr,[status(thm)],[125,138]),
[iquote('0:MRR:125.1,138.0')] ).
cnf(140,plain,
$false,
inference(mrr,[status(thm)],[123,139,115]),
[iquote('0:MRR:123.0,123.1,139.0,115.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM414+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n029.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 18:51:27 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 45 clauses, backtracked 0 clauses, performed 0 splits and kept 105 clauses.
% 0.20/0.46 SPASS allocated 97720 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 2, length 21 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : t50_ordinal1 d8_xboole_0 connectedness_r1_ordinal1 redefinition_r1_ordinal1
% 0.20/0.46
%------------------------------------------------------------------------------