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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV356-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 : n011.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:03:54 EDT 2023

% Result   : Unsatisfiable 0.20s 0.38s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWV356-2 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.13  % 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 : n011.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 05:26:56 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.38  Command-line arguments: --ground-connectedness --complete-subsets
% 0.20/0.38  
% 0.20/0.38  % SZS status Unsatisfiable
% 0.20/0.38  
% 0.20/0.38  % SZS output start Proof
% 0.20/0.38  Take the following subset of the input axioms:
% 0.20/0.38    fof(cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0, axiom, ![V_c, V_evs]: (~c_in(V_c, c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy, V_evs)), tc_Message_Omsg) | c_in(V_c, c_Event_Oused(V_evs), tc_Message_Omsg))).
% 0.20/0.38    fof(cls_Message_Oanalz__conj__parts_0, axiom, ![V_X, V_H]: (~c_in(V_X, c_Message_Oanalz(V_H), tc_Message_Omsg) | c_in(V_X, c_Message_Oparts(V_H), tc_Message_Omsg))).
% 0.20/0.38    fof(cls_conjecture_3, negated_conjecture, ~c_in(c_Message_Omsg_ONonce(v_NB), c_Event_Oused(v_evs2), tc_Message_Omsg)).
% 0.20/0.38    fof(cls_conjecture_7, negated_conjecture, c_in(c_Message_Omsg_ONonce(v_NB), c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), tc_Message_Omsg)).
% 0.20/0.38  
% 0.20/0.38  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.38  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.38  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.38    fresh(y, y, x1...xn) = u
% 0.20/0.38    C => fresh(s, t, x1...xn) = v
% 0.20/0.38  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.38  variables of u and v.
% 0.20/0.38  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.38  input problem has no model of domain size 1).
% 0.20/0.38  
% 0.20/0.38  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.38  
% 0.20/0.38  Axiom 1 (cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0): fresh(X, X, Y, Z) = true.
% 0.20/0.38  Axiom 2 (cls_Message_Oanalz__conj__parts_0): fresh2(X, X, Y, Z) = true.
% 0.20/0.38  Axiom 3 (cls_conjecture_7): c_in(c_Message_Omsg_ONonce(v_NB), c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), tc_Message_Omsg) = true.
% 0.20/0.38  Axiom 4 (cls_Message_Oanalz__conj__parts_0): fresh2(c_in(X, c_Message_Oanalz(Y), tc_Message_Omsg), true, X, Y) = c_in(X, c_Message_Oparts(Y), tc_Message_Omsg).
% 0.20/0.38  Axiom 5 (cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0): fresh(c_in(X, c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy, Y)), tc_Message_Omsg), true, X, Y) = c_in(X, c_Event_Oused(Y), tc_Message_Omsg).
% 0.20/0.38  
% 0.20/0.38  Goal 1 (cls_conjecture_3): c_in(c_Message_Omsg_ONonce(v_NB), c_Event_Oused(v_evs2), tc_Message_Omsg) = true.
% 0.20/0.38  Proof:
% 0.20/0.38    c_in(c_Message_Omsg_ONonce(v_NB), c_Event_Oused(v_evs2), tc_Message_Omsg)
% 0.20/0.38  = { by axiom 5 (cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0) R->L }
% 0.20/0.38    fresh(c_in(c_Message_Omsg_ONonce(v_NB), c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), tc_Message_Omsg), true, c_Message_Omsg_ONonce(v_NB), v_evs2)
% 0.20/0.38  = { by axiom 4 (cls_Message_Oanalz__conj__parts_0) R->L }
% 0.20/0.38    fresh(fresh2(c_in(c_Message_Omsg_ONonce(v_NB), c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), tc_Message_Omsg), true, c_Message_Omsg_ONonce(v_NB), c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), true, c_Message_Omsg_ONonce(v_NB), v_evs2)
% 0.20/0.38  = { by axiom 3 (cls_conjecture_7) }
% 0.20/0.38    fresh(fresh2(true, true, c_Message_Omsg_ONonce(v_NB), c_Event_Oknows(c_Message_Oagent_OSpy, v_evs2)), true, c_Message_Omsg_ONonce(v_NB), v_evs2)
% 0.20/0.38  = { by axiom 2 (cls_Message_Oanalz__conj__parts_0) }
% 0.20/0.38    fresh(true, true, c_Message_Omsg_ONonce(v_NB), v_evs2)
% 0.20/0.38  = { by axiom 1 (cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0) }
% 0.20/0.38    true
% 0.20/0.38  % SZS output end Proof
% 0.20/0.38  
% 0.20/0.38  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------