TSTP Solution File: SWV018+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV018+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 : n009.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:58 EDT 2022
% Result : CounterSatisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV018+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n009.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 18:27:53 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.19/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 44 Number of unprocessed: 44
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.39 # The folding up rule is enabled...
% 0.19/0.39 # Local unification is enabled...
% 0.19/0.39 # Any saturation attempts will use folding labels...
% 0.19/0.39 # 44 beginning clauses after preprocessing and clausification
% 0.19/0.39 # Creating start rules for all 1 conjectures.
% 0.19/0.39 # There are 1 start rule candidates:
% 0.19/0.39 # Found 16 unit axioms.
% 0.19/0.39 # 1 start rule tableaux created.
% 0.19/0.39 # 28 extension rule candidate clauses
% 0.19/0.39 # 16 unit axiom clauses
% 0.19/0.39
% 0.19/0.39 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.39 # 22050 Satisfiable branch
% 0.19/0.39 # Satisfiable branch found.
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 0 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 0 successful branch saturations after the branch.
% 0.19/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_15, plain, (party_of_protocol(t))).
% 0.19/0.39 cnf(i_0_2, plain, (party_of_protocol(a))).
% 0.19/0.39 cnf(i_0_8, plain, (party_of_protocol(b))).
% 0.19/0.39 cnf(i_0_9, plain, (fresh_to_b(an_a_nonce))).
% 0.19/0.39 cnf(i_0_34, plain, (a_nonce(an_a_nonce))).
% 0.19/0.39 cnf(i_0_40, plain, (fresh_intruder_nonce(an_intruder_nonce))).
% 0.19/0.39 cnf(i_0_39, plain, (a_key(generate_key(X1)))).
% 0.19/0.39 cnf(i_0_36, plain, (a_nonce(generate_b_nonce(X1)))).
% 0.19/0.39 cnf(i_0_7, plain, (b_holds(key(bt,t)))).
% 0.19/0.39 cnf(i_0_37, plain, (a_nonce(generate_expiration_time(X1)))).
% 0.19/0.39 cnf(i_0_1, plain, (a_holds(key(at,t)))).
% 0.19/0.39 cnf(i_0_13, plain, (t_holds(key(at,a)))).
% 0.19/0.39 cnf(i_0_14, plain, (t_holds(key(bt,b)))).
% 0.19/0.39 cnf(i_0_4, plain, (a_stored(pair(b,an_a_nonce)))).
% 0.19/0.39 cnf(i_0_3, plain, (message(sent(a,b,pair(a,an_a_nonce))))).
% 0.19/0.39 cnf(i_0_35, plain, (~a_nonce(generate_key(X1)))).
% 0.19/0.39 cnf(i_0_38, plain, (~a_nonce(X1)|~a_key(X1))).
% 0.19/0.39 cnf(i_0_42, plain, (intruder_message(X1)|~fresh_intruder_nonce(X1))).
% 0.19/0.39 cnf(i_0_43, plain, (fresh_to_b(X1)|~fresh_intruder_nonce(X1))).
% 0.19/0.39 cnf(i_0_44, negated_conjecture, (~intruder_holds(key(X1,X2))|~b_holds(key(X1,X3)))).
% 0.19/0.39 cnf(i_0_41, plain, (fresh_intruder_nonce(generate_intruder_nonce(X1))|~fresh_intruder_nonce(X1))).
% 0.19/0.39 cnf(i_0_18, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1)))).
% 0.19/0.39 cnf(i_0_19, plain, (intruder_message(X1)|~intruder_message(pair(X1,X2)))).
% 0.19/0.39 cnf(i_0_17, plain, (intruder_message(X1)|~message(sent(X2,X3,X1)))).
% 0.19/0.39 cnf(i_0_20, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1)))).
% 0.19/0.39 cnf(i_0_32, plain, (intruder_holds(key(X1,X2))|~intruder_message(X1)|~party_of_protocol(X2))).
% 0.19/0.39 cnf(i_0_21, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3)))).
% 0.19/0.39 cnf(i_0_22, plain, (intruder_message(X1)|~intruder_message(triple(X1,X2,X3)))).
% 0.19/0.39 cnf(i_0_27, plain, (intruder_message(pair(X1,X2))|~intruder_message(X2)|~intruder_message(X1))).
% 0.19/0.39 cnf(i_0_23, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X4,X1)))).
% 0.19/0.39 cnf(i_0_24, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X1,X4)))).
% 0.19/0.39 cnf(i_0_25, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X1,X3,X4)))).
% 0.19/0.39 cnf(i_0_26, plain, (intruder_message(X1)|~intruder_message(quadruple(X1,X2,X3,X4)))).
% 0.19/0.39 cnf(i_0_31, plain, (message(sent(X1,X2,X3))|~intruder_message(X3)|~party_of_protocol(X2)|~party_of_protocol(X1))).
% 0.19/0.39 cnf(i_0_30, plain, (intruder_message(X1)|~intruder_holds(key(X1,X2))|~intruder_message(encrypt(X3,X1))|~party_of_protocol(X2))).
% 0.19/0.39 cnf(i_0_33, plain, (intruder_message(encrypt(X1,X2))|~intruder_holds(key(X2,X3))|~intruder_message(X1)|~party_of_protocol(X3))).
% 0.19/0.39 cnf(i_0_28, plain, (intruder_message(triple(X1,X2,X3))|~intruder_message(X3)|~intruder_message(X2)|~intruder_message(X1))).
% 0.19/0.39 cnf(i_0_10, plain, (b_stored(pair(X1,X2))|~fresh_to_b(X2)|~message(sent(X1,b,pair(X1,X2))))).
% 0.19/0.39 cnf(i_0_29, plain, (intruder_message(quadruple(X1,X2,X3,X4))|~intruder_message(X4)|~intruder_message(X3)|~intruder_message(X2)|~intruder_message(X1))).
% 0.19/0.39 cnf(i_0_5, plain, (a_holds(key(X1,X2))|~a_stored(pair(X2,X3))|~message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6))))).
% 0.19/0.39 cnf(i_0_12, plain, (b_holds(key(X1,X2))|~a_key(X1)|~b_stored(pair(X2,X3))|~message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))))).
% 0.19/0.39 cnf(i_0_6, 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.19/0.39 cnf(i_0_11, 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.19/0.39 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)))|~a_nonce(X3)|~t_holds(key(X5,X1))|~t_holds(key(X6,X2))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 5 steps
% 0.19/0.39 cnf(i_0_44, negated_conjecture, (~intruder_holds(key(bt,t))|~b_holds(key(bt,t))), inference(start_rule)).
% 0.19/0.39 cnf(i_0_46, plain, (~b_holds(key(bt,t))), inference(closure_rule, [i_0_7])).
% 0.19/0.39 cnf(i_0_45, plain, (~intruder_holds(key(bt,t))), inference(extension_rule, [i_0_32])).
% 0.19/0.39 cnf(i_0_65, plain, (~party_of_protocol(t)), inference(closure_rule, [i_0_15])).
% 0.19/0.39 cnf(i_0_64, plain, (~intruder_message(bt)), inference(extension_rule, [i_0_42])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.39 # We now have 1 tableaux to operate on
% 0.19/0.39 # Found closed tableau during pool population.
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------