TSTP Solution File: ANA013-2 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : ANA013-2 : 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 : n021.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 : Wed Aug 30 17:21:03 EDT 2023

% Result   : Unsatisfiable 0.13s 0.35s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : ANA013-2 : 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.13/0.31  % Computer : n021.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit : 300
% 0.13/0.31  % WCLimit  : 300
% 0.13/0.31  % DateTime : Fri Aug 25 18:49:11 EDT 2023
% 0.13/0.31  % CPUTime  : 
% 0.13/0.35  Command-line arguments: --no-flatten-goal
% 0.13/0.35  
% 0.13/0.35  % SZS status Unsatisfiable
% 0.13/0.35  
% 0.13/0.35  % SZS output start Proof
% 0.13/0.35  Take the following subset of the input axioms:
% 0.13/0.35    fof(cls_Orderings_Oorder__class_Oaxioms__1_0, axiom, ![T_a, V_x]: (~class_Orderings_Oorder(T_a) | c_lessequals(V_x, V_x, T_a))).
% 0.13/0.35    fof(cls_conjecture_0, negated_conjecture, ![V_U]: ~c_lessequals(c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(V_U)), t_b), t_b), c_times(V_U, c_HOL_Oabs(v_f(v_x(V_U)), t_b), t_b), t_b)).
% 0.13/0.35    fof(clsrel_Ring__and__Field_Oordered__idom_44, axiom, ![T]: (~class_Ring__and__Field_Oordered__idom(T) | class_Orderings_Oorder(T))).
% 0.13/0.35    fof(tfree_tcs, negated_conjecture, class_Ring__and__Field_Oordered__idom(t_b)).
% 0.13/0.35  
% 0.13/0.35  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.13/0.35  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.13/0.35  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.13/0.35    fresh(y, y, x1...xn) = u
% 0.13/0.35    C => fresh(s, t, x1...xn) = v
% 0.13/0.35  where fresh is a fresh function symbol and x1..xn are the free
% 0.13/0.35  variables of u and v.
% 0.13/0.35  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.13/0.35  input problem has no model of domain size 1).
% 0.13/0.35  
% 0.13/0.35  The encoding turns the above axioms into the following unit equations and goals:
% 0.13/0.35  
% 0.13/0.35  Axiom 1 (tfree_tcs): class_Ring__and__Field_Oordered__idom(t_b) = true2.
% 0.13/0.35  Axiom 2 (clsrel_Ring__and__Field_Oordered__idom_44): fresh2(X, X, Y) = true2.
% 0.13/0.35  Axiom 3 (cls_Orderings_Oorder__class_Oaxioms__1_0): fresh(X, X, Y, Z) = true2.
% 0.13/0.35  Axiom 4 (clsrel_Ring__and__Field_Oordered__idom_44): fresh2(class_Ring__and__Field_Oordered__idom(X), true2, X) = class_Orderings_Oorder(X).
% 0.13/0.35  Axiom 5 (cls_Orderings_Oorder__class_Oaxioms__1_0): fresh(class_Orderings_Oorder(X), true2, X, Y) = c_lessequals(Y, Y, X).
% 0.13/0.35  
% 0.13/0.35  Goal 1 (cls_conjecture_0): c_lessequals(c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(X)), t_b), t_b), c_times(X, c_HOL_Oabs(v_f(v_x(X)), t_b), t_b), t_b) = true2.
% 0.13/0.35  The goal is true when:
% 0.13/0.35    X = c_HOL_Oabs(v_c, t_b)
% 0.13/0.35  
% 0.13/0.35  Proof:
% 0.13/0.35    c_lessequals(c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b), c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b), t_b)
% 0.13/0.35  = { by axiom 5 (cls_Orderings_Oorder__class_Oaxioms__1_0) R->L }
% 0.13/0.35    fresh(class_Orderings_Oorder(t_b), true2, t_b, c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b))
% 0.13/0.35  = { by axiom 4 (clsrel_Ring__and__Field_Oordered__idom_44) R->L }
% 0.13/0.35    fresh(fresh2(class_Ring__and__Field_Oordered__idom(t_b), true2, t_b), true2, t_b, c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b))
% 0.13/0.35  = { by axiom 1 (tfree_tcs) }
% 0.13/0.35    fresh(fresh2(true2, true2, t_b), true2, t_b, c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b))
% 0.13/0.35  = { by axiom 2 (clsrel_Ring__and__Field_Oordered__idom_44) }
% 0.13/0.35    fresh(true2, true2, t_b, c_times(c_HOL_Oabs(v_c, t_b), c_HOL_Oabs(v_f(v_x(c_HOL_Oabs(v_c, t_b))), t_b), t_b))
% 0.13/0.35  = { by axiom 3 (cls_Orderings_Oorder__class_Oaxioms__1_0) }
% 0.13/0.35    true2
% 0.13/0.35  % SZS output end Proof
% 0.13/0.35  
% 0.13/0.35  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------