TSTP Solution File: LCL825-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL825-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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 : Sun Jul 17 14:40:22 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 5 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(448,axiom,
c_List_Olistsp(u,c_List_Olist_ONil(v),v),
file('LCL825-1.p',unknown),
[] ).
cnf(452,axiom,
equal(c_List_Omap(u,c_List_Olist_ONil(v),v,w),c_List_Olist_ONil(w)),
file('LCL825-1.p',unknown),
[] ).
cnf(484,axiom,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(hAPP(c_COMBC(hAPP(c_COMBC(c_Lambda_Osubst,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_u____),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_i____),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
file('LCL825-1.p',unknown),
[] ).
cnf(513,plain,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),
inference(rew,[status(thm),theory(equality)],[452,484]),
[iquote('0:Rew:452.0,484.0')] ).
cnf(514,plain,
$false,
inference(mrr,[status(thm)],[513,448]),
[iquote('0:MRR:513.0,448.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL825-1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n004.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 : Sat Jul 2 21:44:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.52
% 0.20/0.52 SPASS V 3.9
% 0.20/0.52 SPASS beiseite: Proof found.
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 385 clauses.
% 0.20/0.52 SPASS allocated 76471 KBytes.
% 0.20/0.52 SPASS spent 0:00:00.16 on the problem.
% 0.20/0.52 0:00:00.05 for the input.
% 0.20/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.52 0:00:00.00 for inferences.
% 0.20/0.52 0:00:00.00 for the backtracking.
% 0.20/0.52 0:00:00.06 for the reduction.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Here is a proof with depth 0, length 5 :
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 Formulae used in the proof : cls_listsp_ONil_0 cls_Nil__is__map__conv_1 cls_conjecture_0
% 0.20/0.52
%------------------------------------------------------------------------------