%------------------------------------------------------------------------------ % File : Crossbow---0.1 % Problem : SWV016+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : do_Crossbow---0.1 %s % Computer : n017.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 16:29:47 EDT 2022 % Result : CounterSatisfiable 5.22s 5.39s % Output : FiniteModel 5.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWV016+1 : TPTP v8.1.0. Released v2.4.0. % 0.11/0.12 % Command : do_Crossbow---0.1 %s % 0.12/0.33 % Computer : n017.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 15 15:23:25 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.33 /export/starexec/sandbox2/solver/bin % 0.12/0.34 crossbow.opt % 0.12/0.34 do_Crossbow---0.1 % 0.12/0.34 eprover % 0.12/0.34 runsolver % 0.12/0.34 starexec_run_Crossbow---0.1 % 5.22/5.39 % SZS status CounterSatisfiable for theBenchmark.p % 5.22/5.39 % SZS output start FiniteModel for theBenchmark.p % 5.22/5.39 % domain size: 2 % 5.22/5.39 fof(interp, fi_domain, ![X] : (X = 0 | X = 1)). % 5.22/5.39 fof(interp, fi_functors, a = 0). % 5.22/5.39 fof(interp, fi_predicates, a_holds(0) & a_holds(1)). % 5.22/5.39 fof(interp, fi_predicates, ~a_key(0) & a_key(1)). % 5.22/5.39 fof(interp, fi_predicates, a_nonce(0) & ~a_nonce(1)). % 5.22/5.39 fof(interp, fi_predicates, a_stored(0) & ~a_stored(1)). % 5.22/5.39 fof(interp, fi_functors, an_a_nonce = 0). % 5.22/5.39 fof(interp, fi_functors, at = 0). % 5.22/5.39 fof(interp, fi_functors, b = 0). % 5.22/5.39 fof(interp, fi_predicates, ~b_holds(0) & b_holds(1)). % 5.22/5.39 fof(interp, fi_predicates, b_stored(0) & ~b_stored(1)). % 5.22/5.39 fof(interp, fi_functors, bt = 1). % 5.22/5.39 fof(interp, fi_functors, encrypt(0, 0) = 0 & encrypt(0, 1) = 0 & % 5.22/5.39 encrypt(1, 0) = 0 & % 5.22/5.39 encrypt(1, 1) = 0). % 5.22/5.39 fof(interp, fi_predicates, fresh_to_b(0) & ~fresh_to_b(1)). % 5.22/5.39 fof(interp, fi_functors, generate_b_nonce(0) = 0 & generate_b_nonce(1) = 0). % 5.22/5.39 fof(interp, fi_functors, generate_expiration_time(0) = 0 & % 5.22/5.39 generate_expiration_time(1) = 0). % 5.22/5.39 fof(interp, fi_functors, generate_key(0) = 1 & generate_key(1) = 1). % 5.22/5.39 fof(interp, fi_predicates, intruder_holds(0) & ~intruder_holds(1)). % 5.22/5.39 fof(interp, fi_predicates, intruder_message(0) & ~intruder_message(1)). % 5.22/5.39 fof(interp, fi_functors, key(0, 0) = 0 & key(0, 1) = 0 & key(1, 0) = 1 & % 5.22/5.39 key(1, 1) = 1). % 5.22/5.39 fof(interp, fi_predicates, message(0) & ~message(1)). % 5.22/5.39 fof(interp, fi_functors, pair(0, 0) = 0 & pair(0, 1) = 1 & pair(1, 0) = 1 & % 5.22/5.39 pair(1, 1) = 1). % 5.22/5.39 fof(interp, fi_predicates, party_of_protocol(0) & party_of_protocol(1)). % 5.22/5.39 fof(interp, fi_functors, quadruple(0, 0, 0, 0) = 0 & quadruple(0, 0, 0, 1) = 1 & % 5.22/5.39 quadruple(0, 0, 1, 0) = 1 & % 5.22/5.39 quadruple(0, 0, 1, 1) = 1 & % 5.22/5.39 quadruple(0, 1, 0, 0) = 1 & % 5.22/5.39 quadruple(0, 1, 0, 1) = 1 & % 5.22/5.39 quadruple(0, 1, 1, 0) = 1 & % 5.22/5.39 quadruple(0, 1, 1, 1) = 1 & % 5.22/5.39 quadruple(1, 0, 0, 0) = 1 & % 5.22/5.39 quadruple(1, 0, 0, 1) = 1 & % 5.22/5.39 quadruple(1, 0, 1, 0) = 1 & % 5.22/5.39 quadruple(1, 0, 1, 1) = 1 & % 5.22/5.39 quadruple(1, 1, 0, 0) = 1 & % 5.22/5.39 quadruple(1, 1, 0, 1) = 1 & % 5.22/5.39 quadruple(1, 1, 1, 0) = 1 & % 5.22/5.39 quadruple(1, 1, 1, 1) = 1). % 5.22/5.39 fof(interp, fi_functors, sent(0, 0, 0) = 0 & sent(0, 0, 1) = 1 & % 5.22/5.39 sent(0, 1, 0) = 0 & % 5.22/5.39 sent(0, 1, 1) = 1 & % 5.22/5.39 sent(1, 0, 0) = 0 & % 5.22/5.39 sent(1, 0, 1) = 1 & % 5.22/5.39 sent(1, 1, 0) = 0 & % 5.22/5.39 sent(1, 1, 1) = 1). % 5.22/5.39 fof(interp, fi_functors, t = 0). % 5.22/5.39 fof(interp, fi_predicates, t_holds(0) & t_holds(1)). % 5.22/5.39 fof(interp, fi_functors, triple(0, 0, 0) = 0 & triple(0, 0, 1) = 1 & % 5.22/5.39 triple(0, 1, 0) = 1 & % 5.22/5.39 triple(0, 1, 1) = 1 & % 5.22/5.39 triple(1, 0, 0) = 1 & % 5.22/5.39 triple(1, 0, 1) = 1 & % 5.22/5.39 triple(1, 1, 0) = 1 & % 5.22/5.39 triple(1, 1, 1) = 1). % 5.22/5.39 % SZS output end FiniteModel for theBenchmark.p % 5.22/5.40 % 6 lemma(s) from E % 5.22/5.40 % cnf(cl, axiom, intruder_message(a)). % 5.22/5.40 % cnf(cl, axiom, intruder_message(an_a_nonce)). % 5.22/5.40 % cnf(cl, axiom, intruder_message(b)). % 5.22/5.40 % cnf(cl, axiom, intruder_message(generate_b_nonce(an_a_nonce))). % 5.22/5.40 % cnf(cl, axiom, intruder_message(pair(a, an_a_nonce))). % 5.22/5.40 % cnf(cl, axiom, b_stored(pair(a, an_a_nonce))). % 5.22/5.40 % 60 pred(s) % 5.22/5.40 % 23 func(s) % 5.22/5.40 % 3 sort(s) % 5.22/5.40 % 102 clause(s) % 5.22/5.40 % Instantiating 1 (5026 ms) % 5.22/5.40 % Solving (5026 ms) % 5.22/5.40 % Instantiating 2 (5026 ms) % 5.22/5.40 % Solving (5029 ms) % 5.22/5.40 % % 5.22/5.40 % 1 model found (5030 ms) %------------------------------------------------------------------------------