%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL846-1 : TPTP v9.3.1. Released v4.1.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 : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:08:35 PM UTC 2026
% Result : Unsatisfiable 0.77s 1.08s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1169,axiom,
equal(c_HOL_Ozero__class_Ozero(tc_nat),c_Orderings_Obot__class_Obot(tc_nat)),
file('LCL846-1.p',unknown),
[] ).
cnf(1191,axiom,
( ~ c_InductTermi_OIT(u)
| c_InductTermi_OIT(c_Lambda_Olift(u,v)) ),
file('LCL846-1.p',unknown),
[] ).
cnf(1193,axiom,
c_InductTermi_OIT(v_ta____),
file('LCL846-1.p',unknown),
[] ).
cnf(1230,axiom,
~ c_InductTermi_OIT(c_Lambda_Olift(v_ta____,c_HOL_Ozero__class_Ozero(tc_nat))),
file('LCL846-1.p',unknown),
[] ).
cnf(1233,plain,
~ c_InductTermi_OIT(c_Lambda_Olift(v_ta____,c_Orderings_Obot__class_Obot(tc_nat))),
inference(rew,[status(thm),theory(equality)],[1169,1230]),
[iquote('0:Rew:1169.0,1230.0')] ).
cnf(1398,plain,
~ c_InductTermi_OIT(v_ta____),
inference(res,[status(thm),theory(equality)],[1191,1233]),
[iquote('0:Res:1191.1,1233.0')] ).
cnf(1399,plain,
$false,
inference(mrr,[status(thm)],[1398,1193]),
[iquote('0:MRR:1398.0,1193.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL846-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.10/0.36 % Computer : n029.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 4 14:07:54 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.77/1.08
% 0.77/1.08 SPASS V 3.9
% 0.77/1.08 SPASS beiseite: Proof found.
% 0.77/1.08 % SZS status Theorem
% 0.77/1.08 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/1.08 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 1034 clauses.
% 0.77/1.08 SPASS allocated 77746 KBytes.
% 0.77/1.08 SPASS spent 0:00:00.67 on the problem.
% 0.77/1.08 0:00:00.13 for the input.
% 0.77/1.08 0:00:00.00 for the FLOTTER CNF translation.
% 0.77/1.08 0:00:00.00 for inferences.
% 0.77/1.08 0:00:00.00 for the backtracking.
% 0.77/1.08 0:00:00.36 for the reduction.
% 0.77/1.08
% 0.77/1.08
% 0.77/1.08 Here is a proof with depth 1, length 7 :
% 0.77/1.08 % SZS output start Refutation
% See solution above
% 0.77/1.08 Formulae used in the proof : cls_bot__nat__def_0 cls_lift__IT_0 cls_CHAINED_0 cls_conjecture_0
% 0.77/1.08
%------------------------------------------------------------------------------