%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SCT088-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 22:13:24 EDT 2022
% Result : Unsatisfiable 0.10s 0.39s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 1 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(607,axiom,
( equal(u,v)
| c_List_Odistinct(c_List_Olist_OCons(u,c_List_Olist_OCons(v,c_List_Olist_OCons(v_sko__CHAINED__1(u,v),c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt) ),
file('SCT088-1.p',unknown),
[] ).
cnf(609,axiom,
~ equal(v_d____,v_c____),
file('SCT088-1.p',unknown),
[] ).
cnf(673,axiom,
~ v_thesis____,
file('SCT088-1.p',unknown),
[] ).
cnf(674,axiom,
( ~ c_List_Odistinct(c_List_Olist_OCons(v_c____,c_List_Olist_OCons(v_d____,c_List_Olist_OCons(u,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
| v_thesis____ ),
file('SCT088-1.p',unknown),
[] ).
cnf(688,plain,
~ c_List_Odistinct(c_List_Olist_OCons(v_c____,c_List_Olist_OCons(v_d____,c_List_Olist_OCons(u,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),
inference(mrr,[status(thm)],[674,673]),
[iquote('0:MRR:674.1,673.0')] ).
cnf(736,plain,
equal(v_d____,v_c____),
inference(res,[status(thm),theory(equality)],[607,688]),
[iquote('0:Res:607.0,688.0')] ).
cnf(738,plain,
$false,
inference(mrr,[status(thm)],[736,609]),
[iquote('0:MRR:736.0,609.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : SCT088-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.07 % Command : run_spass %d %s
% 0.07/0.26 % Computer : n018.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Fri Jul 1 22:19:33 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.39
% 0.10/0.39 SPASS V 3.9
% 0.10/0.39 SPASS beiseite: Proof found.
% 0.10/0.39 % SZS status Theorem
% 0.10/0.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.39 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 549 clauses.
% 0.10/0.39 SPASS allocated 76698 KBytes.
% 0.10/0.39 SPASS spent 0:00:00.12 on the problem.
% 0.10/0.39 0:00:00.03 for the input.
% 0.10/0.39 0:00:00.00 for the FLOTTER CNF translation.
% 0.10/0.39 0:00:00.00 for inferences.
% 0.10/0.39 0:00:00.00 for the backtracking.
% 0.10/0.39 0:00:00.05 for the reduction.
% 0.10/0.39
% 0.10/0.39
% 0.10/0.39 Here is a proof with depth 1, length 7 :
% 0.10/0.39 % SZS output start Refutation
% See solution above
% 0.10/0.39 Formulae used in the proof : cls_CHAINED_0 cls_CHAINED_0_02 cls_conjecture_0 cls_conjecture_1
% 0.10/0.39
%------------------------------------------------------------------------------