TSTP Solution File: SEU272+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU272+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:35:44 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 7 unt; 6 nHn; 30 RR)
% Number of literals : 70 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ordinal(skc6),
file('SEU272+1.p',unknown),
[] ).
cnf(23,axiom,
( ordinal(skf3(u))
| in(skf3(u),u) ),
file('SEU272+1.p',unknown),
[] ).
cnf(25,axiom,
( in(skf3(u),u)
| in(skf3(u),skc7) ),
file('SEU272+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ equal(skf7(u),skf7(u))
| skP0(u) ),
file('SEU272+1.p',unknown),
[] ).
cnf(29,axiom,
( in(skf3(u),u)
| in(skf3(u),succ(skc6)) ),
file('SEU272+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ skP0(u)
| ~ ordinal(v)
| ~ in(w,skf6(u,v))
| ordinal(w) ),
file('SEU272+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ skP0(u)
| ~ ordinal(v)
| ~ in(w,skf6(u,v))
| in(w,u) ),
file('SEU272+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ skP0(u)
| ~ ordinal(v)
| ~ in(w,skf6(u,v))
| in(w,succ(v)) ),
file('SEU272+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ ordinal(u)
| ~ in(u,v)
| ~ in(u,succ(w))
| in(u,skf6(v,w)) ),
file('SEU272+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ ordinal(skf3(u))
| ~ in(skf3(u),u)
| ~ in(skf3(u),skc7)
| ~ in(skf3(u),succ(skc6)) ),
file('SEU272+1.p',unknown),
[] ).
cnf(35,plain,
skP0(u),
inference(obv,[status(thm),theory(equality)],[28]),
[iquote('0:Obv:28.0')] ).
cnf(36,plain,
( ~ ordinal(u)
| ~ in(v,skf6(w,u))
| ordinal(v) ),
inference(mrr,[status(thm)],[30,35]),
[iquote('0:MRR:30.0,35.0')] ).
cnf(37,plain,
( ~ ordinal(u)
| ~ in(v,skf6(w,u))
| in(v,w) ),
inference(mrr,[status(thm)],[31,35]),
[iquote('0:MRR:31.0,35.0')] ).
cnf(38,plain,
( ~ ordinal(u)
| ~ in(v,skf6(w,u))
| in(v,succ(u)) ),
inference(mrr,[status(thm)],[32,35]),
[iquote('0:MRR:32.0,35.0')] ).
cnf(40,plain,
( ~ in(u,skf6(v,skc6))
| in(u,succ(skc6)) ),
inference(res,[status(thm),theory(equality)],[1,38]),
[iquote('0:Res:1.0,38.0')] ).
cnf(41,plain,
( ~ in(u,skf6(v,skc6))
| in(u,v) ),
inference(res,[status(thm),theory(equality)],[1,37]),
[iquote('0:Res:1.0,37.0')] ).
cnf(42,plain,
( ~ in(u,skf6(v,skc6))
| ordinal(u) ),
inference(res,[status(thm),theory(equality)],[1,36]),
[iquote('0:Res:1.0,36.0')] ).
cnf(78,plain,
( ordinal(skf3(skf6(u,skc6)))
| ordinal(skf3(skf6(u,skc6))) ),
inference(res,[status(thm),theory(equality)],[23,42]),
[iquote('0:Res:23.1,42.0')] ).
cnf(79,plain,
ordinal(skf3(skf6(u,skc6))),
inference(obv,[status(thm),theory(equality)],[78]),
[iquote('0:Obv:78.0')] ).
cnf(98,plain,
( in(skf3(skf6(u,skc6)),skc7)
| in(skf3(skf6(u,skc6)),u) ),
inference(res,[status(thm),theory(equality)],[25,41]),
[iquote('0:Res:25.0,41.0')] ).
cnf(105,plain,
( in(skf3(skf6(u,skc6)),succ(skc6))
| in(skf3(skf6(u,skc6)),succ(skc6)) ),
inference(res,[status(thm),theory(equality)],[29,40]),
[iquote('0:Res:29.0,40.0')] ).
cnf(108,plain,
in(skf3(skf6(u,skc6)),succ(skc6)),
inference(obv,[status(thm),theory(equality)],[105]),
[iquote('0:Obv:105.0')] ).
cnf(114,plain,
in(skf3(skf6(skc7,skc6)),skc7),
inference(fac,[status(thm)],[98]),
[iquote('0:Fac:98.0,98.1')] ).
cnf(143,plain,
( ~ ordinal(skf3(skf6(u,skc6)))
| ~ in(skf3(skf6(u,skc6)),skf6(u,skc6))
| ~ in(skf3(skf6(u,skc6)),skc7) ),
inference(res,[status(thm),theory(equality)],[108,34]),
[iquote('0:Res:108.0,34.3')] ).
cnf(147,plain,
( ~ in(skf3(skf6(u,skc6)),skf6(u,skc6))
| ~ in(skf3(skf6(u,skc6)),skc7) ),
inference(mrr,[status(thm)],[143,79]),
[iquote('0:MRR:143.0,79.0')] ).
cnf(206,plain,
( ~ ordinal(skf3(skf6(u,skc6)))
| ~ in(skf3(skf6(u,skc6)),u)
| ~ in(skf3(skf6(u,skc6)),succ(skc6))
| ~ in(skf3(skf6(u,skc6)),skc7) ),
inference(res,[status(thm),theory(equality)],[33,147]),
[iquote('0:Res:33.3,147.0')] ).
cnf(207,plain,
( ~ in(skf3(skf6(u,skc6)),u)
| ~ in(skf3(skf6(u,skc6)),succ(skc6))
| ~ in(skf3(skf6(u,skc6)),skc7) ),
inference(ssi,[status(thm)],[206,79]),
[iquote('0:SSi:206.0,79.0')] ).
cnf(208,plain,
( ~ in(skf3(skf6(u,skc6)),u)
| ~ in(skf3(skf6(u,skc6)),skc7) ),
inference(mrr,[status(thm)],[207,108]),
[iquote('0:MRR:207.1,108.0')] ).
cnf(209,plain,
~ in(skf3(skf6(skc7,skc6)),skc7),
inference(res,[status(thm),theory(equality)],[114,208]),
[iquote('0:Res:114.0,208.0')] ).
cnf(219,plain,
$false,
inference(mrr,[status(thm)],[209,114]),
[iquote('0:MRR:209.0,114.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU272+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n005.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 : Mon Jun 20 05:43:53 EDT 2022
% 0.13/0.34 % 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 140 clauses, backtracked 0 clauses, performed 0 splits and kept 113 clauses.
% 0.20/0.46 SPASS allocated 97898 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.04 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.01 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 5, length 30 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : s1_xboole_0__e8_6__wellord2__1 s1_tarski__e8_6__wellord2__1 rc3_ordinal1 cc1_ordinal1 cc2_ordinal1
% 0.20/0.46
%------------------------------------------------------------------------------