TSTP Solution File: LAT275-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LAT275-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 : n017.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:28:04 EDT 2023

% Result   : Unsatisfiable 258.79s 33.71s
% Output   : Proof 258.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : LAT275-1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.09/0.30  % Computer : n017.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Thu Aug 24 06:55:39 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 258.79/33.71  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 258.79/33.71  
% 258.79/33.71  % SZS status Unsatisfiable
% 258.79/33.71  
% 258.79/33.72  % SZS output start Proof
% 258.79/33.72  Take the following subset of the input axioms:
% 258.79/33.72    fof(cls_Tarski_OA_A_61_61_Apset_Acl_0, axiom, v_A=c_Tarski_Opotype_Opset(v_cl, t_a, tc_Product__Type_Ounit)).
% 258.79/33.72    fof(cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0, axiom, ![V_S]: (~c_lessequals(V_S, v_A, tc_set(t_a)) | c_in(c_Tarski_Olub(V_S, v_cl, t_a), v_A, t_a))).
% 258.79/33.72    fof(cls_conjecture_0, negated_conjecture, c_lessequals(v_S, v_A, tc_set(t_a))).
% 258.79/33.72    fof(cls_conjecture_2, negated_conjecture, ~c_in(c_Tarski_Olub(v_S, v_cl, t_a), c_Tarski_Opotype_Opset(v_cl, t_a, tc_Product__Type_Ounit), t_a)).
% 258.79/33.72  
% 258.79/33.72  Now clausify the problem and encode Horn clauses using encoding 3 of
% 258.79/33.72  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 258.79/33.72  We repeatedly replace C & s=t => u=v by the two clauses:
% 258.79/33.72    fresh(y, y, x1...xn) = u
% 258.79/33.72    C => fresh(s, t, x1...xn) = v
% 258.79/33.72  where fresh is a fresh function symbol and x1..xn are the free
% 258.79/33.72  variables of u and v.
% 258.79/33.72  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 258.79/33.72  input problem has no model of domain size 1).
% 258.79/33.72  
% 258.79/33.72  The encoding turns the above axioms into the following unit equations and goals:
% 258.79/33.72  
% 258.79/33.72  Axiom 1 (cls_Tarski_OA_A_61_61_Apset_Acl_0): v_A = c_Tarski_Opotype_Opset(v_cl, t_a, tc_Product__Type_Ounit).
% 258.79/33.72  Axiom 2 (cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0): fresh1088(X, X, Y) = true2.
% 258.79/33.72  Axiom 3 (cls_conjecture_0): c_lessequals(v_S, v_A, tc_set(t_a)) = true2.
% 258.79/33.72  Axiom 4 (cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0): fresh1088(c_lessequals(X, v_A, tc_set(t_a)), true2, X) = c_in(c_Tarski_Olub(X, v_cl, t_a), v_A, t_a).
% 258.79/33.72  
% 258.79/33.72  Goal 1 (cls_conjecture_2): c_in(c_Tarski_Olub(v_S, v_cl, t_a), c_Tarski_Opotype_Opset(v_cl, t_a, tc_Product__Type_Ounit), t_a) = true2.
% 258.79/33.72  Proof:
% 258.79/33.72    c_in(c_Tarski_Olub(v_S, v_cl, t_a), c_Tarski_Opotype_Opset(v_cl, t_a, tc_Product__Type_Ounit), t_a)
% 258.79/33.72  = { by axiom 1 (cls_Tarski_OA_A_61_61_Apset_Acl_0) R->L }
% 258.79/33.72    c_in(c_Tarski_Olub(v_S, v_cl, t_a), v_A, t_a)
% 258.79/33.72  = { by axiom 4 (cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0) R->L }
% 258.79/33.72    fresh1088(c_lessequals(v_S, v_A, tc_set(t_a)), true2, v_S)
% 258.79/33.72  = { by axiom 3 (cls_conjecture_0) }
% 258.79/33.72    fresh1088(true2, true2, v_S)
% 258.79/33.72  = { by axiom 2 (cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0) }
% 258.79/33.72    true2
% 258.79/33.72  % SZS output end Proof
% 258.79/33.72  
% 258.79/33.72  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------