TSTP Solution File: LAT260-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LAT260-1 : TPTP v8.1.2. Released v3.2.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 : n023.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 06:27:59 EDT 2023
% Result : Unsatisfiable 242.96s 31.44s
% Output : Proof 242.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LAT260-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34 % Computer : n023.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 : 300
% 0.13/0.34 % DateTime : Thu Aug 24 10:27:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 242.96/31.44 Command-line arguments: --no-flatten-goal
% 242.96/31.44
% 242.96/31.44 % SZS status Unsatisfiable
% 242.96/31.44
% 242.96/31.45 % SZS output start Proof
% 242.96/31.45 Take the following subset of the input axioms:
% 242.96/31.45 fof(cls_Tarski_Odual_Acl_A_58_APartialOrder_0, axiom, c_in(c_Tarski_Odual(v_cl, t_a), c_Tarski_OPartialOrder, tc_Tarski_Opotype_Opotype__ext__type(t_a, tc_Product__Type_Ounit))).
% 242.96/31.45 fof(cls_conjecture_1, negated_conjecture, ~c_in(c_Tarski_Odual(v_cl, t_a), c_Tarski_OPartialOrder, tc_Tarski_Opotype_Opotype__ext__type(t_a, tc_Product__Type_Ounit))).
% 242.96/31.45
% 242.96/31.45 Now clausify the problem and encode Horn clauses using encoding 3 of
% 242.96/31.45 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 242.96/31.45 We repeatedly replace C & s=t => u=v by the two clauses:
% 242.96/31.45 fresh(y, y, x1...xn) = u
% 242.96/31.45 C => fresh(s, t, x1...xn) = v
% 242.96/31.45 where fresh is a fresh function symbol and x1..xn are the free
% 242.96/31.45 variables of u and v.
% 242.96/31.45 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 242.96/31.45 input problem has no model of domain size 1).
% 242.96/31.45
% 242.96/31.45 The encoding turns the above axioms into the following unit equations and goals:
% 242.96/31.45
% 242.96/31.45 Axiom 1 (cls_Tarski_Odual_Acl_A_58_APartialOrder_0): c_in(c_Tarski_Odual(v_cl, t_a), c_Tarski_OPartialOrder, tc_Tarski_Opotype_Opotype__ext__type(t_a, tc_Product__Type_Ounit)) = true2.
% 242.96/31.45
% 242.96/31.45 Goal 1 (cls_conjecture_1): c_in(c_Tarski_Odual(v_cl, t_a), c_Tarski_OPartialOrder, tc_Tarski_Opotype_Opotype__ext__type(t_a, tc_Product__Type_Ounit)) = true2.
% 242.96/31.45 Proof:
% 242.96/31.45 c_in(c_Tarski_Odual(v_cl, t_a), c_Tarski_OPartialOrder, tc_Tarski_Opotype_Opotype__ext__type(t_a, tc_Product__Type_Ounit))
% 242.96/31.45 = { by axiom 1 (cls_Tarski_Odual_Acl_A_58_APartialOrder_0) }
% 242.96/31.45 true2
% 242.96/31.45 % SZS output end Proof
% 242.96/31.45
% 242.96/31.45 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------