TSTP Solution File: LCL805-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL805-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n029.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 : 300s
% DateTime : Thu Aug 31 08:20:44 EDT 2023
% Result : Unsatisfiable 30.84s 4.35s
% Output : Proof 30.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL805-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.17/0.34 % Computer : n029.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Fri Aug 25 04:49:38 EDT 2023
% 0.17/0.34 % CPUTime :
% 30.84/4.35 Command-line arguments: --no-flatten-goal
% 30.84/4.35
% 30.84/4.35 % SZS status Unsatisfiable
% 30.84/4.35
% 30.84/4.35 % SZS output start Proof
% 30.84/4.35 Take the following subset of the input axioms:
% 30.84/4.35 fof(cls_conjecture_0, negated_conjecture, ~c_List_Olistsp(c_InductTermi_OIT, c_List_Omap(c_COMBC(c_Lambda_Olift, c_HOL_Ozero__class_Ozero(tc_nat), tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst, v_u____, tc_Lambda_OdB, tc_Lambda_OdB, tc_fun(tc_nat, tc_Lambda_OdB)), v_i____, tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB)).
% 30.84/4.35 fof(cls_listsp_ONil_0, axiom, ![T_a, V_A]: c_List_Olistsp(V_A, c_List_Olist_ONil(T_a), T_a)).
% 30.84/4.35 fof(cls_map__is__Nil__conv_1, axiom, ![T_b, V_f, T_a2]: c_List_Omap(V_f, c_List_Olist_ONil(T_b), T_b, T_a2)=c_List_Olist_ONil(T_a2)).
% 30.84/4.35
% 30.84/4.35 Now clausify the problem and encode Horn clauses using encoding 3 of
% 30.84/4.35 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 30.84/4.35 We repeatedly replace C & s=t => u=v by the two clauses:
% 30.84/4.35 fresh(y, y, x1...xn) = u
% 30.84/4.35 C => fresh(s, t, x1...xn) = v
% 30.84/4.35 where fresh is a fresh function symbol and x1..xn are the free
% 30.84/4.35 variables of u and v.
% 30.84/4.35 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 30.84/4.35 input problem has no model of domain size 1).
% 30.84/4.35
% 30.84/4.35 The encoding turns the above axioms into the following unit equations and goals:
% 30.84/4.35
% 30.84/4.35 Axiom 1 (cls_listsp_ONil_0): c_List_Olistsp(X, c_List_Olist_ONil(Y), Y) = true2.
% 30.84/4.35 Axiom 2 (cls_map__is__Nil__conv_1): c_List_Omap(X, c_List_Olist_ONil(Y), Y, Z) = c_List_Olist_ONil(Z).
% 30.84/4.35
% 30.84/4.35 Goal 1 (cls_conjecture_0): c_List_Olistsp(c_InductTermi_OIT, c_List_Omap(c_COMBC(c_Lambda_Olift, c_HOL_Ozero__class_Ozero(tc_nat), tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst, v_u____, tc_Lambda_OdB, tc_Lambda_OdB, tc_fun(tc_nat, tc_Lambda_OdB)), v_i____, tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB) = true2.
% 30.84/4.35 Proof:
% 30.84/4.35 c_List_Olistsp(c_InductTermi_OIT, c_List_Omap(c_COMBC(c_Lambda_Olift, c_HOL_Ozero__class_Ozero(tc_nat), tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst, v_u____, tc_Lambda_OdB, tc_Lambda_OdB, tc_fun(tc_nat, tc_Lambda_OdB)), v_i____, tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB)
% 30.84/4.35 = { by axiom 2 (cls_map__is__Nil__conv_1) }
% 30.84/4.35 c_List_Olistsp(c_InductTermi_OIT, c_List_Omap(c_COMBC(c_Lambda_Olift, c_HOL_Ozero__class_Ozero(tc_nat), tc_Lambda_OdB, tc_nat, tc_Lambda_OdB), c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB, tc_Lambda_OdB), tc_Lambda_OdB)
% 30.84/4.35 = { by axiom 2 (cls_map__is__Nil__conv_1) }
% 30.84/4.35 c_List_Olistsp(c_InductTermi_OIT, c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB)
% 30.84/4.35 = { by axiom 1 (cls_listsp_ONil_0) }
% 30.84/4.35 true2
% 30.84/4.35 % SZS output end Proof
% 30.84/4.35
% 30.84/4.35 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------