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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SET836-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 : n031.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 15:33:26 EDT 2023

% Result   : Unsatisfiable 46.24s 6.34s
% Output   : Proof 46.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : SET836-1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.35  % Computer : n031.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Sat Aug 26 09:06:52 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 46.24/6.34  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 46.24/6.34  
% 46.24/6.34  % SZS status Unsatisfiable
% 46.24/6.34  
% 46.24/6.34  % SZS output start Proof
% 46.24/6.34  Take the following subset of the input axioms:
% 46.24/6.34    fof(cls_Set_OsubsetD_0, axiom, ![T_a, V_A, V_B, V_c]: (~c_in(V_c, V_A, T_a) | (~c_lessequals(V_A, V_B, tc_set(T_a)) | c_in(V_c, V_B, T_a)))).
% 46.24/6.34    fof(cls_conjecture_1, negated_conjecture, c_lessequals(v_Z, v_X, tc_set(t_a))).
% 46.24/6.34    fof(cls_conjecture_2, negated_conjecture, c_in(v_x, v_Z, t_a)).
% 46.24/6.34    fof(cls_conjecture_3, negated_conjecture, ~c_in(v_x, v_X, t_a)).
% 46.24/6.34  
% 46.24/6.34  Now clausify the problem and encode Horn clauses using encoding 3 of
% 46.24/6.34  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 46.24/6.34  We repeatedly replace C & s=t => u=v by the two clauses:
% 46.24/6.34    fresh(y, y, x1...xn) = u
% 46.24/6.34    C => fresh(s, t, x1...xn) = v
% 46.24/6.34  where fresh is a fresh function symbol and x1..xn are the free
% 46.24/6.34  variables of u and v.
% 46.24/6.34  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 46.24/6.34  input problem has no model of domain size 1).
% 46.24/6.34  
% 46.24/6.34  The encoding turns the above axioms into the following unit equations and goals:
% 46.24/6.34  
% 46.24/6.34  Axiom 1 (cls_conjecture_2): c_in(v_x, v_Z, t_a) = true2.
% 46.24/6.34  Axiom 2 (cls_conjecture_1): c_lessequals(v_Z, v_X, tc_set(t_a)) = true2.
% 46.24/6.34  Axiom 3 (cls_Set_OsubsetD_0): fresh987(X, X, Y, Z, W) = true2.
% 46.24/6.34  Axiom 4 (cls_Set_OsubsetD_0): fresh988(X, X, Y, Z, W, V) = c_in(Y, V, W).
% 46.24/6.34  Axiom 5 (cls_Set_OsubsetD_0): fresh988(c_lessequals(X, Y, tc_set(Z)), true2, W, X, Z, Y) = fresh987(c_in(W, X, Z), true2, W, Z, Y).
% 46.24/6.34  
% 46.24/6.34  Goal 1 (cls_conjecture_3): c_in(v_x, v_X, t_a) = true2.
% 46.24/6.34  Proof:
% 46.24/6.34    c_in(v_x, v_X, t_a)
% 46.24/6.34  = { by axiom 4 (cls_Set_OsubsetD_0) R->L }
% 46.24/6.34    fresh988(true2, true2, v_x, v_Z, t_a, v_X)
% 46.24/6.34  = { by axiom 2 (cls_conjecture_1) R->L }
% 46.24/6.34    fresh988(c_lessequals(v_Z, v_X, tc_set(t_a)), true2, v_x, v_Z, t_a, v_X)
% 46.24/6.34  = { by axiom 5 (cls_Set_OsubsetD_0) }
% 46.24/6.34    fresh987(c_in(v_x, v_Z, t_a), true2, v_x, t_a, v_X)
% 46.24/6.34  = { by axiom 1 (cls_conjecture_2) }
% 46.24/6.34    fresh987(true2, true2, v_x, t_a, v_X)
% 46.24/6.34  = { by axiom 3 (cls_Set_OsubsetD_0) }
% 46.24/6.34    true2
% 46.24/6.34  % SZS output end Proof
% 46.24/6.34  
% 46.24/6.34  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------