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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV690-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 : n027.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 23:05:54 EDT 2023

% Result   : Unsatisfiable 39.13s 5.37s
% Output   : Proof 39.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV690-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.12  % 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 : n027.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 : Tue Aug 29 09:03:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 39.13/5.37  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 39.13/5.37  
% 39.13/5.37  % SZS status Unsatisfiable
% 39.13/5.37  
% 39.13/5.37  % SZS output start Proof
% 39.13/5.37  Take the following subset of the input axioms:
% 39.13/5.37    fof(cls_conjecture_0, negated_conjecture, c_HOL_Oord__class_Oless(v_k, v_n, tc_nat)).
% 39.13/5.37    fof(cls_conjecture_1, negated_conjecture, ~c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k, v_i, tc_nat), v_n, tc_nat)).
% 39.13/5.37    fof(cls_less__imp__diff__less_0, axiom, ![V_n, V_j, V_k]: (c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(V_j, V_n, tc_nat), V_k, tc_nat) | ~c_HOL_Oord__class_Oless(V_j, V_k, tc_nat))).
% 39.13/5.37  
% 39.13/5.37  Now clausify the problem and encode Horn clauses using encoding 3 of
% 39.13/5.37  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 39.13/5.37  We repeatedly replace C & s=t => u=v by the two clauses:
% 39.13/5.37    fresh(y, y, x1...xn) = u
% 39.13/5.37    C => fresh(s, t, x1...xn) = v
% 39.13/5.37  where fresh is a fresh function symbol and x1..xn are the free
% 39.13/5.37  variables of u and v.
% 39.13/5.37  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 39.13/5.37  input problem has no model of domain size 1).
% 39.13/5.37  
% 39.13/5.37  The encoding turns the above axioms into the following unit equations and goals:
% 39.13/5.37  
% 39.13/5.37  Axiom 1 (cls_conjecture_0): c_HOL_Oord__class_Oless(v_k, v_n, tc_nat) = true2.
% 39.13/5.37  Axiom 2 (cls_less__imp__diff__less_0): fresh372(X, X, Y, Z, W) = true2.
% 39.13/5.37  Axiom 3 (cls_less__imp__diff__less_0): fresh372(c_HOL_Oord__class_Oless(X, Y, tc_nat), true2, X, Z, Y) = c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(X, Z, tc_nat), Y, tc_nat).
% 39.13/5.37  
% 39.13/5.37  Goal 1 (cls_conjecture_1): c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k, v_i, tc_nat), v_n, tc_nat) = true2.
% 39.13/5.37  Proof:
% 39.13/5.37    c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k, v_i, tc_nat), v_n, tc_nat)
% 39.13/5.37  = { by axiom 3 (cls_less__imp__diff__less_0) R->L }
% 39.13/5.37    fresh372(c_HOL_Oord__class_Oless(v_k, v_n, tc_nat), true2, v_k, v_i, v_n)
% 39.13/5.37  = { by axiom 1 (cls_conjecture_0) }
% 39.13/5.37    fresh372(true2, true2, v_k, v_i, v_n)
% 39.13/5.37  = { by axiom 2 (cls_less__imp__diff__less_0) }
% 39.13/5.37    true2
% 39.13/5.37  % SZS output end Proof
% 39.13/5.37  
% 39.13/5.37  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------