TSTP Solution File: SWV010-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWV010-1 : TPTP v8.1.0. Released v2.4.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 : n012.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:18:54 EDT 2022

% Result   : Satisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV010-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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 : n012.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 : Tue Jun 14 16:43:10 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  # Number of axioms: 8 Number of unprocessed: 8
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # Hello from C++
% 0.13/0.36  # The folding up rule is enabled...
% 0.13/0.36  # Local unification is enabled...
% 0.13/0.36  # Any saturation attempts will use folding labels...
% 0.13/0.36  # 8 beginning clauses after preprocessing and clausification
% 0.13/0.36  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.13/0.36  # No conjectures.
% 0.13/0.36  # There are 8 start rule candidates:
% 0.13/0.36  # Found 5 unit axioms.
% 0.13/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36  # 8 start rule tableaux created.
% 0.13/0.36  # 3 extension rule candidate clauses
% 0.13/0.36  # 5 unit axiom clauses
% 0.13/0.36  
% 0.13/0.36  # Requested 8, 32 cores available to the main process.
% 0.13/0.37  # 12315 Satisfiable branch
% 0.13/0.37  # 12320 Satisfiable branch
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # 12319 Satisfiable branch
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_12, plain, (fresh_to_b(an_a_nonce))).
% 0.13/0.37  cnf(i_0_10, plain, (a_stored(pair(b,an_a_nonce)))).
% 0.13/0.37  cnf(i_0_14, plain, (t_holds(key(at,a)))).
% 0.13/0.37  cnf(i_0_15, plain, (t_holds(key(bt,b)))).
% 0.13/0.37  cnf(i_0_9, plain, (message(sent(a,b,pair(a,an_a_nonce))))).
% 0.13/0.37  cnf(i_0_13, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~fresh_to_b(X1)|~message(sent(X2,b,pair(X2,X1))))).
% 0.13/0.37  cnf(i_0_11, plain, (message(sent(a,X1,pair(X2,encrypt(X3,X4))))|~a_stored(pair(X1,X5))|~message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3))))).
% 0.13/0.37  cnf(i_0_16, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~t_holds(key(X6,X2))|~t_holds(key(X5,X1))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 6 steps
% 0.13/0.37  cnf(i_0_12, plain, (fresh_to_b(an_a_nonce)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_17, plain, (fresh_to_b(an_a_nonce)), inference(extension_rule, [i_0_13])).
% 0.13/0.37  cnf(i_0_34, plain, (~message(sent(a,b,pair(a,an_a_nonce)))), inference(closure_rule, [i_0_9])).
% 0.13/0.37  cnf(i_0_32, plain, (message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))))), inference(extension_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_39, plain, (~t_holds(key(bt,b))), inference(closure_rule, [i_0_15])).
% 0.13/0.37  cnf(i_0_40, plain, (~t_holds(key(at,a))), inference(closure_rule, [i_0_14])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # Child (12315) has found a proof.
% 0.13/0.37  
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_12, plain, (fresh_to_b(an_a_nonce))).
% 0.13/0.37  cnf(i_0_10, plain, (a_stored(pair(b,an_a_nonce)))).
% 0.13/0.37  cnf(i_0_14, plain, (t_holds(key(at,a)))).
% 0.13/0.37  cnf(i_0_15, plain, (t_holds(key(bt,b)))).
% 0.13/0.37  cnf(i_0_9, plain, (message(sent(a,b,pair(a,an_a_nonce))))).
% 0.13/0.37  cnf(i_0_13, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~fresh_to_b(X1)|~message(sent(X2,b,pair(X2,X1))))).
% 0.13/0.37  cnf(i_0_11, plain, (message(sent(a,X1,pair(X2,encrypt(X3,X4))))|~a_stored(pair(X1,X5))|~message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3))))).
% 0.13/0.37  cnf(i_0_16, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~t_holds(key(X6,X2))|~t_holds(key(X5,X1))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 8 steps
% 0.13/0.37  cnf(i_0_13, plain, (message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))))|~fresh_to_b(an_a_nonce)|~message(sent(a,b,pair(a,an_a_nonce)))), inference(start_rule)).
% 0.13/0.37  cnf(i_0_23, plain, (~fresh_to_b(an_a_nonce)), inference(closure_rule, [i_0_12])).
% 0.13/0.37  cnf(i_0_24, plain, (~message(sent(a,b,pair(a,an_a_nonce)))), inference(closure_rule, [i_0_9])).
% 0.13/0.37  cnf(i_0_22, plain, (message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))))), inference(extension_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_39, plain, (~t_holds(key(bt,b))), inference(closure_rule, [i_0_15])).
% 0.13/0.37  cnf(i_0_40, plain, (~t_holds(key(at,a))), inference(closure_rule, [i_0_14])).
% 0.13/0.37  cnf(i_0_38, plain, (message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce))))), inference(extension_rule, [i_0_11])).
% 0.13/0.37  cnf(i_0_46, plain, (~a_stored(pair(b,an_a_nonce))), inference(closure_rule, [i_0_10])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Proof search is over...
% 0.13/0.37  # Freeing feature tree
%------------------------------------------------------------------------------