TSTP Solution File: SWV325-2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWV325-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n019.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  : 600s
% DateTime : Wed Jul 20 18:20:25 EDT 2022

% Result   : Unsatisfiable 0.19s 0.37s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV325-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun 15 22:02:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  # No SInE strategy applied
% 0.19/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36  #
% 0.19/0.36  # Presaturation interreduction done
% 0.19/0.36  # Number of axioms: 12 Number of unprocessed: 12
% 0.19/0.36  # Tableaux proof search.
% 0.19/0.36  # APR header successfully linked.
% 0.19/0.36  # Hello from C++
% 0.19/0.36  # The folding up rule is enabled...
% 0.19/0.36  # Local unification is enabled...
% 0.19/0.36  # Any saturation attempts will use folding labels...
% 0.19/0.36  # 12 beginning clauses after preprocessing and clausification
% 0.19/0.36  # Creating start rules for all 7 conjectures.
% 0.19/0.36  # There are 7 start rule candidates:
% 0.19/0.36  # Found 6 unit axioms.
% 0.19/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36  # 7 start rule tableaux created.
% 0.19/0.36  # 6 extension rule candidate clauses
% 0.19/0.36  # 6 unit axiom clauses
% 0.19/0.36  
% 0.19/0.36  # Requested 8, 32 cores available to the main process.
% 0.19/0.36  # There are not enough tableaux to fork, creating more from the initial 7
% 0.19/0.36  # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36  # We now have 14 tableaux to operate on
% 0.19/0.37  # There were 1 total branch saturation attempts.
% 0.19/0.37  # There were 0 of these attempts blocked.
% 0.19/0.37  # There were 0 deferred branch saturation attempts.
% 0.19/0.37  # There were 0 free duplicated saturations.
% 0.19/0.37  # There were 1 total successful branch saturations.
% 0.19/0.37  # There were 0 successful branch saturations in interreduction.
% 0.19/0.37  # There were 0 successful branch saturations on the branch.
% 0.19/0.37  # There were 1 successful branch saturations after the branch.
% 0.19/0.37  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37  # Begin clausification derivation
% 0.19/0.37  
% 0.19/0.37  # End clausification derivation
% 0.19/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37  cnf(i_0_14, negated_conjecture, (c_in(v_evsf,c_OtwayRees_Ootway,tc_List_Olist(tc_Event_Oevent)))).
% 0.19/0.37  cnf(i_0_15, negated_conjecture, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_16, negated_conjecture, (c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_C)))),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_17, negated_conjecture, (c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_18, negated_conjecture, (v_B!=v_C)).
% 0.19/0.37  cnf(i_0_13, negated_conjecture, (~c_in(v_A,c_Event_Obad,tc_Message_Oagent))).
% 0.19/0.37  cnf(i_0_19, negated_conjecture, (~c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_C)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg)|~c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_22, plain, (c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)|~c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_24, plain, (c_in(X1,X2,X3)|c_in(X1,X4,X3)|~c_in(X1,c_union(X2,X4,X3),X3))).
% 0.19/0.37  cnf(i_0_23, plain, (c_in(X1,c_Event_Obad,tc_Message_Oagent)|~c_in(c_Message_Omsg_OKey(c_Public_OshrK(X1)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)|~c_in(X2,c_OtwayRees_Ootway,tc_List_Olist(tc_Event_Oevent)))).
% 0.19/0.37  cnf(i_0_20, plain, (c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)|c_in(c_Message_Omsg_OKey(X1),X3,tc_Message_Omsg)|~c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg))).
% 0.19/0.37  cnf(i_0_21, plain, (c_in(X1,c_union(c_Message_Osynth(c_Message_Oanalz(X2)),c_Message_Oparts(X2),tc_Message_Omsg),tc_Message_Omsg)|~c_in(X1,c_Message_Oparts(c_insert(X3,X2,tc_Message_Omsg)),tc_Message_Omsg)|~c_in(X3,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg))).
% 0.19/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.37  # Begin printing tableau
% 0.19/0.37  # Found 6 steps
% 0.19/0.37  cnf(i_0_13, negated_conjecture, (~c_in(v_A,c_Event_Obad,tc_Message_Oagent)), inference(start_rule)).
% 0.19/0.37  cnf(i_0_27, plain, (~c_in(v_A,c_Event_Obad,tc_Message_Oagent)), inference(extension_rule, [i_0_24])).
% 0.19/0.37  cnf(i_0_68, plain, (c_in(v_A,c_Event_Obad,tc_Message_Oagent)), inference(closure_rule, [i_0_13])).
% 0.19/0.37  cnf(i_0_69, plain, (~c_in(v_A,c_union(c_Event_Obad,c_Event_Obad,tc_Message_Oagent),tc_Message_Oagent)), inference(extension_rule, [i_0_24])).
% 0.19/0.37  cnf(i_0_84, plain, (c_in(v_A,c_Event_Obad,tc_Message_Oagent)), inference(closure_rule, [i_0_13])).
% 0.19/0.37  cnf(i_0_85, plain, (~c_in(v_A,c_union(c_union(c_Event_Obad,c_Event_Obad,tc_Message_Oagent),c_Event_Obad,tc_Message_Oagent),tc_Message_Oagent)), inference(etableau_closure_rule, [i_0_85, ...])).
% 0.19/0.37  # End printing tableau
% 0.19/0.37  # SZS output end
% 0.19/0.37  # Branches closed with saturation will be marked with an "s"
% 0.19/0.37  # There were 1 total branch saturation attempts.
% 0.19/0.37  # There were 0 of these attempts blocked.
% 0.19/0.37  # There were 0 deferred branch saturation attempts.
% 0.19/0.37  # There were 0 free duplicated saturations.
% 0.19/0.37  # There were 1 total successful branch saturations.
% 0.19/0.37  # There were 0 successful branch saturations in interreduction.
% 0.19/0.37  # There were 0 successful branch saturations on the branch.
% 0.19/0.37  # There were 1 successful branch saturations after the branch.
% 0.19/0.37  # Child (28944) has found a proof.
% 0.19/0.37  
% 0.19/0.37  # Proof search is over...
% 0.19/0.37  # Freeing feature tree
%------------------------------------------------------------------------------