%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM405+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:54 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 4 unt; 2 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 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(59,axiom,
( ~ ordinal(u)
| in(u,skc14) ),
file('NUM405+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ in(u,skf4(v))
| ordinal(u) ),
file('NUM405+1.p',unknown),
[] ).
cnf(63,axiom,
( ordinal(skf5(u))
| in(skf5(u),u) ),
file('NUM405+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ ordinal(skf5(u))
| ~ in(skf5(u),u) ),
file('NUM405+1.p',unknown),
[] ).
cnf(72,axiom,
( ~ ordinal(u)
| ~ in(u,v)
| in(u,skf4(v)) ),
file('NUM405+1.p',unknown),
[] ).
cnf(106,plain,
( ordinal(skf5(skf4(u)))
| ordinal(skf5(skf4(u))) ),
inference(res,[status(thm),theory(equality)],[63,61]),
[iquote('0:Res:63.1,61.0')] ).
cnf(107,plain,
ordinal(skf5(skf4(u))),
inference(obv,[status(thm),theory(equality)],[106]),
[iquote('0:Obv:106.0')] ).
cnf(146,plain,
( ~ ordinal(skf5(skf4(u)))
| ~ in(skf5(skf4(u)),u)
| ~ ordinal(skf5(skf4(u))) ),
inference(res,[status(thm),theory(equality)],[72,69]),
[iquote('0:Res:72.2,69.1')] ).
cnf(152,plain,
( ~ in(skf5(skf4(u)),u)
| ~ ordinal(skf5(skf4(u))) ),
inference(obv,[status(thm),theory(equality)],[146]),
[iquote('0:Obv:146.0')] ).
cnf(153,plain,
~ in(skf5(skf4(u)),u),
inference(mrr,[status(thm)],[152,107]),
[iquote('0:MRR:152.1,107.0')] ).
cnf(154,plain,
~ ordinal(skf5(skf4(skc14))),
inference(res,[status(thm),theory(equality)],[59,153]),
[iquote('0:Res:59.1,153.0')] ).
cnf(156,plain,
$false,
inference(ssi,[status(thm)],[154,107]),
[iquote('0:SSi:154.0,107.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM405+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n026.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 : Wed Jul 6 12:43:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 73 clauses, backtracked 0 clauses, performed 0 splits and kept 97 clauses.
% 0.20/0.44 SPASS allocated 97692 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 2, length 12 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : t38_ordinal1 s1_xboole_0__e2_43__ordinal1 t37_ordinal1
% 0.20/0.45
%------------------------------------------------------------------------------